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

A parallel algorithm for the dense symmetric eigenvalue problem on a transputer array

โœ Scribed by T.Z Kalamboukis

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
391 KB
Volume
18
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