Finding eigenvalues and eigenvectors of unsymmetric matrices using a hypercube multiprocessor

  • Authors:
  • G. A. Geist;R. C. Ward;G. J. Davis;R. E. Funderlic

  • Affiliations:
  • Mathematical Sciences Section, Oak Ridge National Laboratory;Mathematical Sciences Section, Oak Ridge National Laboratory;Mathematics and Computer Sciences, Georgia State University;Department of Computer Science, North Carolina State University

  • Venue:
  • C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

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.