2015
DOI: 10.1137/140998603
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Output Error Estimation for Model Order Reduction of Parametrized Evolution Equations

Abstract: In this work we present an a posteriori output error bound for model order reduction of parametrized evolution equations. With the help of the dual system and a simple representation of the relationship between the field variable error and the residual of the primal system, a sharp output error bound is derived. Such an error bound successfully avoids the accumulation of the residual over time, which is a common drawback in the existing error estimations for time-stepping schemes. An estimation needs to be per… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

2
47
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
7

Relationship

6
1

Authors

Journals

citations
Cited by 34 publications
(49 citation statements)
references
References 37 publications
(89 reference statements)
2
47
0
Order By: Relevance
“…In every iteration, the s sample corresponding to the maximal error estimator is chosen as the next expansion point s i (Step 22). Steps 5,8,12,16 and Step 20 orthogonalize the vectors in V (s i ) and V du (s i ), V r du (s α i ), V rpr (s α i ), V rrpr (s β i ) against the existing vectors in V and V du , V r du , V rpr , V rrpr , respectively. In Algorithm 1, some steps are only implemented for certain error estimators, depending on which error estimator is being used.…”
Section: Greedy Algorithms For Constructing the Projection Matricesmentioning
confidence: 99%
See 2 more Smart Citations
“…In every iteration, the s sample corresponding to the maximal error estimator is chosen as the next expansion point s i (Step 22). Steps 5,8,12,16 and Step 20 orthogonalize the vectors in V (s i ) and V du (s i ), V r du (s α i ), V rpr (s α i ), V rrpr (s β i ) against the existing vectors in V and V du , V r du , V rpr , V rrpr , respectively. In Algorithm 1, some steps are only implemented for certain error estimators, depending on which error estimator is being used.…”
Section: Greedy Algorithms For Constructing the Projection Matricesmentioning
confidence: 99%
“…, (Ã(s α i )) q−1B (s α i )}. 16: = ∆(s i ). 39: end while Algorithm 2 Greedy ROM construction for parametric systems (1) .…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…While the error estimators from [11,36,54] are developed for nonlinear time-dependent problems, they may become inaccurate for systems with switching procedure. In our recent work [55], an efficient output error estimation is derived, and it has been successfully applied to a nonlinear batch chromatographic model and a linear SMB model. In this work, we will use the error estimation proposed in [55] to construct the ROM for the nonlinear SMB chromatography.…”
Section: Computing the Error Indicator ψ(µ)mentioning
confidence: 99%
“…It remains still an active topic in MOR. In Section 4, we will introduce a recently proposed error estimation from [55], which will be used as the error indicator in the POD-Greedy algorithm to construct the RB V for the SMB model.…”
mentioning
confidence: 99%