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

Authors:
Anna M. Matsekh
Affiliations:
Los Alamos Natl. Lab., Los Alamos and Modeling, Algorithms and Informatics Group, Comp. and Comput. Sci. Div., Los Alamos and Inst. of Computational Technol., Siberian Branch of the Russian Academ ...
Venue:
Applied Numerical Mathematics - 6th IMACS International symposium on iterative methods in scientific computing
Year:
2005

Citing 8
Cited 1

The algebraic eigenvalue problem

The algebraic eigenvalue problem
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
On Computing an Eigenvector of a Tridiagonal Matrix. Part I: Basic Results

SIAM Journal on Matrix Analysis and Applications
A new O (N(2)) algorithm for the symmetric tridiagonal eigenvalue/eigenvector problem

A new O (N(2)) algorithm for the symmetric tridiagonal eigenvalue/eigenvector problem
A parallel algorithm for computing eigenvalues of very large real symmetric matrices on message passing architectures

IMACS'97 Proceedings on the on Iterative methods and preconditioners
The Mathematica book (4th edition)

The Mathematica book (4th edition)
LAPACK Users' guide (third ed.)

LAPACK Users' guide (third ed.)
Templates for the solution of algebraic eigenvalue problems: a practical guide

Templates for the solution of algebraic eigenvalue problems: a practical guide

Algorithm 880: A testing infrastructure for symmetric tridiagonal eigensolvers

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

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.