Abstract
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 k-step restarting scheme in which one eigenpair at a time is computed using a deflation technique in which each Lanczos vector generated is orthogonalized 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.
This work was supported by the Engineering and Physical Sciences Research Council under grants GR/J41857 and GR/J41864 and was carried out using the facilities of the University of Edinburgh Parallel Computing Centre
Chapter PDF
References
Duff, I.S., Grimes, R.G., and Lewis, J.G., (1992), ‘User's Guide for the Harwell-Boeing Sparse Matrix Collection’ (release I), available online ftp orion.cerfacs.fr.
Golub, G., and Van Loan, C.F., (1989), ‘Matrix Computations', John Hopkins University Press, London.
O.A. Marques (1995), ‘BLZPACK: Description and User's Guide', CERFACS Report TR/PA/95/30, Toulouse, France, October 1995.
Lehoucq, R., Sorensen, D.C., and Vu, P.A., (1994), 'sSAUPD: Fortran subroutines for solving large scale eigenvalue problems', Release 2.1, available from netlib@ornl.gov in the scalapack directory.
Parlett, B.N., and Scott, D.S., (1979), ‘The Lanczos algorithm with selective orthogonalization', Math. Comput., 33, 217–238.
Simon, H.D., (1984), ‘Analysis of the Symmetric Lanczos Algorithm with Reorthogonalization Methods', Linear Algebra Appl., 61, 101–131.
Sorensen, D.C., (1992), ‘Implicit Application of Polynomial Filters in a k-step Arnoldi Method', SIAM J. Matrix Anal. Appl., 13, 357–385.
Szularz, M., Weston, J., Clint, M., and Murphy, K., (1996), ‘A Highly Parallel Explicitly Restarted Lanczos Algorithm', in Applied Parallel Computing Industrial Computation and Optimization, J. Wasniewski, J. Dongarra, K. Madsen and D. Olesen (Eds.), LNCS 1184, Springer-Verlag, 651–660.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szularz, M., Weston, J., Clint, M. (1997). Robust parallel Lanczos methods for clustered eigenvalues. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds) Euro-Par'97 Parallel Processing. Euro-Par 1997. Lecture Notes in Computer Science, vol 1300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0002803
Download citation
DOI: https://doi.org/10.1007/BFb0002803
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63440-9
Online ISBN: 978-3-540-69549-3
eBook Packages: Springer Book Archive