Consider the largest eigenvalue of a symmetric matrix. It satisfies:

The Lanczos approximation uses Ritz eigenvalues (see also Arnoldi process):

From

we immediately find that .

We can do a more precise analysis using polynomials again. Here is a brief outline. We have, using the polynomial interpretation of Lanczos and Krylov subspaces:

where is a polynomial of degree .

By making the special choice of Chebyshev polynomials, we can prove that:

where depends on . We defined

Here is a schematic of the distribution of eigenvalues along the real axis for symmetric matrices:

With Chebyshev polynomials, we have

We obtain a rapid convergence when is well separated from the other eigenvalues and .

becomes very large with quickly.