Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2008
DOI: 10.1051/m2an:2008001
|View full text |Cite
|
Sign up to set email alerts
|

Reduced basis method for finite volume approximations of parametrized linear evolution equations

Abstract: Abstract.The model order reduction methodology of reduced basis (RB) techniques offers efficient treatment of parametrized partial differential equations (P 2 DEs) by providing both approximate solution procedures and efficient error estimates. RB-methods have so far mainly been applied to finite element schemes for elliptic and parabolic problems. In the current study we extend the methodology to general linear evolution schemes such as finite volume schemes for parabolic and hyperbolic evolution equations. T… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

3
472
0
4

Year Published

2010
2010
2021
2021

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 355 publications
(479 citation statements)
references
References 34 publications
(47 reference statements)
3
472
0
4
Order By: Relevance
“…We can now define our error bounds in terms of these two ingredients as it can readily be proven [52,57] that for all µ ∈ P,…”
Section: A Posteriori Error Bounds For the Parabolic Casementioning
confidence: 99%
See 2 more Smart Citations
“…We can now define our error bounds in terms of these two ingredients as it can readily be proven [52,57] that for all µ ∈ P,…”
Section: A Posteriori Error Bounds For the Parabolic Casementioning
confidence: 99%
“…A purely greedy approach [52] may encounter difficulties best treated by including elements of the proper orthogonal decomposition selection process [57]. Hence, to capture the causality associated with the evolution, the sampling method combines the proper orthogonal decomposition, see Section 3.2.1, for the time-trajectories, with the greedy procedure in the parameter space [52,156,144] to enable the efficient treatment of the higher dimensions and extensive ranges of parameter variation.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…It was further developed in reduced basis models for elliptic PDEs in [218], the steady incompressible Navier-Stokes equations in [217], and parabolic PDEs in [111,112]. It has since been applied in conjunction with POD methods [61,122,230] and rational interpolation methods [79]. The key advantage of the greedy approach is that the search over the parameter space embodies the structure of the problem, so that the underlying system dynamics guide the selection of appropriate parameter samples.…”
Section: Adaptive Parameter Sampling Via Greedy Searchmentioning
confidence: 99%
“…The resulting reduced space X N aims to represent a suitable space of approximation for both values of α. In the parametrized case, by using greedy enrichment we aim at saving a part of the offline computational costs: indeed, in a standard POD-Greedy procedure (see [39]), each new evaluation of the parameter α requires the computation of the associated finite element solutions for each time instant n ∈ N T . In our application, this would require about 8 h on 256 processors.…”
Section: Application Of the Greedy Enriched Algorithm With Perturbed mentioning
confidence: 99%