The Godunov-inverse iteration: A fast and accurate solution to the symmetric tridiagonal eigenvalue problem

DOI10.1016/j.apnum.2004.09.024zbMath1072.65056OpenAlexW2009439499MaRDI QIDQ557939

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

zbMATH Keywords

convergencenumerical exampleseigenvectorserror boundsInverse iterationbisection methodsymmetric tridiagonal eigenvalue problemTwo-sided Sturm sequence

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Uses Software

• LAPACK
• Mathematica
• JDQR
• EISPACK
• JDQZ

Cites Work

• Computation of an eigenvector of a symmetric tridiagonal matrix
• Matrix eigensystem routines - EISPACK guide. 2nd ed
• A parallel algorithm for computing eigenvalues of very large real symmetric matrices on message passing architectures
• Fernando's solution to Wilkinson's problem: An application of double factorization
• LAPACK Users' Guide
• On Computing an Eigenvector of a Tridiagonal Matrix. Part I: Basic Results
• Templates for the Solution of Algebraic Eigenvalue Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item