2016 | OriginalPaper | Buchkapitel
Construction of RB Spaces by the Greedy Algorithm
verfasst von : Alfio Quarteroni, Andrea Manzoni, Federico Negri
Erschienen in: Reduced Basis Methods for Partial Differential Equations
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.