Implementing the parallel quasi-Laguerre's algorithm for symmetric tridiagonal eigenproblems
In this article, a fully scalable parallel algorithm is presented for solving symmetric tridiagonal eigenvalue problems using quasi-Laguerre's method. The algorithm is implemented using PVM and tested on a variety of matrices with a load balancing scheme. Test results show that the algorithm has high parallel efficiency. Compared with other existing algorithms, our algorithm seems to be the best for distributed memory parallel architecture.
Unable to display preview. Download preview PDF.
- 1.E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, S. Ostrouchov, and D. Sorenson, LAPACK User's Guide, SIAM, Philadelphia, 1992.Google Scholar
- 2.Q. Du, M. Jin, T. Y. Li and Z. Zeng, The Quasi-Laguerre iteration, to appear: Math. Comp.Google Scholar
- 3.Q. Du, M. Jin, T.Y. Li and Z. Zeng Quasi-Laguerre iteration in solving symmetric tridiagonal eigenvalue problems, to appear: SIAM J. Sci. Comput.Google Scholar
- 4.A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, V. Sunderam, PVM 3 User's Guide and Reference Manual, September, 1994.Google Scholar
- 5.G. H. Golub and C. F. Van Loan, Matrix Computations, 2nd Ed., The Johns Hopkins University Press, Baltimore, MD, 1989.Google Scholar
- 8.J. H. Wilkinson, The Algebraic Eigenvalue Problem, Oxford University Press, Oxford, 1965.Google Scholar
- 9.X. Zou, Quasi-Laguerre's method and its parallel implementation on solving symmetric tridiagonal eigenvalue problems, Ph.D thesis, Michigan State University, 1995.Google Scholar