Current inverse iteration software can fail
From MaRDI portal
The author discusses various issues arising in the implementation of inverse iteration using reorthogonaliszation to compute eigenvectors of real symmetric matrices when the eigenvalues agree to more than three digits relative to the norm. Both theoretical and empirical failures of these implementations in EISEPACK and LAPACK are demonstrated. Finally, alternate approaches to the unresolved issues are mentioned.
Recommendations
Cites work
- Computing an Eigenvector with Inverse Iteration
- Fernando's solution to Wilkinson's problem: An application of double factorization
- scientific article; zbMATH DE number 3930234 (Why is no real title available?)
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 781814 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Improving the Accuracy of Inverse Iteration
- Inverse Iteration, Ill-Conditioned Equations and Newton’s Method
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- On Computing an Eigenvector of a Tridiagonal Matrix. Part I: Basic Results
- The Calculation of the Eigenvectors of Codiagonal Matrices
- Unitary Triangularization of a Nonsymmetric Matrix
Cited in
(3)
This page was built for publication: Current inverse iteration software can fail
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1279696)