Krylov subspace methods for the generalized Sylvester equation (Q2369185)

From MaRDI portal
Revision as of 16:55, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    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
    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

    Identifiers