Abstract
We describe another, indeed very popular, approach to construct a reduced basis space in the context of parametrized PDEs: the so-called greedy algorithm. This consists in an iterative sampling from the parameter space fulfilling at each step a suitable optimality criterion that relies on the a posteriori error estimate. We illustrate the main features of this procedure in the algebraic RB framework, and then address its continuous counterpart, discuss some a priori convergence results and verify them using numerical tests.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Quarteroni, A., Manzoni, A., Negri, F. (2016). Construction of RB Spaces by the Greedy Algorithm. In: Reduced Basis Methods for Partial Differential Equations. UNITEXT(), vol 92. Springer, Cham. https://doi.org/10.1007/978-3-319-15431-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-15431-2_7
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15430-5
Online ISBN: 978-3-319-15431-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)