Algorithm 710: FORTRAN subroutines for computing the eigenvalues and eigenvectors of a general matrix by reduction to general tridiagonal form

Authors:
J. J. Dongarra;G. A. Geist;C. H. Romine
Affiliations:
-;-;-
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1992

Citing 2
Cited 2

The algebraic eigenvalue problem

The algebraic eigenvalue problem
Reduction of a general matrix to tridiagonal form

SIAM Journal on Matrix Analysis and Applications

Algorithm 841: BHESS: Gaussian reduction to a similar banded Hessenberg form

ACM Transactions on Mathematical Software (TOMS)
Exploiting the performance of 32 bit floating point arithmetic in obtaining 64 bit accuracy (revisiting iterative refinement for linear systems)

Proceedings of the 2006 ACM/IEEE conference on Supercomputing

Quantified Score

Hi-index	0.00

Visualization

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.