Bisection acceleration for the symmetric tridiagonal eigenvalue problem

Numerical Algorithms

Volumn 22, Issue 1, 1999, Pages 13-39

  Pan, Victor Y ^a   Linzer, Elliot ^b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b DiviCom   (United States)

Author keywords

Approximating polynomial zeros; Bisection algorithm; Convergence acceleration; Divide and conquer eigenvalue algorithms; Newton's iteration; Symmetric eigenvalue problem

Indexed keywords

EID: 0043080299     PISSN: 10171398     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1019146505291     Document Type: Article

References (20)

1. E. Anderson et al., LAPACK Users' Guide (SIAM, Philadelphia, PA, 1992).
2. 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.
3. M. Ben-Or and P. Tiwari, Simple algorithm for approximating all roots of a polynomial with real roots, J. Complexity 6(4) (1990) 417-442.
4. H.J. Bernstein, An accelerated bisection method for the calculation of eigenvalues of symmetric tridiagonal matrices, Numer. Math. 43 (1984) 153-160.
5. D. Bini and V.Y. Pan, Parallel complexity of tridiagonal symmetric eigenvalue problem, in: Proc. of the 2nd Ann. ACM-SIAM Symposium on Discrete Algorithms (ACM, New York, and SIAM, Philadelphia, PA, 1991) pp. 384-393.
6. D. Bini and V.Y. Pan, Practical improvement of the divide-and-conquer eigenvalue algorithms, Computing 48 (1992) 109-123.
7. D. Bini and V.Y. Pan, Polynomial and Matrix Computations, Vol. 1: Fundamental Algorithms (Birkhäuser, Boston, 1994).
8. D. Bini and V.Y. Pan, Computing matrix eigenvalues and polynomial zeros where the output is real, SIAM J. Comput. 27(4) (1998) 1099-1115.
9. J.J.M. Cuppen, A divide and conquer algorithm for the symmetric tridiagonal eigenproblem, Numer. Math. 36 (1981) 177-195.
10. J.J. Dongarra and D.C. Sorensen, A fully parallel algorithm for the symmetric eigenvalue problem, SIAM J. Sci. Statist. Comput. 8(2) (1987) 139-154.
11. G.M. Golub and C.F. Van Loan, Matrix Computations (Johns Hopkins Univ. Press, Baltimore, MD, 1989).
12. S.-S. Lo, B. Philippe and A. Sameh, A multiprocessor algorithm for the symmetric tridiagonal eigenvalue problem, SIAM J. Sci. Statist. Comput. 8 (1987) 155-165.
13. V.Y. Pan, Sequential and parallel complexity of approximate evaluation of polynomial zeros, Comput. Math. Appl. 14(8) (1987) 591-622.
14. V.Y. Pan, Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros, Comput. Math. Appl. 17(11) (1989) 1475-1480.
15. V.Y. Pan, Accelerated solution of the symmetric eigenvalue problem, Technical Report TR 92-06, Computer Science Dept., SUNYA, Albany, NY (1992), and Technical Report 93-016, International Computer Science Institute, Berkeley, CA (1993).
16. V.Y. Pan, New techniques for approximating complex polynomial zeros, in: Proc. of the 5th Ann. Sympos. on Discrete Algorithms (ACM Press, New York, and SIAM, Philadelphia, PA, 1994) pp. 260-270.
17. V.Y. Pan and J. Demmel, A new algorithm for the symmetric eigenvalue problem, J. Complexity 9 (1993) 387-405.
18. B.N. Parlett, The Symmetric Eigenvalue Problem (Prentice-Hall, Englewood Cliffs, NJ, 1980).
19. B.N. Parlett and J.K. Reid, Tracking the process of the Lanczos algorithmn for large symmetric eigenproblems, IMA J. Numer. Anal. 1 (1981) 135-155.
20. V. Pereyra and G. Scherer, Eigenvalues of symmetric tridiagonal matrices: A fast, accurate and reliable algorithm, J. Inst. Math. Appl. 12 (1973) 209-222.