Summary
The Symmetric Tridiagonal Eigenproblem has been the topic of some recent work. Many methods have been advanced for the computation of the eigenvalues of such a matrix. In this paper, we present a divide-and-conquer approach to the computation of the eigenvalues of a symmetric tridiagonal matrix via the evaluation of the characteristic polynomial. The problem of evaluation of the characteristic polynomial is partitioned into smaller parts which are solved and these solutions are then combined to form the solution to the original problem. We give the update equations for the characteristic polynomial and certain auxiliary polynomials used in the computation. Furthermore, this set of recursions can be implemented on a regulartree structure. If the concurrency exhibited by this algorithm is exploited, it can be shown that thetime for computation of all the eigenvalues becomesO(nlogn) instead ofO(n 2) as is the case for the approach where the order is increased by only one at every step. We address the numerical problems associated with the use of the characteristic polynomial and present a numerically stable technique for the eigenvalue computation.
Similar content being viewed by others
References
Ang, P.H., Delosme, J.-M., Morf, M.: Concurrent Implementations of Matrix Eigenvalue Decomposition based on Isospectral Flows. Proc. 27th Ann. Symp. of SPIE, San Diego, California. (Aug. 23–25, 1983)
Krishnakumar, A.S., Morf M.: A Tree Architecture for the Symmetric Eigenproblem. Proc. 27th Ann. Symp. of SPIE, San Diego, California (Aug. 23–25, 1983)
Cuppen, J.J.M.: A Divide and Conquer Method for the Symmetric Tridiagonal Eigenproblem. Numer. Math.36, 177–195 (1981)
Golub, G.H.: Some Modified Matrix Eigenvalue Problems. SIAM Rev.15, 318–334 (1973)
Parlett, B.N.: The Symmetric Eigenvalue Problem. Englewood Cliffs, New Jersey: Prentice-Hall 1980
Wilkinson, J.H.: The Algebraic Eigenvalue Problem. Oxford: Clarendon Press 1965
Wilkinson, J. H., Reinsch, C.: Handbook for Automatic Computation: Linear Algebra, vol. II. Berlin-Heidelberg-New York: Springer 1971
Wilkinson, J. H.: Error Analysis of Floating-point Computation. Numer. Math.2, 319–340 (19 )
Barth, W., Martin, R.S., Wilkinson, J.H.: Calculation of the Eigenvalues of a Symmetric Tridiagonal Matrix by the Method of Bisection. Numer. Math.9, 386–393 (1967)
Schreiber, R.: Systolic arrays for eigenvalue computation: Proc. of SPIE341, 27–34 (1982)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Krishnakumar, A.S., Morf, M. Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach. Numer. Math. 48, 349–368 (1986). https://doi.org/10.1007/BF01389480
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01389480