2012
DOI: 10.1051/m2an/2011056
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: Abstract.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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

5
276
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
6
2
2

Relationship

1
9

Authors

Journals

citations
Cited by 279 publications
(281 citation statements)
references
References 8 publications
5
276
0
Order By: Relevance
“…We apply the Weak Greedy algorithm described in Algorithm 1 to form Z N (see also a detailed review -in particular as regard the construction of an error bound that is efficient in the many-query setting -by Rozza et al [25]). The algorithm has been proven to generate an optimal sequence of spaces with respect to the Kolmogorov width of M bk in Binev et al [3], Buffa et al [4], and DeVore et al [7].…”
Section: A Posteriori Error Estimatesmentioning
confidence: 99%
“…We apply the Weak Greedy algorithm described in Algorithm 1 to form Z N (see also a detailed review -in particular as regard the construction of an error bound that is efficient in the many-query setting -by Rozza et al [25]). The algorithm has been proven to generate an optimal sequence of spaces with respect to the Kolmogorov width of M bk in Binev et al [3], Buffa et al [4], and DeVore et al [7].…”
Section: A Posteriori Error Estimatesmentioning
confidence: 99%
“…See also [15] for the first but less sharp estimates. In other words, if the underlying problem allows an efficient and compact reduced basis, the greedy approximation will find an exponentially convergent approximation to it.…”
mentioning
confidence: 99%
“…Assuming such a decay, it is not obvious that the particular N − dimensional subspace of W (Y ) constructed with the greedy algorithm enjoys such an approximation property. This has been proved in [35,36]. More precisely the application of [36,Corollary 3] shows the following result.…”
Section: A Priori Error Analysismentioning
confidence: 77%