全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
计算数学  2014 

关于PageRank的广义二级分裂迭代方法

, PP. 427-436

Keywords: PageRank,内/外迭代方法,特征值,收敛性

Full-Text   Cite this paper   Add to My Lib

Abstract:

本文研究计算PageRank的迭代法,在Gleich等人提出的内/外迭代方法的基础上,提出了具有三个参数的广义二级分裂迭代法,该方法包含了内/外迭代法和幂迭代法,并研究了该方法的收敛性.基于该方法的收缩因子的计算公式,讨论了迭代参数可能的选择,通过参数的选择能有效提高内/外迭代法的收敛效率.

References

[1]  Bai Z Z, Sun J C and Wang D R. A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations[J]. Comput. Math. Appl., 1996, 32(12): 51-76.
[2]  Berkhin P. A survey on PageRank computing[J]. Int. Math., 2005, 2(1): 73-120.
[3]  Langville A N and Meyer C D. A survey of eigenvector methods for Web information retrieval[J]. SIAM Rev., 2005, 47(1): 135-161.
[4]  Page L, Brin S, Motwani R and Winograd T. "The PageRank Citation Ranking: Bringing Order to the Web," Stanford Digital Libraries SIDL-WP-1999-0120, Stanford, 1999.
[5]  Gleich D F, Gray A P, Greif C and Lau T. An inner-outer iteration for computing PageRank[J]. SIAM J. Sci. Comput., 2010, 32(1): 349-371.
[6]  Yin J F, Yin G J and Ng M K. On adaptively accelerated Arnoldi method for computing PageRank[J]. Numer. Lin. Alge. Appl., 2012, 19(1): 73-85.
[7]  Bai Z Z. On convergence of the inner-outer iteration method for computing PageRank[J]. Numer. Alge. Cont. Optim., 2012, 2(4): 855-862.
[8]  Brauer A. Limits for the characteristic roots of a matrix. IV: applications to stochastic matrices[J]. Duke Math. J., 1952, 19: 75-91.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133