Randomized linear algebra for model reduction. I. Galerkin methods and error estimation
From MaRDI portal
Publication:2305558
Abstract: We propose a probabilistic way for reducing the cost of classical projection-based model order reduction methods for parameter-dependent linear equations. A reduced order model is here approximated from its random sketch, which is a set of low-dimensional random projections of the reduced approximation space and the spaces of associated residuals. This approach exploits the fact that the residuals associated with approximations in low-dimensional spaces are also contained in low-dimensional spaces. We provide conditions on the dimension of the random sketch for the resulting reduced order model to be quasi-optimal with high probability. Our approach can be used for reducing both complexity and memory requirements. The provided algorithms are well suited for any modern computational environment. Major operations, except solving linear systems of equations, are embarrassingly parallel. Our version of proper orthogonal decomposition can be computed on multiple workstations with a communication cost independent of the dimension of the full order model. The reduced order model can even be constructed in a so-called streaming environment, i.e., under extreme memory constraints. In addition, we provide an efficient way for estimating the error of the reduced order model, which is not only more efficient than the classical approach but is also less sensitive to round-off errors. Finally, the methodology is validated on benchmark problems.
Recommendations
- Randomized linear algebra for model reduction. II: Minimal residual methods and dictionary-based approximation
- Randomized local model order reduction
- Randomized model order reduction
- Model reduction with MapReduce-enabled tall and skinny singular value decomposition
- Model order reduction by proper orthogonal decomposition
Cites work
- A fast direct solver for a class of elliptic partial differential equations
- A general multipurpose interpolation procedure: The magic points
- A high-performance parallel implementation of the certified reduced basis method
- A survey of projection-based model reduction methods for parametric dynamical systems
- Accurate and online-efficient evaluation of the a posteriori error bound in the reduced basis method
- An introduction to matrix concentration inequalities
- Approximation of zonoids by zonotopes
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Fast dimension reduction using Rademacher series on dual BCH codes
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Finite elements and fast iterative solvers. With applications in incompressible fluid dynamics
- Hierarchical Approximate Proper Orthogonal Decomposition
- Hierarchical matrices: algorithms and analysis
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- Improved analysis of the subsampled randomized Hadamard transform
- Improved matrix algorithms via the subsampled randomized Hadamard transform
- Interpolation of inverse operators for preconditioning parameter-dependent equations
- Low-rank incremental methods for computing dominant singular subspaces
- Model reduction and approximation. Theory and algorithms
- Randomized linear algebra for model reduction. II: Minimal residual methods and dictionary-based approximation
- Randomized local model order reduction
- Randomized model order reduction
- Reduced basis approximation and a posteriori error estimation for affinely parametrized elliptic coercive partial differential equations. Application to transport and continuum mechanics.
- Reduced-Order Models for Electromagnetic Scattering Problems
- Sketching as a tool for numerical linear algebra
- Solving elliptic finite element systems in near-linear time with support preconditioners
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- Sweeping preconditioner for the Helmholtz equation: hierarchical matrix representation
- Towards an adaptive POD/SVD surrogate model for aeronautic design
- Turbulence and the dynamics of coherent structures. I. Coherent structures
- User-friendly tail bounds for sums of random matrices
- Why Finite Element Discretizations Can Be Factored by Triangular Hierarchical Matrices
Cited in
(38)- Transient response analysis of randomly parametrized finite element systems based on approximate balanced reduction
- Randomized model order reduction
- Randomized linear algebra for model reduction. II: Minimal residual methods and dictionary-based approximation
- Data-driven reduced order modeling of poroelasticity of heterogeneous media based on a discontinuous Galerkin approximation
- A ROM-accelerated parallel-in-time preconditioner for solving all-at-once systems in unsteady convection-diffusion PDEs
- Spectral estimation from simulations via sketching
- A sketched finite element method for elliptic models
- A compute-bound formulation of Galerkin model reduction for linear time-invariant dynamical systems
- A randomized balanced proper orthogonal decomposition technique
- Model reduction with MapReduce-enabled tall and skinny singular value decomposition
- Galerkin reduced-order modeling scheme for time-dependent randomly parametrized linear partial differential equations
- Randomized local model order reduction
- Randomized subspace iteration: analysis of canonical angles and unitarily invariant norms
- Randomized Residual-Based Error Estimators for Parametrized Equations
- Randomized Gram-Schmidt process with application to GMRES
- Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions
- A probabilistic reduced basis method for parameter-dependent problems
- Dictionary-based model reduction for state estimation
- Fixed-precision randomized low-rank approximation methods for nonlinear model order reduction of large systems
- Randomized residual-based error estimators for the proper generalized decomposition approximation of parametrized problems
- Randomized low-rank approximation methods for projection-based model order reduction of large nonlinear dynamical problems
- Fast and accurate randomized algorithms for linear systems and eigenvalue problems
- Polynomial preconditioning for the action of the matrix square root and inverse square root
- A sketch-and-select Arnoldi process
- Randomized greedy magic point selection schemes for nonlinear model reduction
- Influence of sampling on the convergence rates of greedy algorithms for parameter-dependent random variables
- Krylov subspace recycling with randomized sketching for matrix functions
- Randomized flexible GMRES with deflated restarting
- \(S^{\top}S\)-SVD via sketching and the nearest \(S^{\top}S\)-orthogonal matrix
- Error analysis of randomized symplectic model order reduction for Hamiltonian systems
- Randomized sketched TT-GMRES for linear systems with tensor structure
- CholeskyQR with randomization and pivoting for tall matrices (CQRRPT)
- Sketched and truncated polynomial Krylov subspace methods: matrix Sylvester equations
- GMRES with randomized sketching and deflated restarting
- Randomized block Gram-Schmidt process for the solution of linear systems and eigenvalue problems
- Randomized symplectic model order reduction for Hamiltonian systems
- Nonlinear manifold approximation using compositional polynomial networks
- Reduced order models for random functions. Application to stochastic problems
This page was built for publication: Randomized linear algebra for model reduction. I. Galerkin methods and error estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2305558)
