๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A simultaneous iteration algorithm for symmetric eigenvalue problems

โœ Scribed by R. B. Corr; A. Jennings

Publisher
John Wiley and Sons
Year
1976
Tongue
English
Weight
758 KB
Volume
10
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

An inexact inverse iteration for large s
An inexact inverse iteration for large sparse eigenvalue problems
โœ Yu-Ling Lai; Kun-Yi Lin; Wen-Wei Lin ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 111 KB ๐Ÿ‘ 2 views

In this paper, we propose an inexact inverse iteration method for the computation of the eigenvalue with the smallest modulus and its associated eigenvector for a large sparse matrix. The linear systems of the traditional inverse iteration are solved with accuracy that depends on the eigenvalue with