Skip Navigation

IMA Journal of Applied Mathematics 1973 12(2):209-222; doi:10.1093/imamat/12.2.209
© 1973 by Institute of Mathematics and its Applications
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by PEREYRA, V.
Right arrow Articles by SCHERER, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Eigenvalues of Symmetric Tridiagonal Matrices: A Fast, Accurate and Reliable Algorithm

V. PEREYRA and G. SCHERER

Department of Computation, Faculty of Sciences, Central University Venezuela
Department of Physics, Venezuelan Institute of Scientific Research and Department of Computer Science, University of Uppsala Sweden

An algorithm is developed for obtaining eigenvalues of real, symmetric, tridiagonal matrices. It combines dynamically Given's method of bisection and the use of Sturm sequences with various acceleration devices.

A FORTRAN IV computer implementation of the algorithm was used on ten test matrices found in the literature. The new method is as precise and reliable as the best published program (Kahan & Varah, 1966), it is never slower, and in at least one case is two and half times faster than the Kahan and Varah program.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.