✦ LIBER ✦

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

✍ Scribed by Christopher W Murray; Stephen C Racine; Ernest R Davidson

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 798 KB
Volume: 103
Category: Article
ISSN: 0021-9991
DOI: 10.1016/0021-9991(92)90409-r

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

Iterative methods for the calculation of

Iterative methods for the calculation of a few of the lowest eigenvalues and corresponding eigenvectors of the AX = λBX equation with real symmetric matrices of large dimension

✍ Alexander V. Mitin 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 326 KB

New methods for the iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of a generalized eigenvalue problem are proposed. These methods use only multiplication of the A and B matrices on a vector. 0 1994 by John Wiley & Sons, Inc.

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

The parallel computation of eigenvalues

The parallel computation of eigenvalues and eigenvectors of large Hermitian matrices using the AMT DAP 510

✍ Weston, J. S. ;Clint, M. ;Bleakney, C. W. 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 370 KB 👁 1 views

A novel algorithm for calculation of the

A novel algorithm for calculation of the extreme eigenvalues of large Hermitian matrices

✍ Yuko Okamoto; Humphrey J. Maris 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 661 KB

A new fast algorithm for calculating a few maximum (or minimum) eigenvalues and the corresponding eigenvectors of large N x N Hermitian matrices is presented. The method is based on a molecular dynamics algorithm for N coupled harmonic oscillators. The time step for iteration is chosen so that only

Comparative study of two algorithms for

Comparative study of two algorithms for the calculation of the extreme eigenvalues of large matrices

✍ S.J. Sciutto 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 225 KB

Two algorithms for the calculation of extreme eigenvalues of large matrices recently presented are compared. The first one is a modification of the well-known power method with Chebyshev iterations to accelerate convergence and an auxiliary procedure capabable of automatically setting all the extern