Algorithm 710: FORTRAN Subroutines for Computing the Eigenvalues and Eigenvectors of a General Matrix by Reduction to General Tridiagonal Form

J. J. Dongarra, G. A. Geist, C. H. Romine

Research output: Contribution to journalArticlepeer-review

13 Scopus citations

Abstract

This paper describes programs to reduce a nonsymmetric matrix to tridiagonal form, to compute the eigenvalues of the tridiagonal matrix, to improve the accuracy of an eigenvalue, and to compute the corresponding eigenvector. The intended purpose of the software is to find a few eigenpairs of a dense nonsymmetric matrix faster and more accurately than previous methods. The performance and accuracy of the new routines are compared to two EISPACK paths: RG and HQR-INVIT. The results show that the new routines are more accurate and also faster if less than 20 percent of the eigenpairs are needed.

Original languageEnglish
Pages (from-to)392-400
Number of pages9
JournalACM Transactions on Mathematical Software
Volume18
Issue number4
DOIs
StatePublished - Jan 12 1992

Keywords

  • condensed form
  • eigenvalues
  • nonsymmetric
  • numerical algorithms

Fingerprint

Dive into the research topics of 'Algorithm 710: FORTRAN Subroutines for Computing the Eigenvalues and Eigenvectors of a General Matrix by Reduction to General Tridiagonal Form'. Together they form a unique fingerprint.

Cite this