Summary
An algorithm is described which, given an approximate simple eigenvalue and a corresponding approximate eigenvector, provides rigorous error bounds for improved versions of them. No information is required on the rest of the eigenvalues, which may indeed correspond to non-linear elementary divisors. A second algorithm is described which gives more accurate improved versions than the first but provides only error estimates rather than rigorous bounds. Both algorithms extend immediately to the generalized eigenvalue problem.
Similar content being viewed by others
References
Wilkinson JH (1965) The Algebraic Eigenvalue Problem. Oxford University Press, London
Wilkinson JH (1972) Note on matrices with a very ill-conditioned eigenproblem. Numer. Math 19: 176–178
Wilkinson JH (1979) Inverse iteration, ill-conditioned equations and Newton's Method. SIAM Rev 21: 339–360
Yamamoto T (1980) Error bounds for computed eigenvalues and eigenvectors. Numer Math 34: 189–199
Author information
Authors and Affiliations
Additional information
Dedicated to A.S. Householder on his 75th birthday
Rights and permissions
About this article
Cite this article
Symm, H.J., Wilkinson, J.H. Realistic error bounds for a simple eigenvalue and its associated eigenvector. Numer. Math. 35, 113–126 (1980). https://doi.org/10.1007/BF01396310
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01396310