Algorithm 826: A parallel eigenvalue routine for complex Hessenberg matrices

  • Authors:
  • Mark R. Fahey

  • Affiliations:
  • Oak Ridge National Laboratory, Oak Ridge, TN

  • Venue:
  • ACM Transactions on Mathematical Software (TOMS)
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

A code for computing the eigenvalues of a complex Hessenberg matrix is presented. This code computes the Schur decomposition of a complex Hessenberg matrix. Together with existing ScaLAPACK routines, the eigenvalues of dense complex matrices can be directly computed using a parallel QR algorithm.This parallel complex Schur decomposition routine was developed to fill a void in the ScaLAPACK library and was based on the parallel real Schur decomposition routine already in ScaLAPACK. The real-arithmetic version was appropriately modified to make it work with complex arithmetic and implement a complex multiple bulge QR algorithm. This also required the development of new auxiliary routines that perform essential operations for the complex Schur decomposition, and that will provide additional linear algebra computation capability to the parallel numerical library community.