Krylov subspace methods for the generalized Sylvester equation (Q2369185)
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 5020562
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Krylov subspace methods for the generalized Sylvester equation |
scientific article; zbMATH DE number 5020562 |
Statements
Krylov subspace methods for the generalized Sylvester equation (English)
0 references
28 April 2006
0 references
Krylov type iterative algorithms are considered for the numerical solution of the real matrix Sylvester equation (1) \(AXB-X=C\). Convergence estimates are derived and results from numerical experiments are presented. The approach is based on an equivalent vector form of (1). Therefore a comparison with the direct Schur-Hessenberg method for solving (1) would have been be useful.
0 references
Galerkin method
0 references
Generalized Sylvester equation
0 references
Minimal residual method
0 references
Krylov subspace method
0 references
convergence
0 references
numerical experiments
0 references
0.98152244
0 references
0.9490915
0 references
0.9317758
0 references
0.92646956
0 references
0.92239887
0 references
0.9145071
0 references
0.9135702
0 references
