# The algorithm to find the largest eigenvalue and one of its eigenvector of a symmetric tridiagonal matrix?

Anyone can help describe any known specialized algorithm that finds (or quite accurately approximates) the largest eigenvalue and its eigenvectors of a symmetric tri-diagonal matrix in the form $\left( {\begin{array}{*{20}{c}} {{x_1}}&{{y_1}}&{}&{} \\ {{y_1}}&{{x_2}}& \ddots &{} \\ {}& \ddots & \ddots &{{y_{n - 1}}} \\ {}&{}&{{y_{n - 1}}}&{{x_n}} \end{array}} \right)$, where $y_1,...,y_{n-1}$ are positive numers? Is there any known best algorithm? "Specialized" means the algorithm is desired to use special properties of symmetric tridiagoal matrices run faster for them than classic method like QR Method or Rayleigh quotient iteration for general (symmetric) matrices. Many thanks!

• What do you know about the power iteration algorithm and how do you evaluate it? – Lutz Lehmann Jul 31 '17 at 4:54
• The "QR method" is a common approach here. – Omnomnomnom Jul 31 '17 at 11:41
• Thanks for comment. I know some about both. The algorithm is desired to use properties of tridiagonal matrices so it can run faster than methods for general symmetric matrices. – Ralph B. Jul 31 '17 at 12:02
• Try to find some articles on internet, there are many since 90th - $O(n^2)$ with parallelism should be good enough. – z100 Jul 31 '17 at 15:03