A prioriconvergence of the Greedy algorithm for the parametrized reduced basis method

DOI10.1051/m2an/2011056zbMath1272.65084WikidataQ58841804 ScholiaQ58841804MaRDI QIDQ2842478

Christophe Prud'homme, Yvon Maday, Gabriel Turinici, Annalisa Buffa, Anthony T. Patera

Publication date: 14 August 2013

Published in: ESAIM: Mathematical Modelling and Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/m2an/2011056

zbMATH Keywords

convergence; Galerkin method; greedy algorithm; a priori error bounds; reduced basis approximations; best fit analysis

Mathematics Subject Classification ID

65N15: Error bounds for boundary value problems involving PDEs

65N12: Stability and convergence of numerical methods for boundary value problems involving PDEs

65N30: Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs

35G20: Nonlinear higher-order PDEs

Uses Software

• Feel++