✦ LIBER ✦

Acceleration of the convergence in Nesbet's algorithm for eigenvalues and eigenvectors of large matrices

✍ Scribed by Roger M Nisbet

Book ID: 107788420
Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 253 KB
Volume: 10
Category: Article
ISSN: 0021-9991
DOI: 10.1016/0021-9991(72)90055-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Modification of Nesbet's algorithm for t

Modification of Nesbet's algorithm for the iterative evaluation of eigenvalues and eigenvectors of large matrices

✍ Isaiah Shavitt 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 406 KB

Improved algorithms for the lowest few e

Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices

✍ Christopher W Murray; Stephen C Racine; Ernest R Davidson 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 798 KB

An improved computer program for eigenve

An improved computer program for eigenvectors and eigenvalues of large configuration interaction matrices using the algorithm of Davidson

✍ Gerardo Cisneros; Carlos F. Bunge 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 255 KB

Two algorithms for the parallel computat

Two algorithms for the parallel computation of eigenvalues and eigenvectors of large symmetric matrices using the ICL DAP

✍ J.S Weston; M Clint 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 675 KB

An efficient method for computing leadin

An efficient method for computing leading eigenvalues and eigenvectors of large asymmetric matrices

✍ L Goldhirsch; Steven A. Orszag; B. K. Maulik 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 1002 KB

A concurrent algorithm for parallel calc

A concurrent algorithm for parallel calculation of eigenvalues and eigenvectors of real symmetric matrices

✍ Ramon Carbo; Lluís Molino; Blanca Calabuig 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 412 KB

Elementary Jacobi Rotations are used as the basic tools to obtain eigenvalues and eigenvectors of arbitrary real symmetric matrices. The proposed algorithm has a complete concurrent structure, that is: every eigenvalueeigenvector pair can be obtained in any order and in an independent way from the r