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]. © 1993, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
Bai, Z., Demmel, J., & McKenney, A. (1993). On Computing Condition Numbers for the Nonsymmetric Eigenproblem. ACM Transactions on Mathematical Software (TOMS), 19(2), 202–223. https://doi.org/10.1145/152613.152617
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.