On accelerating the PageRank computation

Abstract

In this paper we consider the problem of computing the PageRank vector in an efficient way. By combining some of the existing techniques and different approaches, including the power method, linear systems, iterative aggregation/disaggregation, and matrix reorderings, we propose algorithms that decrease the number of iterations to reach the desired solution, thus accelerating convergence to the vector that contains the importance of web pages.

Department(s)

Mathematics

Document Type

Article

DOI

https://doi.org/10.1080/15427951.2009.10129182

Publication Date

1-1-2009

Journal Title

Internet Mathematics

Link to Full Text

Share

COinS