Department of Mathematics
On adaptively accelerated Arnoldi method for computing PageRank
A generalized refined Arnoldi method based on the weighted inner product is presented for computing PageRank. The properties of the generalized refined Arnoldi method were studied. To speed up the convergence performance for computing PageRank, we propose to change the weights adaptively where the weights are calculated based on the current residual corresponding to the approximate PageRank vector. Numerical results show that the proposed Arnoldi method converges faster than existing methods, in particular when the damping factor is large. © 2011 John Wiley & Sons, Ltd.
Arnoldi process, Eigenvalue and eigenvector, PageRank, Power method, Weighted least squares problem
Source Publication Title
Numerical Linear Algebra with Applications
Link to Publisher's Edition
Yin, J., Yin, G., & Ng, M. (2012). On adaptively accelerated Arnoldi method for computing PageRank. Numerical Linear Algebra with Applications, 19 (1), 73-85. https://doi.org/10.1002/nla.789