zbMATH — the first resource for mathematics

A Divide and Conquer method for the symmetric tridiagonal eigenproblem. (English) Zbl 0431.65022

65F15 Numerical computation of eigenvalues and eigenvectors of matrices
68Q25 Analysis of algorithms and problem complexity
ALGOL 60; zeroin
Full Text: DOI EuDML
[1] Bunch, J.R., Nielsen, C.P., Sorensen, D.C.: Rank one modification of the symmetric eigenproblem. Numer. Math.31, 31-48 (1978) · Zbl 0369.65007
[2] Bus, J.C., Dekker, T.J.: Two efficient algorithms with guaranteed convergence for finding a zero of a functions TOMS1, 330-345 (1975) · Zbl 0315.65031
[3] Golub, G.H.: Some modified mautrix eigenvalue problems. SIAM Rev.15, 318-334 (1973) · Zbl 0254.65027
[4] Gregory, R.T., Karney, D.L.: A collection of matrices for testing computational algorithms. New York: John Wiley, 1969 · Zbl 0195.44803
[5] Numal, A library of numerical procedures in Algol 60, second revision. Mathematisch Centrum Amsterdam, 1977
[6] Wilkinson, J.H.: The algebraic eigenvalue problem. Oxford: Clarendon Press 1965 · Zbl 0258.65037
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.