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 Parallel Implementation of the Nonsymmetric QR Algorithm for Distributed Memory Architectures
β Scribed by Henry, Greg; Watkins, David; Dongarra, Jack
- Book ID
- 118188220
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 2002
- Tongue
- English
- Weight
- 241 KB
- Volume
- 24
- Category
- Article
- ISSN
- 1064-8275
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Ray tracing is a well known technique to generate life-like images. Unfortunately, ray tracing complex scenes can require large amounts of CPU time and memory storage. Distributed memory parallel computers with large memory capacities and high processing speeds are ideal candidates to perform ray tr
We present a parallel algorithm for performing multipoint linkage analysis of genetic marker data on large family pedigrees. The algorithm effectively distributes both the computation and memory requirements of the analysis. We discuss an implementation of the algorithm in the Genehunter linkage ana
We present three parallel implementations of the Karatsuba algorithm for long integer multiplication on a distributed memory architecture and discuss the experimental results obtained on a Paragon computer. The first two implementations have both time complexity O(n) on n log 2 3 processors, but pre