𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A parallel iterative method for solving symmetric tridiagonal extreme eigenpair problems

✍ Scribed by Zhenyue Zhang

Book ID
108022378
Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
721 KB
Volume
26
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

CONJUGATE GRADIENT METHODS FOR SOLVING T
CONJUGATE GRADIENT METHODS FOR SOLVING THE SMALLEST EIGENPAIR OF LARGE SYMMETRIC EIGENVALUE PROBLEMS
✍ Y. T. FENG; D. R. J. OWEN πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 1000 KB

In this paper, a detailed description of CG for evaluating eigenvalue problems by minimizing the Rayleigh quotient is presented from both theoretical and computational viewpoints. Three variants of CG together with their asymptotic behaviours and restarted schemes are discussed. In addition, it is s

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