Abstract
We present new algorithms that accelerate the bisection method for the symmetric tridiagonal eigenvalue problem. The algorithms rely on some new techniques, including a new variant of Newton's iteration that reaches cubic convergence (right from the start) to the well separated eigenvalues and can be further applied to acceleration of some other iterative processes, in particular, of the divide-and-conquer methods for the symmetric tridiagonal eigenvalue problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Anderson et al., LAPACK Users' Guide (SIAM, Philadelphia, PA, 1992).
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.
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.
H.J. Bernstein, An accelerated bisection method for the calculation of eigenvalues of symmetric tridiagonal matrices, Numer. Math. 43 (1984) 153–160.
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.
D. Bini and V.Y. Pan, Practical improvement of the divide-and-conquer eigenvalue algorithms, Computing 48 (1992) 109–123.
D. Bini and V.Y. Pan, Polynomial and Matrix Computations, Vol. 1: Fundamental Algorithms (Birkhäuser, Boston, 1994).
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.
J.J.M. Cuppen, A divide and conquer algorithm for the symmetric tridiagonal eigenproblem, Numer. Math. 36 (1981) 177–195.
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.
G.M. Golub and C.F. Van Loan, Matrix Computations (Johns Hopkins Univ. Press, Baltimore, MD, 1989).
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.
V.Y. Pan, Sequential and parallel complexity of approximate evaluation of polynomial zeros, Comput. Math. Appl. 14(8) (1987) 591–622.
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.
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).
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.
V.Y. Pan and J. Demmel, A new algorithm for the symmetric eigenvalue problem, J. Complexity 9 (1993) 387–405.
B.N. Parlett, The Symmetric Eigenvalue Problem (Prentice-Hall, Englewood Cliffs, NJ, 1980).
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.
V. Pereyra and G. Scherer, Eigenvalues of symmetric tridiagonal matrices: A fast, accurate and reliable algorithm, J. Inst. Math. Appl. 12 (1973) 209–222.
Rights and permissions
About this article
Cite this article
Pan, V.Y., Linzer, E. Bisection acceleration for the symmetric tridiagonal eigenvalue problem. Numerical Algorithms 22, 13–39 (1999). https://doi.org/10.1023/A:1019146505291
Issue Date:
DOI: https://doi.org/10.1023/A:1019146505291