QR-like algorithms for the nonsymmetric eigenvalue problem

Authors:
J. B. Haag;D. S. Watkins
Affiliations:
Humboldt State Univ., Arcata, CA;Washington State Univ., Pullman
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1993

Citing 8
Cited 0

Distribution of mathematical software via electronic mail

Communications of the ACM
The algebraic eigenvalue problem

The algebraic eigenvalue problem
On a block implementation of Hessenberg multishift QR iteration

International Journal of High Speed Computing
Fundamentals of matrix computations

Fundamentals of matrix computations
Chasing algorithms for the eigenvalues problem

SIAM Journal on Matrix Analysis and Applications
LAPACK's user's guide

LAPACK's user's guide
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Fortran Subroutines for Computing the Eigenvalues and Eigenvectors of a General Matrix by Reduction to General Tridiagonal Form

Fortran Subroutines for Computing the Eigenvalues and Eigenvectors of a General Matrix by Reduction to General Tridiagonal Form

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hybrid codes that combine elements of the QR and LR algorithms are described. The codes can calculate the eigenvalues and, optionally, eigenvectors of real, nonsymmetric matrices. Extensive tests are presented as evidence that, for certain choices of parameters, the hybrid codes possess the same high reliability as the QR algorithm and are significantly faster. The greatest success has been achieved with the codes that calculate eigenvalues only. These can do the task in 15% to 50% less time than the QR algorithm.