Multi‐fidelity error estimation accelerates greedy model reduction of complex dynamical systems
From MaRDI portal
Publication:6148533
Abstract: Model order reduction usually consists of two stages: the offline stage and the online stage. The offline stage is the expensive part that sometimes takes hours till the final reduced-order model is derived, especially when the original model is very large or complex. Once the reduced-order model is obtained, the online stage of querying the reduced-order model for simulation is very fast and often real-time capable. This work concerns a strategy to significantly speed up the offline stage of model order reduction for large and complex systems. In particular, it is successful in accelerating the greedy algorithm that is often used in the offline stage for reduced-order model construction. We propose multi-fidelity error estimators and replace the high-fidelity error estimator in the greedy algorithm. Consequently, the computational complexity at each iteration of the greedy algorithm is reduced and the algorithm converges more than 3 times faster without incurring noticeable accuracy loss.
Cites work
- A posteriorierror bounds for reduced-basis approximations of parametrized parabolic partial differential equations
- A hierarchical a posteriori error estimator for the reduced basis method
- A progressive reduced basis/empirical interpolation method for nonlinear parabolic problems
- A survey of projection-based model reduction methods for parametric dynamical systems
- Adaptive interpolatory MOR by learning the error estimator in the parameter domain
- An adaptive and efficient greedy procedure for the optimal training of parametric reduced-order models
- An adaptive sampling approach for the reduced basis method
- An efficient output error estimation for model order reduction of parametrized evolution equations
- Applications
- Approximation of Large-Scale Dynamical Systems
- Certified real‐time solution of the parametrized steady incompressible Navier–Stokes equations: rigorous reduced‐basis a posteriori error bounds
- Certified reduced basis methods for nonaffine linear time-varying and nonlinear parabolic partial differential equations
- Convergence rates for greedy algorithms in reduced basis methods
- Efficient reduced models anda posteriorierror estimation for parametrized dynamical systems by offline/online decomposition
- Efficient reduced-basis treatment of nonaffine and nonlinear partial differential equations
- Greedy algorithms for reduced bases in Banach spaces
- Interpolatory projection methods for structure-preserving model reduction
- Model order reduction for linear and nonlinear systems: a system-theoretic perspective
- Model reduction and approximation. Theory and algorithms
- On error estimation for reduced-order modeling of linear non-parametric and parametric systems
- Randomized Residual-Based Error Estimators for Parametrized Equations
- Reduced basis approximation and a posteriori error estimation for affinely parametrized elliptic coercive partial differential equations. Application to transport and continuum mechanics.
- Reduced basis method for finite volume approximations of parametrized linear evolution equations
- Reduced basis methods for partial differential equations. An introduction
- Rigorous and effective a-posteriori error bounds for nonlinear problems -- application to RB methods
- Simultaneous empirical interpolation and reduced basis method for non-linear problems
- Snapshot-Based Methods and Algorithms
- Some a posteriori error bounds for reduced-order modelling of (non-)parametrized linear systems
- System- and Data-Driven Methods and Algorithms
- \textit{A priori} convergence of the greedy algorithm for the parametrized reduced basis method
This page was built for publication: Multi‐fidelity error estimation accelerates greedy model reduction of complex dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6148533)
