ADI preconditioned Krylov methods for large Lyapunov matrix equations (Q962079): Difference between revisions
From MaRDI portal
Latest revision as of 15:20, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | ADI preconditioned Krylov methods for large Lyapunov matrix equations |
scientific article |
Statements
ADI preconditioned Krylov methods for large Lyapunov matrix equations (English)
0 references
6 April 2010
0 references
The author presents new preconditioned Krylov methods for solving large Lyapunov matrix equations \(AX+XA^T+BB^T=0\), based on Arnoldi's global alternating direction implicit iteration method LR-ADI(\(l\)). The original equation is transformed into a new symmetric Stein matrix equation with the same solution. Low rank approximate solutions are extracted by the global Arnoldi method. An upper bound for the norm of the error is presented. The numerical tests show the effectiveness of the method as compared with known methods. As the number \(l\) increases in LR-ADI(\(l\)), convergence is generally faster in terms of the number of iterations but requires higher CPU-time. It seems that the best results are obtained with \(l=1\) or \(l=2\).
0 references
ADI
0 references
global Arnoldi method
0 references
matrix Krylov subspace method
0 references
low-rank approximations
0 references
Lyapunov matrix equation
0 references
Stein matrix equation
0 references
preconditioning
0 references
numerical examples
0 references
alternating direction implicit iteration method
0 references
convergence
0 references
0 references
0 references
0 references