Abstract
We present a new algorithm for computing eigenvectors of real symmetric tridiagonal matrices based on Godunov's two-sided Sturm sequence method and inverse iteration, which we call the Godunov-inverse iteration. We use eigenvector approximations computed recursively from two-sided Sturm sequences as starting vectors in inverse iteration, replacing any nonnumeric elements of these approximate eigenvectors with uniform random numbers. We use the left-hand bounds of the smallest machine presentable eigenvalue intervals found by the bisection method as inverse iteration shifts, while staying within guaranteed error bounds. In most test cases convergence is reached after only one or two iterations, producing accurate residuals.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.