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
A new efficient parallelization strategy for the QR algorithm
β Scribed by Thomas Schreiber; Peter Otto; Fridolin Hofmann
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 540 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
conditions. These conditions, which represent additional time-dependent partial differential equations, are ex-One of the great challenges in computational physics is the prediction of flow associated noise, where the quantities of interest, tremely important for successful aeroacoustic simulations.