Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



A parallel algorithm for computing the eigenvalues of a symmetric tridiagonal matrix

Author: Paul N. Swarztrauber
Journal: Math. Comp. 60 (1993), 651-668
MSC: Primary 65F15; Secondary 65Y05
MathSciNet review: 1164126
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: A parallel algorithm, called polysection, is presented for computing the eigenvalues of a symmetric tridiagonal matrix. The method is based on a quadratic recurrence in which the characteristic polynomial is constructed on a binary tree from polynomials whose degree doubles at each level. Intervals that contain exactly one zero are determined by the zeros of polynomials at the previous level which ensures that different processors compute different zeros. The signs of the polynomials at the interval endpoints are determined a priori and used to guarantee that all zeros are found. The use of finite-precision arithmetic may result in multiple zeros; however, in this case, the intervals coalesce and their number determines exactly the multiplicity of the zero. For an $ N \times N$ matrix the eigenvalues can be determined in $ O({\log ^2}N)$ time with $ {N^2}$ processors and $ O(N)$ time with N processors. The method is compared with a parallel variant of bisection that requires $ O({N^2})$ time on a single processor, $ O(N)$ time with N processors, and $ O(\log N)$ time with $ {N^2}$ processors.

References [Enhancements On Off] (What's this?)

  • [1] W. Barth, R. S. Martin, and J. H. Wilkinson, Calculation of the eigenvalues of a symmetric tridiagonal matrix by the method of bisection, Numer. Math. 9 (1967), 386-393. MR 1553954
  • [2] J. R. Bunch, C. P. Nielsen, and D. C. Sorensen, Rank-one modification of the symmetric eigenproblem, Numer. Math. 31 (1978), 31-48. MR 508586 (80g:65038)
  • [3] J. J. M. Cuppen, A divide and conquer method for the symmetric tridiagonal eigenproblem, Numer. Math. 36 (1981), 177-195. MR 611491 (82d:65038)
  • [4] J. Demmel and W. Kahan, Accurate singular values of bidiagonal matrices, SIAM J. Sci. Statist. Comput. 11 (1990), 873-912. MR 1057146 (91i:65072)
  • [5] J. Demmel and W. Gragg, On computing accurate singular values and eigenvalues of acyclic matrices, IMA Preprint Series, no. 962, Institute for Math. and its Appl., Univ. of Minnesota, 1992.
  • [6] J. J. Dongarra and D. C. Sorensen, A fully parallel algorithm for the symmetric eigenvalue problem, SIAM J. Sci. Statist. Comput. 8 (1987), s139-s154. MR 879400 (88f:65054)
  • [7] D. J. Evans, J. Shanehchi, and C. C. Rick, A modified bisection algorithm for the determination of the eigenvalues of a symmetric tridiagonal matrix, Numer. Math. 38 (1982), 417-419. MR 654106 (83c:65072)
  • [8] I. C. F. Ipsen and E. R. Jessup, Solving the symmetric tridiagonal eigenvalue problem on the hypercube, SIAM J. Sci. Statist. Comput. 11 (1990), 203-229. MR 1037511 (90m:65076)
  • [9] W. Kahan, Accurate eigenvalues of a symmetric tri-diagonal matrix, Tech. Report CS41, Comput. Sci. Dept., Stanford University, July 22, 1966, with revisions to June 1968, available from the author at the University of California at Berkeley.
  • [10] A. S. Krishnakumar and M. Morf, Eigenvalues of a symmetric tridiagonal matrix: a divide and conquer approach, Numer. Math. 48 (1986), 349-368. MR 826474 (87i:65053)
  • [11] R. E. Ladner and M. J. Fisher, Parallel prefix computation, J. Assoc. Comput. Mach. 27 (1980), pp. 831-838. MR 594702 (82a:94115)
  • [12] S.-S. Lo, B. Philippe, and A. H. Sameh, A multiprocessor algorithm for the symmetric tridiagonal eigenvalue problem, SIAM J. Sci. Statist. Comput. 8 (1987), s155-s165. MR 879401
  • [13] A. H. Sameh and D. J. Kuch, A parallel QR algorithm for symmetric tridiagonal matrices, IEEE Trans. Comput. 26 (1977), 147-153. MR 0449003 (56:7308)
  • [14] R. Schreiber, Computing generalized inverses and eigenvalues of symmetric matrices using systolic arrays, Computing Methods in Applied Sciences and Engineering VI (R. Glowinski and J.-L. Lions, eds.), North-Holland, Amsterdam, 1984, pp. 285-295. MR 806785 (86k:65145)
  • [15] B. T. Smith, J. M. Boyle, J. J. Dongarra, B. S. Garbow, Y. Ikebe, V. C. Klema, and C. B. Moler, Matrix eigensystem routines--EISPACK Guide, 2nd ed., Lecture Notes in Comput. Sci., vol. 6, Springer-Verlag, New York, 1976. MR 0494879 (58:13662a)
  • [16] D. C. Sorensen and P. T. P. Tang, On the orthogonality of eigenvectors computed by divide-and-conquer techniques, SIAM J. Numer. Anal. 28 (1991), 1172-1775. MR 1135764 (92h:65065)
  • [17] H. S. Stone, Parallel tridiagonal solvers, ACM Trans. Math. Software 1 (1975), 289-307. 18. P. N. Swarztrauber, A direct method for the discrete solution of separable elliptic equations, SIAM J. Numer. Anal. 11 (1974), 1136-1150. MR 0388842 (52:9676)
  • [19] -, A parallel algorithm for solving general tridiagonal equations, Math. Comp. 33 (1979), 185-199. MR 514818 (80b:65041)
  • [20] J. H. Wilkinson, Calculation of the eigenvalues of a symmetric tridiagonal matrix by the method of bisection, Numer. Math. 4 (1962), 362-367. MR 0148208 (26:5716)
  • [21] -, The algebraic eigenvalue problem, Clarendon Press, Oxford, 1965. MR 0184422 (32:1894)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65F15, 65Y05

Retrieve articles in all journals with MSC: 65F15, 65Y05

Additional Information

Keywords: Parallel computing, symmetric tridiagonal matrix, eigenvalues
Article copyright: © Copyright 1993 American Mathematical Society

American Mathematical Society