Krylov subspace methods for the generalized Sylvester equation (Q2369185): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.amc.2005.07.041 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AMC.2005.07.041 / rank | |||
Normal rank | |||
Latest revision as of 05:55, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Krylov subspace methods for the generalized Sylvester equation |
scientific article |
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
