%0 Report
%D 2000
%T An Arnoldi--Schur Algorithm for Large Eigenproblems
%A Stewart, G.W.
%K Technical Report
%X Sorensen's iteratively restarted Arnoldi algorithm is one of the mostsuccessful and flexible methods for finding a few eigenpairs of a large matrix. However, the need to preserve structure of the Arnoldi decomposition, on which the algorithm is based, restricts the range of transformations that can be performed on it. In consequence, it is difficult to deflate converged Ritz vectors from the decomposition. Moreover, the potential forward instability of the implicit QR algorithm can cause unwanted Ritz vectors to persist in the computation. In this paper we introduce a generalized Arnoldi decomposition that solves both problems in a natural and efficient manner. (Also cross-referenced as UMIACS-TR-2000-21)
%I Instititue for Advanced Computer Studies, Univ of Maryland, College Park
%V UMIACS-TR-2000-21
%8 2000/04/25/
%G eng
%U http://drum.lib.umd.edu/handle/1903/1066