2013 American Control Conference 2013
DOI: 10.1109/acc.2013.6580700
|View full text |Cite
|
Sign up to set email alerts
|

A greedy rational Krylov method for &#x210B;<inf>2</inf>-pseudooptimal model order reduction with preservation of stability

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
29
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 19 publications
(29 citation statements)
references
References 6 publications
0
29
0
Order By: Relevance
“…The SPARK algorithm in [151] is an iterative scheme to adaptively chose the expansion points in Krylov subspace methods, and in particular the order of the reduced model. It implicitly guarantees preservation of stability and contains an optimization algorithm that converges to an H 2 optimum.…”
Section: Recent Progresses On the Above Issuesmentioning
confidence: 99%
“…The SPARK algorithm in [151] is an iterative scheme to adaptively chose the expansion points in Krylov subspace methods, and in particular the order of the reduced model. It implicitly guarantees preservation of stability and contains an optimization algorithm that converges to an H 2 optimum.…”
Section: Recent Progresses On the Above Issuesmentioning
confidence: 99%
“…In [7,22] Gugercin et al proposed an Iterative Rational Krylov Algorithm (IRKA) to compute a reduced order model satisfying the firstorder conditions for the H 2 approximation. Other adaptive methods (for the SISO case) are introduced in [9,19,20,25,27,30] and the references therein.…”
Section: Introductionmentioning
confidence: 99%
“…AN ADAPTIVE FRAMEWORK In this contribution, we present the current developments on the adaptive selection of a) the reduced order n and b) the position of the shifts s 0 , both introduced by Panzer et al (2013a). The cornerstone of the discussion is given by an unconventional representation of the error system G e (s).…”
mentioning
confidence: 99%
“…Assuming asymptotic stability of the HFM, the choice of shifts can be parametrized by two positive real numbers and a greedy, trust-region based algorithm for the detection of locally H 2 -optimal shifts can be implemented, bypassing the convergence issues related to IRKA. This algorithm was first introduced by Panzer et al (2013a) under the name of Stability Preserving Adaptive Rational Krylov (SPARK). It can be shown that in H 2 -pseudo-optimal reduction, the minimization of the H 2 -norm of the error system (3) corresponds to the maximization of the H 2 -norm of the ROM, yielding a cheap cost functional for SPARK.…”
mentioning
confidence: 99%