Iterative methods for the delay Lyapunov equation with T-Sylvester preconditioning (Q1615853)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6969470
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iterative methods for the delay Lyapunov equation with T-Sylvester preconditioning |
scientific article; zbMATH DE number 6969470 |
Statements
Iterative methods for the delay Lyapunov equation with T-Sylvester preconditioning (English)
0 references
31 October 2018
0 references
The authors deal with the delay Lyapunov equation which they propose to solve by a new iterative method. Exploiting the fact that the delay Lyapunov equation can be expressed as a linear system of equations, a preconditioned iterative method is presented. A preconditioner is proposed based on solving a T-Sylvester equation, which enjoys methods available in the literature. The presented preconditioner is proved to be effective under certain assumptions. Therefore, also in this presented approach, the effectiveness of the preconditioner is problem-dependent, as usual. A small example and a large-scale example are numerically studied and discussed. Remarkably, whereas the largest delay Lyapunov equation previously solved in the literature was with \(n=110\), here approximate solutions for problems of size up to \(n \approx 1000\) are presented.
0 references
matrix equations
0 references
iterative methods
0 references
Sylvester equations
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7709260582923889
0 references
0.7709260582923889
0 references
0.7583953738212585
0 references
0.7571985125541687
0 references
0.7519482374191284
0 references