✦ LIBER ✦

A divide and conquer method for the symmetric tridiagonal eigenproblem

✍ Scribed by J. J. M. Cuppen

Publisher: Springer-Verlag
Year: 1980
Tongue: English
Weight: 701 KB
Volume: 36
Category: Article
ISSN: 0029-599X
DOI: 10.1007/bf01396757

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A divide-and-conquer method for the trid

A divide-and-conquer method for the tridiagonal generalized eigenvalue problem

✍ L. Elsner; A. Fasse; E. Langmann 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 368 KB

Eigenvalues of a symmetric tridiagonal m

Eigenvalues of a symmetric tridiagonal matrix: A divide-and-conquer approach

✍ A. S. Krishnakumar; Martin Morf 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 764 KB

Divide and conquer methods for block tri

Divide and conquer methods for block tridiagonal systems

✍ Volker Mehrmann 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 967 KB

A divide and conquer method for unitary

A divide and conquer method for unitary and orthogonal eigenproblems

✍ W. B. Gragg; L. Reichel 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 962 KB

A divide and conquer method for polynomi

A divide and conquer method for polynomial zeros

✍ T.L. Freeman; R.W. Brankin 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 575 KB

Divide and conquer: a parallel algorithm

Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations

✍ Stefan Bondeli 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 655 KB

Bondeli, S\_, Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations, Parallel Computing 17 (1991) 419-434\_ We describe a divide and conquer algorithm which solves linear tridiagonal systems with one right-hand side, especially suited for parallel com