A Krylov--Schur algorithm for large eigenproblems

From MaRDI portal





This paper removes two drawbacks of \textit{D. C. Sorensen's} implicitly restarted Arnoldi algorithm [ibid. 13, No. 1, 357-385 (1992; Zbl 0763.65025)] for finding a few eigenpairs of a large matrix (implemented in the ARPACK package of 1998). The drawbacks are (1) the restriction of possible transformations on the decompositions caused by the need to preserve the structure of the Arnoldi decomposition, and (2) the potential forward instability of the implicit QR-algorithm causing unwanted Ritz vectors to persist in the computation. For that purpose the paper introduces a general Krylov decomposition and solves the purging and deflating problems by relaxing the definition of an Arnoldi decomposition.




Cited in
(only showing first 100 items - show all)


Describes a project that uses

Uses Software






This page was built for publication: A Krylov--Schur algorithm for large eigenproblems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784368)