Rapid computation of the QR factorization of a matrix is fundamental to many scientific and engineering problems. The paper presents a family of algorithms parameterized by the number of processors available P, arithmetic grain aggregation parameters gl ,@, . . . ,gp, and communication grain aggrega
A parallel implementation of the QR-algorithm
β Scribed by G.W Stewart
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 571 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
This paper considers the parallel implementation of a genetic algorithm using a network of transputers. The context of the work is the design of a flight control system using a novel approach to Robust Eigenstructure Assignment. The robustness properties of the Linear Quadratic Regulator are exploit