A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line (Q413531)

From MaRDI portal
Revision as of 16:49, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
In more languages
Configure
Language Label Description Also known as
English
A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line
scientific article

    Statements

    A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line (English)
    The authors analyze a method for computing eigenvalues of a large sparse generalized eigenvalue problem \(Ax=\lambda Bx\), closest to the imaginary axis. Their method is based on inverse subspace iteration on the Lyapunov problem. They also show the link between inverse subspace iteration and implicitly restarted Arnoldi process through the extra projection step which corresponds to the decrease of the Krylov subspace dimension by executing \(QR\)-steps.
    Lyapunov eigenvalue problem
    Kronecker eigenvalue problem
    eigenvalues closest to the imaginary axis
    implicitly restarted Arnoldi method
    large sparse generalized eigenvalue problem
    inverse subspace iteration
    Krylov subspace

    Identifiers