- #1

- 426

- 4

## Main Question or Discussion Point

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?

Your help would be appreciated.

Your help would be appreciated.