𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A blocked QR-decomposition for the parallel symmetric eigenvalue problem

✍ Scribed by Auckenthaler, T.; Huckle, T.; Wittmann, R.

Book ID
122158252
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
671 KB
Volume
40
Category
Article
ISSN
0167-8191

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