𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A New Algorithm for the Symmetric Tridiagonal Eigenvalue Problem

✍ Scribed by V. Pan; J. Demmel

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
672 KB
Volume
9
Category
Article
ISSN
0885-064X

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

A parallel QR algorithm for the nonsymme
A parallel QR algorithm for the nonsymmetric eigenvalue problem
✍ Daniel Boley; Robert Maier; Joung Kim πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 973 KB

This paper describes a prototype parallel algorithm for approximating eigenvalues of a dense nonsymmetric matrix on a linear, synchronous processor array. The algorithm is a parallel implementation of the explicitly-shifted QR, employing n distributed-memory processors to deliver all eigenvalues in

New Methods for Calculations of the Lowe
New Methods for Calculations of the Lowest Eigenvalues of the Real Symmetric Generalized Eigenvalue Problem
✍ Alexander V. Mitin πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 71 KB

A new iterative method based on a Newton correction vector for extension of the Krylov subspace, its diagonal, and band versions are proposed for calculation of selected lowest eigenvalues and corresponding eigenvectors of the generalized symmetric eigenvalue problem. Additionally, diagonal and band