Locally adaptive greedy approximations for anisotropic parameter reduced basis spaces

From MaRDI portal
Publication:5404599

DOI10.1137/120873868zbMATH Open1285.65009arXiv1204.3846OpenAlexW1969080915WikidataQ60146773 ScholiaQ60146773MaRDI QIDQ5404599FDOQ5404599


Authors: Benjamin Stamm, Yvon Maday Edit this on Wikidata


Publication date: 28 March 2014

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Abstract: Reduced order models, in particular the reduced basis method, rely on empirically built and problem dependent basis functions that are constructed during an off-line stage. In the on-line stage, the precomputed problem-dependent solution space, that is spanned by the basis functions, can then be used in order to reduce the size of the computational problem. For complex problems, the number of basis functions required to guarantee a certain error tolerance can become too large in order to benefit computationally from the model reduction. To overcome this, the present work introduces a framework where local approximation spaces (in parameter space) are used to define the reduced order approximation in order to have explicit control over the on-line cost. This approach also adapts the local approximation spaces to local anisotropic behavior in the parameter space. We present the algorithm and numerous numerical tests.


Full work available at URL: https://arxiv.org/abs/1204.3846




Recommendations





Cited In (35)

Uses Software





This page was built for publication: Locally adaptive greedy approximations for anisotropic parameter reduced basis spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404599)