On computing condition numbers for the nonsymmetric eigenproblem

We review the theory of condition numbers for the nonsymmetric eigenproblem and give a tabular summary of bounds for eigenvalues, means of clusters of eigenvalues, eigenvectors, invariant subspaces, and related quantities. We describe the design of new algorithms for estimating these condition numbers. Fortran subroutines implementing these algorithms are in the LAPACK library [1].

[1]  C. T. Fike,et al.  Norms and exclusion theorems , 1960 .

[2]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .

[3]  Axel Ruhe.  An algorithm for numerical determination of the structure of a general matrix , 1970 .

[4]  Richard H. Bartels,et al.  Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4] , 1972, Commun. ACM.

[5]  W. Kahan.  Conserving Confluence Curbs Ill-Condition , 1972 .

[6]  G. Stewart.  Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems , 1973 .

[7]  G. W. Stewart,et al.  Algorithm 506: HQR3 and EXCHNG: Fortran Subroutines for Calculating and Ordering the Eigenvalues of a Real Upper Hessenberg Matrix [F2] , 1976, TOMS.

[8]  B. S. Garbow,et al.  Matrix Eigensystem Routines — EISPACK Guide , 1974, Lecture Notes in Computer Science.

[9]  Beresford N. Parlett,et al.  Algorithm 517: A Program for Computing the Condition Numbers of Matrix Eigenvalues Without Computing Eigenvectors [F2] , 1977, TOMS.

[10]  G. Golub,et al.  A Hessenberg-Schur method for the problem AX + XB= C , 1979 .

[11]  J. Varah.  On the Separation of Two Matrices , 1979 .

[12]  J. Demmel.  The condition number of equivalence transformations that block diagonalize matrix pencils , 1983 .

[13]  R. Byers.  A LINPACK-style condition estimator for the equation AX-XB^{T} = C , 1984 .

[14]  J. Demmel.  Computing stable eigendecompositions of matrices , 1986 .

[15]  Nicholas J. Highham.  A survey of condition number estimation for triangular matrices , 1987 .

[16]  C. Loan.  On estimating the condition of eigenvalues and eigenvectors , 1987 .

[17]  Distribution of mathematical software via electronic mail , 1987, CACM.

[18]  J. Demmel.  On condition numbers and the distance to the nearest ill-posed problem , 2015 .

[19]  Nicholas J. Higham,et al.  FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation , 1988, TOMS.

[20]  F. Chatelin.  Valeurs propres de matrices , 1988 .

[21]  L. Trefethen.  Approximation theory and numerical linear algebra , 1990 .

[22]  Jack J. Dongarra,et al.  Numerical Considerations in Computing Invariant Subspaces , 1992, SIAM J. Matrix Anal. Appl..