摘要

The PageRank algorithm is one of the most commonly used techniques that determines the global importance of Web pages. In this paper, we present a preconditioned Arnoldi-Inout approach for the computation of Pagerank vector, which can take the advantage of both a new two-stage matrix splitting iteration and the Arnoldi process. The implementation and convergence of the new algorithm are discussed in detail. Numerical experiments are presented to illustrate the effectiveness of our approaches.