The Godunov-inverse iteration: A fast and accurate solution to the symmetric tridiagonal eigenvalue problem
DOI10.1016/J.APNUM.2004.09.024zbMATH Open1072.65056OpenAlexW2009439499MaRDI QIDQ557939FDOQ557939
Authors: Anna M. Matsekh
Publication date: 30 June 2005
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2004.09.024
Recommendations
convergenceerror boundsnumerical exampleseigenvectorsbisection methodInverse iterationsymmetric tridiagonal eigenvalue problemTwo-sided Sturm sequence
Cites Work
- LAPACK Users' Guide
- Title not available (Why is that?)
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Templates for the Solution of Algebraic Eigenvalue Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fernando's solution to Wilkinson's problem: An application of double factorization
- On Computing an Eigenvector of a Tridiagonal Matrix. Part I: Basic Results
- Title not available (Why is that?)
- Computation of an eigenvector of a symmetric tridiagonal matrix
- A parallel algorithm for computing eigenvalues of very large real symmetric matrices on message passing architectures
- Title not available (Why is that?)
Cited In (4)
Uses Software
This page was built for publication: The Godunov-inverse iteration: A fast and accurate solution to the symmetric tridiagonal eigenvalue problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557939)