Abstract
Distributed-memory algorithms for finding the eigenvalues and eigenvectors of a dense unsymmetric matrix are given. While several parallel algorithms have been developed for symmetric systems, 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 and pipelining, are discussed and compared. Results and timings are given.
Original language | English |
---|---|
Title of host publication | Proceedings of the 3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988 |
Editors | Geoffrey Fox |
Publisher | Association for Computing Machinery, Inc |
Pages | 1577-1582 |
Number of pages | 6 |
ISBN (Electronic) | 0897912780, 9780897912785 |
DOIs | |
State | Published - Jan 3 1989 |
Event | 3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988 - Pasadena, United States Duration: Jan 19 1988 → Jan 20 1988 |
Publication series
Name | Proceedings of the 3rd Conference on Hypercube Concurrent Computers and Applications: Architecture, Software, Computer Systems, and General Issues, C3P 1988 |
---|---|
Volume | 2 |
Conference
Conference | 3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988 |
---|---|
Country/Territory | United States |
City | Pasadena |
Period | 01/19/88 → 01/20/88 |
Funding
*This research was supported by the Applied Mathematical Sciences Research Program, Office of Energy Research, U.S. Department of Energy under contract DE-AC05-840R21400 with Martin Marietta Energy Systems Inc.