Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank (Q2175838)

The Arnoldi-Chebyshev method for computing the PageRank vector of the Google matrix - with a focus on the convergence property - is presented. It is proven that the Chebyshev accelerating technique makes the Arnoldi process work well for a large range of values of the damping factor, in particular for those values close to one. Results of numerical examples support the theoretical results.