On adaptively accelerated Arnoldi method for computing PageRank

Jun Feng Yin, Guo Jian Yin, Kwok Po NG*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)

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 languageEnglish
Pages (from-to)73-85
Number of pages13
JournalNumerical Linear Algebra with Applications
Volume19
Issue number1
DOIs
Publication statusPublished - Jan 2012

Scopus Subject Areas

  • Algebra and Number Theory
  • Applied Mathematics

User-Defined Keywords

  • Arnoldi process
  • Eigenvalue and eigenvector
  • PageRank
  • Power method
  • Weighted least squares problem

Fingerprint

Dive into the research topics of 'On adaptively accelerated Arnoldi method for computing PageRank'. Together they form a unique fingerprint.

Cite this