Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 73-85 |
Number of pages | 13 |
Journal | Numerical Linear Algebra with Applications |
Volume | 19 |
Issue number | 1 |
DOIs | |
Publication status | Published - Jan 2012 |
User-Defined Keywords
- Arnoldi process
- Eigenvalue and eigenvector
- PageRank
- Power method
- Weighted least squares problem