Finding eigenvalues and eigenvectors of unsymmetric matrices using a distributed-memory multiprocessor
Distributed-memory parallel algorithms for finding the eigenvalues and eigenvectors of a dense unsymmetric matrix are given. While several parallel algorithms have been developed for symmetric matrices, little work has been done on the unsymmetric case. Our parallel implementation proceeds in three major steps: reduction of the original matrix to Hessenberg form, application of the implicit double-shift QR algorithm to compute the eigenvalues, and back transformations to compute the eigenvectors. Several modifications to our parallel QR algorithm, including ring communication, pipelining and delayed updating are discussed and compared. Results and timings are given. 9 refs., 7 figs., 1 tab.
- Research Organization:
- Oak Ridge National Lab., TN (USA)
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 6637340
- Report Number(s):
- ORNL/TM-10938; ON: DE89004731
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel tridiagonalization of a general matrix using distributed-memory multiprocessors
The performance of finding eigenvalues and eigenvectors of dense symmetric matrices on distributed memory computers