Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank

摘要

In this paper, by integrating the Arnoldi method with the Chebyshev acceleration technique, we present the Arnoldi-Chebyshev method for computing the PageRank vector of the Google matrix. Convergence analysis of this method is exhibited. In addition, some numerical experiments are carried out to demonstrate the competitiveness of the new method with a few state-of-the art iterative methods. (C) 2020 Elsevier B.V. All rights reserved.