An Arnoldi-Extrapolation algorithm for computing PageRank

Citations of this article
Mendeley users who have this article in their library.


The Arnoldi-type algorithm proposed by Golub and Greif [G. Golub, C. Greif, An Arnoldi-type algorithm for computing PageRank, BIT 46 (2006) 759771] is a restarted Krylov subspace method for computing PageRank. However, this algorithm may not be efficient when the damping factor is high and the dimension of the search subspace is small. In this paper, we first develop an extrapolation method based on Ritz values. We then consider how to periodically knit this extrapolation method together with the Arnoldi-type algorithm. The resulting algorithm is the Arnoldi-Extrapolation algorithm. The convergence of the new algorithm is analyzed. Numerical experiments demonstrate the numerical behavior of this algorithm. © 2010 Elsevier B.V. All rights reserved.




Wu, G., & Wei, Y. (2010). An Arnoldi-Extrapolation algorithm for computing PageRank. In Journal of Computational and Applied Mathematics (Vol. 234, pp. 3196–3212).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free