A priori convergence of the Greedy algorithm for the parametrized reduced basis method

  • Buffa A
  • Maday Y
  • Patera A
 et al. 
  • 36


    Mendeley users who have this article in their library.
  • 90


    Citations of this article.


The convergence and efficiency of the reduced basis method used for the approximation of the solutions to a class of problems written as a parametrized PDE depends heavily on the choice of the elements that constitute the "reduced basis". The purpose of this paper is to analyze the a priori convergence for one of the approaches used for the selection of these elements, the greedy algorithm. Under natural hypothesis on the set of all solutions to the problem obtained when the parameter varies, we prove that three greedy algorithms converge; the last algorithm, based on the use of an a posteriori estimator, is the approach actually employed in the calculations.

Author-supplied keywords

  • a priori analysis
  • and phrases
  • best fit analysis
  • greedy algorithm
  • reduced basis approximations

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Annalisa Buffa

  • Yvon Maday

  • Anthony T. Patera

  • Christophe Prud’homme

  • Gabriel Turinici

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free