✦ LIBER ✦

A modified bisection algorithm for the determination of the eigenvalues of a symmetric tridiagonal matrix

✍ Scribed by D. J. Evans; J. Shanehchi; C. C. Rick

Publisher: Springer-Verlag
Year: 1982
Tongue: English
Weight: 150 KB
Volume: 38
Category: Article
ISSN: 0029-599X
DOI: 10.1007/bf01396441

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An accelerated bisection method for the

An accelerated bisection method for the calculation of eigenvalues of a symmetric tridiagonal matrix

✍ Herbert J. Bernstein 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 410 KB

Calculation of the eigenvalues of a symm

Calculation of the eigenvalues of a symmetric tridiagonal matrix by the method of bisection

✍ J. H. Wilkinson 📂 Article 📅 1962 🏛 Springer-Verlag 🌐 English ⚖ 246 KB

Calculation of the eigenvalues of a symm

Calculation of the eigenvalues of a symmetric tridiagonal matrix by the method of bisection

✍ W. Barth; R. S. Martin; J. H. Wilkinson 📂 Article 📅 1967 🏛 Springer-Verlag 🌐 English ⚖ 513 KB

A New Algorithm for the Symmetric Tridia

A New Algorithm for the Symmetric Tridiagonal Eigenvalue Problem

✍ V. Pan; J. Demmel 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 672 KB

Parallel implementation of bisection for

Parallel implementation of bisection for the calculation of eigenvalues of tridiagonal symmetric matrices

✍ H. J. Bernstein; M. Goldstein 📂 Article 📅 1986 🏛 Springer Vienna 🌐 English ⚖ 399 KB

A Parallel QR Algorithm for the Symmetri

A Parallel QR Algorithm for the Symmetrical Tridiagonal Eigenvalue Problem

✍ L. Kaufman 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 478 KB

The implicit QR algorithm is a serial iterative algorithm for determining all the eigenvalues of an \(n \times n\) symmetric tridiagonal matrix \(A\). About \(3 n\) iterations, each requiring the serial application of about \(n\) similarity planar transformations, are required to reduce \(A\) to dia