2017
DOI: 10.1007/978-3-319-58786-8_17
|View full text |Cite
|
Sign up to set email alerts
|

Cross-Gramian-Based Model Reduction: A Comparison

Abstract: As an alternative to the popular balanced truncation method, the cross Gramian matrix induces a class of balancing model reduction techniques. Besides the classical computation of the cross Gramian by a Sylvester matrix equation, an empirical crossGramian can be computed based on simulated trajectories. This work assesses the cross Gramian and its empirical Gramian variant for state-space reduction on a procedural benchmark based to the cross Gramian itself.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
3
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 24 publications
1
3
0
Order By: Relevance
“…Expanding the matrix description (31) into four submatrix equations, we arrive at Eqns. (27) to (30). This completes the proof.…”
Section: Lemmasupporting
confidence: 63%
See 2 more Smart Citations
“…Expanding the matrix description (31) into four submatrix equations, we arrive at Eqns. (27) to (30). This completes the proof.…”
Section: Lemmasupporting
confidence: 63%
“…Various methods can be used to obtain projection matrices from the cross Gramian [4,5,9,27,57]. The first approach can be performed on the basis of singular value decomposition (SVD) of the cross Gramian…”
Section: Cross Gramian-based Model Order Reductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The first example is a linear test system of the form (2) and generated using the inverse Lyapunov procedure [85], in a variant that enforces state-space symmetric systems [43]. For state-space symmetric systems, A = A , B = C , all system Gramians are symmetric and equal [58].…”
Section: Linear Verificationmentioning
confidence: 99%