Krylov subspace methods for the generalized Sylvester equation (Q2369185)

From MaRDI portal
Revision as of 18:06, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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