
doi: 10.1002/nla.789
SUMMARYA 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. Copyright © 2011 John Wiley & Sons, Ltd.
Numerical computation of eigenvalues and eigenvectors of matrices, PageRank, Computational methods for sparse matrices, convergence, weighted least squares problem, eigenvalue problem, Arnoldi process, numerical results, Searching and sorting, power method
Numerical computation of eigenvalues and eigenvectors of matrices, PageRank, Computational methods for sparse matrices, convergence, weighted least squares problem, eigenvalue problem, Arnoldi process, numerical results, Searching and sorting, power method
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 22 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
