Motivated by a recently proposed error estimator for the transfer function of the reduced-order model of a given linear dynamical system, we further develop more theoretical results in this work. Furthermore, we propose several variants of the error estimator, and compare those variants with the existing ones both theoretically and numerically. It has been shown that some of the proposed error estimators perform better than or equally well as the existing ones. All the error estimators considered can be easily extended to estimate output error of reduced-order modeling for steady linear parametric systems.
In this article, we propose a data-driven reduced basis (RB) method for the approximation of parametric eigenvalue problems. The method is based on the offline and online paradigms. In the offline stage, we generate snapshots and construct the basis of the reduced space, using a POD approach. Gaussian process regressions (GPR) are used for approximating the eigenvalues and projection coefficients of the eigenvectors in the reduced space. All the GPR corresponding to the eigenvalues and projection coefficients are trained in the offline stage, using the data generated in the offline stage. The …
The need for accelerating the repeated solving of certain parametrized systems motivates the development of more efficient reduced order methods. The classical reduced basis method is popular due to an offline-online decomposition and a mathematically rigorous {\em a posterior} error estimator which guides a greedy algorithm offline. For nonlinear and nonaffine problems, hyper reduction techniques have been introduced to make this decomposition efficient. However, they may be tricky to implement and often degrade the online computation efficiency. To avoid this degradation, reduced residual re…
In this article, we develop a reduced basis method for efficiently solving the coupled Stokes/Darcy equations with parametric internal geometry. To accommodate possible changes in topology, we define the Stokes and Darcy domains implicitly via a phase-field indicator function. In our reduced order model, we approximate the parameter-dependent phase-field function with a discrete empirical interpolation method (DEIM) that enables affine decomposition of the associated linear and bilinear forms. In addition, we introduce a modification of DEIM that leads to non-negativity preserving approximatio…
In this article we apply reduced order techniques for the approximation of parametric eigenvalue problems. The effect of the choice of sampling points is investigated. Here we use the standard proper orthogonal decomposition technique to obtain the basis of the reduced space and Galerking orthogonal technique is used to get the reduced problem. We present some numerical results and observe that the use of sparse sampling is a good idea for sampling if the dimension of parameter space is high.
Parametric Analytical Preconditioning and its Applications to the Reduced Collocation Methods
University of Massachusetts Dartmouth（马萨诸塞大学达特茅斯分校）；Sorbonne Universités, UPMC Univ Paris 06（索邦大学，巴黎第六大学）；Institut Universitaire de France（法国高等研究院）；Brown University（布朗大学）
We consider a linear elliptic partial differential equation (PDE) with a generic uniformly bounded parametric coefficient. The solution to this PDE problem is approximated in the framework of stochastic Galerkin finite element methods. We perform a posteriori error analysis of Galerkin approximations and derive a reliable and efficient estimate for the energy error in these approximations. Practical versions of this error estimate are discussed and tested numerically for a model problem with non-affine parametric representation of the coefficient. Furthermore, we use the error reduction indica…
Dynamic Mode Decomposition (DMD) is a model-order reduction approach, whereby spatial modes of fixed temporal frequencies are extracted from numerical or experimental data sets. The DMD low-rank or reduced operator is typically obtained by singular value decomposition of the temporal data sets. For parameter-dependent models, as found in many multi-query applications such as uncertainty quantification or design optimization, the only parametric DMD technique developed was a stacked approach, with data sets at multiples parameter values were aggregated together, increasing the computational wor…
We propose a projection-based model order reduction procedure for a general class of parametric quasi-static problems in nonlinear mechanics with internal variables. The methodology is integrated in the industrial finite element code code aster. Model order reduction aims to lower the computational cost of engineering studies that involve the simulation to a costly high-fidelity differential model for many different parameters, which correspond, for example to material properties or initial and boundary conditions. We develop an adaptive algorithm based on a POD-Greedy strategy, and we develop…
An adaptive parametric reduced-order modeling method based on interpolating poles of reduced-order models is proposed in this paper. To guarantee correct interpolation, a pole-matching process is conducted to determine which poles of two reduced-order models correspond to the same parametric pole. First, the pole-matching in the scenario of parameter perturbation is discussed. It is formulated as a combinatorial optimization problem and solved by a branch and bound algorithm. Then, an adaptive framework is proposed to build repository ROMs at adaptively chosen parameter values, which well repr…
The Inertia Relief (IR) technique is widely used by industry and produces equilibrated loads allowing to analyze unconstrained systems without resorting to the more expensive full dynamic analysis. The main goal of this work is to develop a computational framework for the solution of unconstrained parametric structural problems with IR and the Proper Generalized Decomposition (PGD) method. First, the IR method is formulated in a parametric setting for both material and geometric parameters. A reduced order model using the encapsulated PGD suite is then developed to solve the parametric IR prob…
Projection-based reduced order models are effective at approximating parameter-dependent differential equations that are parametrically separable. When parametric separability is not satisfied, which occurs in both linear and nonlinear problems, projection-based methods fail to adequately reduce the computational complexity. Devising alternative reduced order models is crucial for obtaining efficient and accurate approximations to expensive high-fidelity models. In this work, we develop a time-stepping procedure for dynamical parameter-dependent problems, in which a neural-network is trained t…
A new application of subspaces interpolation for the construction of nonlinear Parametric Reduced Order Models (PROMs) is proposed. This approach is based upon the Riemannian geometry of the manifold formed by the quotient of the set of full-rank N-by-q matrices by the orthogonal group of dimension q. By using a set of untrained parametrized Proper Orthogonal Decomposition (POD) subspaces of dimension q, the subspace for a new untrained parameter is obtained as the generalized Karcher barycenter which solution is sought after by solving a simple fixed point problem. Contrary to existing PROM a…
In this paper, a non-intrusive reduced-order model (ROM) for parametric reactor kinetics simulations is presented. Time-dependent ROMs are notoriously data intensive and difficult to implement when nonlinear multiphysics phenomena are considered. These challenges are exacerbated when parametric dependencies are included. The proper orthogonal decomposition mode coefficient interpolation (POD-MCI) ROM presented in this work can be constructed directly from lower-dimensional quantities of interest (QoIs) and is independent of the underlying model. This greatly alleviates the data requirement of …
An adaptive approach to using reduced-order models as surrogates in PDE-constrained optimization is introduced that breaks the traditional offline-online framework of model order reduction. A sequence of optimization problems constrained by a given Reduced-Order Model (ROM) is defined with the goal of converging to the solution of a given PDE-constrained optimization problem. For each reduced optimization problem, the constraining ROM is trained from sampling the High-Dimensional Model (HDM) at the solution of some of the previous problems in the sequence. The reduced optimization problems are…
The University of Texas at Austin（德克萨斯大学奥斯汀分校）；University of Michigan（密歇根大学）
We propose a scalable framework for the learning of high-dimensional parametric maps via adaptively constructed residual network (ResNet) maps between reduced bases of the inputs and outputs. When just few training data are available, it is beneficial to have a compact parametrization in order to ameliorate the ill-posedness of the neural network training problem. By linearly restricting high-dimensional maps to informed reduced bases of the inputs, one can compress high-dimensional maps in a constructive way that can be used to detect appropriate basis ranks, equipped with rigorous error esti…
In this paper, we generalize existing frameworks for $\mathcal{H}_2\otimes\mathcal{L}_2$-optimal model order reduction to a broad class of parametric linear time-invariant systems. To this end, we derive first-order necessary ptimality conditions for a class of structured reduced-order models, and then building on those, propose a stability-preserving optimization-based method for computing locally $\mathcal{H}_2\otimes\mathcal{L}_2$-optimal reduced-order models. We also make a theoretical comparison to existing approaches in the literature, and in numerical experiments, show how our new metho…
