2015
DOI: 10.1016/j.jcp.2015.09.046
|View full text |Cite
|
Sign up to set email alerts
|

Efficient model reduction of parametrized systems by matrix discrete empirical interpolation

Abstract: In this work, we apply a Matrix version of the so-called Discrete Empirical Interpolation (MDEIM) for the efficient reduction of nonaffine parametrized systems arising from the discretization of linear partial differential equations. Dealing with affinely parametrized operators is crucial in order to enhance the online solution of reduced-order models (ROMs). However, in many cases such an affine decomposition is not readily available, and must be recovered through (often) intrusive procedures, such as the emp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
110
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
9

Relationship

2
7

Authors

Journals

citations
Cited by 129 publications
(110 citation statements)
references
References 57 publications
0
110
0
Order By: Relevance
“…Since the focus of this section is geometry reduction, we do not discuss the construction of the ROM for the mapped problems (36) and (38).…”
Section: Numerical Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Since the focus of this section is geometry reduction, we do not discuss the construction of the ROM for the mapped problems (36) and (38).…”
Section: Numerical Resultsmentioning
confidence: 99%
“…We present below the non-interpolatory extension of EIM employed in this paper; the same approach has also been employed in [53]. We refer to [55,36] for two alternatives applicable to vector-valued fields. Given the space W Q = span{ω q } Q q=1 ⊂ W and the points {x i q } Q q=1 ⊂ Ω, we define the least-squares approximation operator I Q : W → W Q such that for all v ∈ W…”
Section: D2 Extension To Vector-valued Fieldsmentioning
confidence: 99%
“…Furthermore, alternative approximations of the system tangent, e.g. [5,29,38], could be investigated. Yet some of these methods require additional high dimensional snapshots of the sparse system tangent which becomes computational infeasible rapidly.…”
Section: Resultsmentioning
confidence: 99%
“…In the online stage, the interested output is computed by solving the resultant ROM for many instances of parameters, and the influence of the uncertainty is estimated. Thus, the projection‐based ROM reduces the computational cost associated with the solution of parameter‐dependent full‐order model (FOM) by restricting the solution space to a subspace of much smaller dimension (Negri et al, ).…”
Section: Introductionmentioning
confidence: 99%