2016
DOI: 10.1007/978-3-319-22470-1
|View full text |Cite
|
Sign up to set email alerts
|

Certified Reduced Basis Methods for Parametrized Partial Differential Equations

Abstract: The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-22470-1International audienceThis book provides a thorough introduction to the mathematical and algorithmic aspects of certified reduced basis methods for parametrized partial differential equations. Central aspects ranging from model construction, error estimation and computational efficiency to empirical interpolation methods are discussed in detail for coercive problems. More advanced aspects associated with time-dependen… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
1,221
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 805 publications
(1,235 citation statements)
references
References 94 publications
2
1,221
0
Order By: Relevance
“…Because of its flexibility and the fact that it does not require the evaluation of error bounds or indicators for the selection of basis functions, we rely on this latter, see e.g. [10,11,15] for a further understanding of (weak) greedy algorithms and POD. We start by computing n s high-fidelity solutions {u h (µ i )} ns i=1 (called snapshots) corresponding to the parameter values {µ i } ns i=1 .…”
Section: The Reduced Basis Methods For Parametrized Pdesmentioning
confidence: 99%
See 2 more Smart Citations
“…Because of its flexibility and the fact that it does not require the evaluation of error bounds or indicators for the selection of basis functions, we rely on this latter, see e.g. [10,11,15] for a further understanding of (weak) greedy algorithms and POD. We start by computing n s high-fidelity solutions {u h (µ i )} ns i=1 (called snapshots) corresponding to the parameter values {µ i } ns i=1 .…”
Section: The Reduced Basis Methods For Parametrized Pdesmentioning
confidence: 99%
“…that is by a multiplicative combination of P −1 h (µ) and Q N k (µ), where P −1 h (µ) ∈ R N h ×N h is a nonsingular fine grid preconditioner and Q N k (µ) is an iteration-dependent coarse component which is a tailored for the error equation (11). When using a multiplicative combination of two preconditioners, the Richardson iterations can be rewritten by means of two half-steps, that is, if…”
Section: Msrb Preconditioners For the Richardson Methodmentioning
confidence: 99%
See 1 more Smart Citation
“…For more details on the reduced basis theory we address the interested reader to e.g., Rozza et al [5], Hesthaven et al [27], and Quarteroni et al [28]. We already introduced U n+1 h that, at each time instant is the a high-fidelity approximation of the exact solution and is computed as a finite element solution with a sufficiently fine mesh.…”
Section: Numerical Reductionmentioning
confidence: 99%
“…For references to standard greedy algorithms applied to parametrized PDEs see e.g., Hesthaven et al [27] and Quarteroni et al [28].…”
Section: Greedy Enrichmentmentioning
confidence: 99%