Efficient algorithms for eigenvalue problems
In computational science symmetric eigenvalue problems are central and the need for fast and accurate algorithms are high. When solving a symmetric eigenvalue problem the easiest way is to first transform the full matrix into a tridiagonal problem and then solve it.