2012
DOI: 10.1007/s11075-012-9569-7
|View full text |Cite
|
Sign up to set email alerts
|

Efficient handling of complex shift parameters in the low-rank Cholesky factor ADI method

Abstract: The solution of large-scale Lyapunov equations is a crucial problem for several fields of modern applied mathematics. The low-rank Cholesky factor version of the alternating directions implicit method (LRCF-ADI) is one iterative algorithm that computes approximate low-rank factors of the solution. In order to achieve fast convergence it requires adequate shift parameters, which can be complex if the matrices defining the Lyapunov equation are unsymmetric. This will require complex arithmetic computations as we… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
81
0
2

Year Published

2012
2012
2017
2017

Publication Types

Select...
8

Relationship

3
5

Authors

Journals

citations
Cited by 66 publications
(83 citation statements)
references
References 32 publications
0
81
0
2
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%
“…As in [13,27,2,28] the occurring large-scale generalized Lyapunov equations were solved approximately with the SO-LR-ADI iterations. A new result showing the low-rank structure of the Lyapunov residual in low-rank ADI methods was given.…”
Section: Discussionmentioning
confidence: 99%
“…However, in the latter case it is assumed that µ k , µ k+1 := µ k holds, and Z is augmented by 2m new real columns. This construction is possible due to a result in [28] which allows the computation of real low-rank factors even if complex shift parameters are used. The main result there is that the increment with respect to µ k+1 can be constructed by…”
Section: Handling the Second Order Structure And Complex Shift Paramementioning
confidence: 99%
“…In [11,Algorithm 4] it is shown how the LRCF-ADI method can be rewritten to achieve this goal. However, another approach given in [10] generates real low-rank factors as well, but appears to be more efficient in term of the computational complexity although temporarily still complex arithmetic operations are employed. In the remainder we assume we have generated real LRCFs using the latter approach.…”
Section: Algorithm 2 Generalized Low-rank Cholesky Factor Adi Iteratimentioning
confidence: 99%
“…In the presence of complex shift parameters, it is again possible to rewrite Algorithm 3 into a real form along the lines of [11,Algorithm 4] or to apply the strategy proposed in [10] in order to generate real LRCFs. b) Structure Preserving Balanced Truncation for Second Order Systems.…”
Section: Algorithm 2 Generalized Low-rank Cholesky Factor Adi Iteratimentioning
confidence: 99%