Randomized linear algebra for model reduction. I. Galerkin methods and error estimation
From MaRDI portal
Publication:2305558
DOI10.1007/S10444-019-09725-6zbMATH Open1464.65169arXiv1803.02602OpenAlexW3104590783WikidataQ126646079 ScholiaQ126646079MaRDI QIDQ2305558FDOQ2305558
Authors: Oleg Balabanov, A. Nouy 
Publication date: 11 March 2020
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1803.02602
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
Random matrices (algebraic aspects) (15B52) Numerical linear algebra (65F99) Error bounds for boundary value problems involving PDEs (65N15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Cites Work
- Hierarchical Approximate Proper Orthogonal Decomposition
- Improved matrix algorithms via the subsampled randomized Hadamard transform
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Fast dimension reduction using Rademacher series on dual BCH codes
- An introduction to matrix concentration inequalities
- User-friendly tail bounds for sums of random matrices
- A general multipurpose interpolation procedure: The magic points
- Approximation of zonoids by zonotopes
- Turbulence and the dynamics of coherent structures. I. Coherent structures
- Low-rank incremental methods for computing dominant singular subspaces
- Towards an adaptive POD/SVD surrogate model for aeronautic design
- A survey of projection-based model reduction methods for parametric dynamical systems
- Hierarchical matrices: algorithms and analysis
- Reduced basis approximation and a posteriori error estimation for affinely parametrized elliptic coercive partial differential equations. Application to transport and continuum mechanics.
- Improved analysis of the subsampled randomized Hadamard transform
- Finite elements and fast iterative solvers. With applications in incompressible fluid dynamics
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- 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
- A fast direct solver for a class of elliptic partial differential equations
- A high-performance parallel implementation of the certified reduced basis method
- Why Finite Element Discretizations Can Be Factored by Triangular Hierarchical Matrices
- Sketching as a tool for numerical linear algebra
- Model reduction and approximation. Theory and algorithms
- Accurate and online-efficient evaluation of the a posteriori error bound in the reduced basis method
- Reduced-Order Models for Electromagnetic Scattering Problems
- Randomized model order reduction
- Randomized local model order reduction
- Interpolation of inverse operators for preconditioning parameter-dependent equations
- Randomized linear algebra for model reduction. II: Minimal residual methods and dictionary-based approximation
Cited In (28)
- 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
- Randomized Sketching for Krylov Approximations of Large-Scale Matrix Functions
- A compute-bound formulation of Galerkin model reduction for linear time-invariant dynamical systems
- Randomized subspace iteration: analysis of canonical angles and unitarily invariant norms
- A sketch-and-select Arnoldi process
- Model reduction with MapReduce-enabled tall and skinny singular value decomposition
- Spectral estimation from simulations via sketching
- Randomized greedy magic point selection schemes for nonlinear model reduction
- Randomized linear algebra for model reduction. II: Minimal residual methods and dictionary-based approximation
- Randomized Residual-Based Error Estimators for Parametrized Equations
- Randomized Gram-Schmidt process with application to GMRES
- Transient response analysis of randomly parametrized finite element systems based on approximate balanced reduction
- 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
- Influence of sampling on the convergence rates of greedy algorithms for parameter-dependent random variables
- A sketched finite element method for elliptic models
- Dictionary-based model reduction for state estimation
- Randomized local model order reduction
- Krylov subspace recycling with randomized sketching for matrix functions
- Randomized flexible GMRES with deflated restarting
- Randomized model order reduction
- Reduced order models for random functions. Application to stochastic problems
- Galerkin reduced-order modeling scheme for time-dependent randomly parametrized linear partial differential equations
- A probabilistic reduced basis method for parameter-dependent problems
Uses Software
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)
