A low-rank Krylov squared Smith method for large-scale discrete-time Lyapunov equations (Q413528): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.laa.2011.07.021 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2039512556 / rank | |||
Normal rank | |||
Revision as of 22:00, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A low-rank Krylov squared Smith method for large-scale discrete-time Lyapunov equations |
scientific article |
Statements
A low-rank Krylov squared Smith method for large-scale discrete-time Lyapunov equations (English)
0 references
7 May 2012
0 references
The paper deals with the large-scale discrete-time Lyapunov matrix equation \(X-AXA^T=BB^T\) with low-rank symmetric right-hand side. The author uses the squared Smith method and the block Arnoldi algorithm for the low-rank approximation of the solution matrix. A restarting mechanism is employed to cope with the increase of memory storage of the Krylov basis. The numerical behavior of the proposed method is illustrated on several experiments.
0 references
squared Smith method
0 references
low-rank approximation
0 references
block-Arnoldi method
0 references
full orthogonalization method
0 references
numerical examples
0 references
alternating direction implicit (ADI) iteration
0 references
large-scale discrete-time Lyapunov matrix equation
0 references
algorithm
0 references
