2011
DOI: 10.1137/100813257
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of the Rational Krylov Subspace and ADI Methods for Solving the Lyapunov Equation

Abstract: For large scale problems, an effective approach for solving the algebraic Lyapunov equation consists of projecting the problem onto a significantly smaller space and then solving the reduced order matrix equation. Although Krylov subspaces have been used for long time, only more recent developments have shown that rational Krylov subspaces can be a competitive alternative to the classical and very popular Alternating Direction Implicit (ADI) recurrence. In this paper we develop a convergence analysis of the Ra… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
132
0
1

Year Published

2013
2013
2022
2022

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 98 publications
(135 citation statements)
references
References 40 publications
2
132
0
1
Order By: Relevance
“…For effective methods to solve large-scale Lyapunov equations, see, e.g., [46,47,152,219] for ADI-type methods, [117,191,199,206] for the Smith method and its variants, [78,135,203,210] for Krylov-based methods, or the recent survey [48] and the references therein.…”
Section: Balanced Truncationmentioning
confidence: 99%
“…For effective methods to solve large-scale Lyapunov equations, see, e.g., [46,47,152,219] for ADI-type methods, [117,191,199,206] for the Smith method and its variants, [78,135,203,210] for Krylov-based methods, or the recent survey [48] and the references therein.…”
Section: Balanced Truncationmentioning
confidence: 99%
“…. , k. These factors can efficiently be computed by the lowrank alternating directions implicit (LR-ADI) method [5,19,24], the rational Krylov method [9,26] or the Riemannian method [30]. Then for a reduced basis matrix V k = [ Z 1 , .…”
Section: Offline Phasementioning
confidence: 99%
“…To avoid expensive computations in the direct methods, iterative ones such as the sign function method [6], the alternating directions implicit method [20,33], and Krylov subspace methods [16,25] have been developed. Exploiting the fact that the right-hand sides of Lyapunov equations in most applications have low rank, low-rank versions of the mentioned iterative methods have been formulated, [9,19,24,26], just to name a few, see also [5,27] for the recent surveys on the state-of-the-art algorithms.…”
Section: Introduction In This Paper We Consider the Following Parammentioning
confidence: 99%
“…The convergence of the Galerkin method on tensor products of (rational) Krylov subspaces for Lyapunov and Sylvester equations has been analysed in [2,10,21,20,27,28]. For the extensions considered in this paper the framework developed in [2] appears to be most suitable.…”
Section: Introductionmentioning
confidence: 99%