On computing condition numbers for the nonsymmetric eigenproblem
- 1 June 1993
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 19 (2) , 202-223
- https://doi.org/10.1145/152613.152617
Abstract
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].Keywords
This publication has 21 references indexed in Scilit:
- FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimationACM Transactions on Mathematical Software, 1988
- Distribution of mathematical software via electronic mailCommunications of the ACM, 1987
- A LINPACK-style condition estimator for the equationAX-XB^{T} = CIEEE Transactions on Automatic Control, 1984
- A Hessenberg-Schur method for the problem AX + XB= CIEEE Transactions on Automatic Control, 1979
- Algorithm 517: A Program for Computing the Condition Numbers of Matrix Eigenvalues Without Computing Eigenvectors [F2]ACM Transactions on Mathematical Software, 1977
- Numerical Methods for Computing Angles Between Linear SubspacesMathematics of Computation, 1973
- Numerical methods for computing angles between linear subspacesMathematics of Computation, 1973
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]Communications of the ACM, 1972
- An algorithm for numerical determination of the structure of a general matrixBIT Numerical Mathematics, 1970
- Norms and exclusion theoremsNumerische Mathematik, 1960