An Arnoldi-Inout algorithm for computing PageRank problems

摘要

The PageRank algorithm plays an important role in the web search engines. To speed up the convergence behavior for computing PageRank, we propose a new method, called as Arnoldi-Inout, which is the inner–outer iteration method modified with the thick restarted Arnoldi method. The description and convergence of the new algorithm are discussed in detail. Numerical results are given to illustrate the efficiency of the new algorithm.