Finding eigenvalues and eigenvectors of unsymmetric matrices using a hypercube multiprocessor

G. A. Geist, R. C. Ward, G. J. Davis, R. E. Funderlic

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

11 Scopus citations

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 languageEnglish
Title of host publicationProceedings of the 3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988
EditorsGeoffrey Fox
PublisherAssociation for Computing Machinery, Inc
Pages1577-1582
Number of pages6
ISBN (Electronic)0897912780, 9780897912785
DOIs
StatePublished - Jan 3 1989
Event3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988 - Pasadena, United States
Duration: Jan 19 1988Jan 20 1988

Publication series

NameProceedings of the 3rd Conference on Hypercube Concurrent Computers and Applications: Architecture, Software, Computer Systems, and General Issues, C3P 1988
Volume2

Conference

Conference3rd Conference on Hypercube Concurrent Computers and Applications, C3P 1988
Country/TerritoryUnited States
CityPasadena
Period01/19/8801/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.

Fingerprint

Dive into the research topics of 'Finding eigenvalues and eigenvectors of unsymmetric matrices using a hypercube multiprocessor'. Together they form a unique fingerprint.

Cite this