2008
DOI: 10.3166/ejc.14.342-354
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive Rational Interpolation: Arnoldi and Lanczos-like Equations

Abstract: The Arnoldi and Lanczos algorithms, which belong to the class of Krylov subspace methods, are increasingly used for model reduction of large scale systems.The standard versions of the algorithms tend to create reduced order models that poorly approximate low frequency dynamics. Rational Arnoldi and Lanczos algorithms produce reduced models that approximate dynamics at various frequencies. This paper tackles the issue of developing simple Arnoldi and Lanczos equations for the rational case. This allows a simple… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
18
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 23 publications
(18 citation statements)
references
References 32 publications
0
18
0
Order By: Relevance
“…Many existing model order reduction methods such as Padé approximation [11,28], balanced truncation [21], optimal Hankel norm [9,10] and Krylov subspace based methods In particular the Arnoldi algorithm [4,5,18,19] takes advantage of the sparsity of the large-scale model and has been extensively used for large problems; see [1,18,15]. When using block Krylov subspaces, one projects the system matrices of the original problem onto the subspace K m (A, B) = Range{B, AB, .…”
Section: (T) = a X(t) + B U(t) Y(t) = C X(t)mentioning
confidence: 99%
See 2 more Smart Citations
“…Many existing model order reduction methods such as Padé approximation [11,28], balanced truncation [21], optimal Hankel norm [9,10] and Krylov subspace based methods In particular the Arnoldi algorithm [4,5,18,19] takes advantage of the sparsity of the large-scale model and has been extensively used for large problems; see [1,18,15]. When using block Krylov subspaces, one projects the system matrices of the original problem onto the subspace K m (A, B) = Range{B, AB, .…”
Section: (T) = a X(t) + B U(t) Y(t) = C X(t)mentioning
confidence: 99%
“…The use of rational Krylov spaces is recognized as a powerful tool within model order reduction techniques for linear dynamical systems, however its success has been hindered by the lack of a parameter-free procedure, which would effectively generate the sequence of shifts used to build the space. Major efforts have been devoted to this question in the recent years; see for example [6,7,8,18,20,22]. In the context of H 2 -optimality reduction, an interesting attempt to provide an automatic selection has been recently proposed in [13].…”
Section: (T) = a X(t) + B U(t) Y(t) = C X(t)mentioning
confidence: 99%
See 1 more Smart Citation
“…Some of them are based on Krylov subspace methods (moment matching) while others use balanced truncation; see [3,17,21] and the references therein. In particular, the Lanczos process has been used for the single-input and single-output (SISO) (the case p = 1) and MIMO dynamical systems; see [12,13,23,24] and the references therein. The standard version of the Lanczos algorithm builds reduced order models that poorly approximate some frequency dynamics and to overcome this problem, rational Krylov subspace methods have been developed these last years [11,14,15,19,20,29,31].…”
Section: Introductionmentioning
confidence: 99%
“…Consider a class of descriptor linear dynamical electrical system in state space form given by [5], [6], [7], [8]:…”
Section: Introductionmentioning
confidence: 99%