Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4637807 | Journal of Computational and Applied Mathematics | 2017 | 11 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Chuanqing Gu, Wenwen Wang,