Randomized linear algebra for model reduction. Part I: Galerkin methods and error estimation
Authors:
- 3 December 2019
- journal article
- research article
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 45 (5-6) , 2969-3019
Abstract
No abstract availableKeywords
All Related Versions
This publication has 33 references indexed in Scilit:
- Limited‐memory adaptive snapshot selection for proper orthogonal decompositionInternational Journal for Numerical Methods in Engineering, 2016
- Hierarchical Matrices: Algorithms and Analysis2015
- User-Friendly Tail Bounds for Sums of Random MatricesFoundations of Computational Mathematics, 2011
- A high-performance parallel implementation of the certified reduced basis methodComputer Methods in Applied Mechanics and Engineering, 2011
- Sweeping preconditioner for the Helmholtz equation: Hierarchical matrix representationCommunications on Pure and Applied Mathematics, 2011
- Towards an adaptive POD/SVD surrogate model for aeronautic designComputers & Fluids, 2011
- Fast Dimension Reduction Using Rademacher Series on Dual BCH CodesDiscrete & Computational Geometry, 2008
- A Fast Direct Solver for a Class of Elliptic Partial Differential EquationsJournal of Scientific Computing, 2008
- Reduced Basis Approximation and a Posteriori Error Estimation for Affinely Parametrized Elliptic Coercive Partial Differential EquationsArchives of Computational Methods in Engineering, 2008
- Approximation of zonoids by zonotopesActa Mathematica, 1989