An Arnoldi-Inout algorithm for computing PageRank problems

详细信息    查看全文

• 作者：Chuanqing Gu ; ^{cqgu@staff.shu.edu.cn" class="auth_mail" title="E-mail the corresponding author} ; Wenwen Wang
• 关键词：PageRank ; Inner&ndash ; outer iteration ; PIO iteration ; Thick restarted Arnoldi algorithm
• 刊名：Journal of Computational and Applied Mathematics
• 出版年：2017
• 出版时间：1 January 2017
• 年：2017
• 卷：309
• 期：Complete
• 页码：219-229
• 全文大小：604 K

文摘

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.