𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Iterative calculation of eigenvalues and eigenvectors of large, real matrix systems with overlap

✍ Scribed by G. A. Gallup

Publisher
John Wiley and Sons
Year
1982
Tongue
English
Weight
262 KB
Volume
3
Category
Article
ISSN
0192-8651

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

An improved method for obtaining a few eigenvalues and eigenvectors of the symmetric matrix system is presented:

where S ≠ I. The method allows us to handle larger systems more easily than any other known to the author. It requires the inversion of S, and N^3^ step, but thereafter each eigenvector and eigenvalue is obtained in a length of time proportional to N^2^. The relation of this method to the MOR and MMOR methods developed recently for handling the case, S = I, is discussed.

📜 SIMILAR VOLUMES

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

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.