✦ LIBER ✦

Homotopy algorithm for symmetric eigenvalue problems

✍ Scribed by T. Y. Li; N. H. Rhee

Publisher: Springer-Verlag
Year: 1989
Tongue: English
Weight: 680 KB
Volume: 55
Category: Article
ISSN: 0029-599X
DOI: 10.1007/bf01390054

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simultaneous iteration algorithm for s

A simultaneous iteration algorithm for symmetric eigenvalue problems

✍ R. B. Corr; A. Jennings 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 758 KB

An algorithm for symmetric generalized i

An algorithm for symmetric generalized inverse eigenvalue problems

✍ Hua Dai 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 171 KB

A simple application of the homotopy met

A simple application of the homotopy method to symmetric eigenvalue problems

✍ Moody T. Chu 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 269 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

An algorithm for the generalized symmetr

An algorithm for the generalized symmetric tridiagonal eigenvalue problem

✍ Kuiyuan Li; Tien-Yien Li; Zhonggang Zeng 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 993 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