×
Cuppen, J. J. M.

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

Numer. Math. 36, 177-195 (1981).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0431.65022

Cited in 12 Reviews
Cited in 89 Documents

MSC:

65F15 Numerical computation of eigenvalues and eigenvectors of matrices
68Q25 Analysis of algorithms and problem complexity

Keywords:

Divide and Conquer method; symmetric tridiagonal eigenproblem

Software:

zeroin; ALGOL 60
Cite Review PDF
Full Text: DOI EuDML

References:

[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 · doi:10.1007/BF01396012
[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 · doi:10.1145/355656.355659
[3] Golub, G.H.: Some modified mautrix eigenvalue problems. SIAM Rev.15, 318-334 (1973) · Zbl 0254.65027 · doi:10.1137/1015032
[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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.