In this paper two recently proposed single-vector Lanczos methods based on a simple restarting strategy are analysed and their suitability for the computation of closely clustered eigenvalues is evaluated. Both algorithms adopt an approach which yields a fixed fc-step restarting scheme in which one eigenpair at a time is computed using a deflation technique in which each Lanczos vector generated is orthogonal-ized against all previously converged eigenvectors. In the first algorithm each newly generated Lanczos vector is also orthogonalised with respect to all of its predecessors; in the second, a selective orthogonalisation strategy permits re-orthogonalization between the Lanczos vectors to be almost completely eliminated. 'Reverse communication' implementations of the algorithms on an MPP Connection Machine CM-200 with 8K processors are discussed. Advantages of the algorithms include the ease with which they cope with genuinely multiple eigenvalues, their guaranteed convergence and their fixed storage requirements.
CITATION STYLE
Szularz, M., Weston, J., & Clint, M. (1997). Robust parallel lanczos methods for clustered eigenvalues. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1300 LNCS, pp. 710–717). Springer Verlag. https://doi.org/10.1007/bfb0002803
Mendeley helps you to discover research relevant for your work.