Some algorithms of finding the eigenvalues of symmetric matrices first transform the matrix to a tridiagonal matrix which is similar to the original matrix and then find the eigenvalues of the tridiagonal matrix. . Are there special algorithms for a tridiagonal matrix, or do the same algorithms for general matrixes converge faster for a tridiagonal one?(adsbygoogle = window.adsbygoogle || []).push({});

Your help would be appreciated.

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Eigenvalues of a tridiagonal matrix

**Physics Forums | Science Articles, Homework Help, Discussion**