| 一种求解高阻尼PageRank问题的加权块Arnoldi算法 |
| |
| 引用本文： | 袁梅. 一种求解高阻尼PageRank问题的加权块Arnoldi算法[J]. 徐州师范大学学报(自然科学版), 2012, 30(4): 50-55 |
| |
| 作者姓名： | 袁梅 |
| |
| 作者单位： | 江苏师范大学数学与统计学院,江苏徐州,221116 |
| |
| 基金项目： | 国家自然科学基金资助项目，徐州师范大学校研究生科研课题立项 |
| |
| 摘 要： | 提出了一种加权块Arnoldi方法求解PageRank问题．为了加快算法的收敛速度，采用子空间迭代法作为加速策略．数值实验结果表明，当阻尼因子。靠近1时，提出的加速加权块Arnoldi算法比现有的一些Krylov子空间方法优越．
|
| 关 键 词： | Google PageRank Arnoldi 块Arnoldi Krylov子空间 |
A weighted block Arnoldi method for solving PageRank problem with high damping factors |
| |
| Yuan Mei. A weighted block Arnoldi method for solving PageRank problem with high damping factors[J]. Journal of Xuzhou Normal University(Natural Science Edition), 2012, 30(4): 50-55 |
| |
| Authors: | Yuan Mei |
| |
| Affiliation: | Yuan Mei(School of Mathematics & Statistics,Jiangsu Normal University,Xuzhou 221116,Jiangsu,China) |
| |
| Abstract: | In this paper, a weighted block Arnoldi method for solving PageRank problem with high damping factors is proposed. To improve the convergence performance of this algorithm, the subspace iteration method is adopted. Numerical experiment shows that the new algorithm is superior to many state-of-art Krylov subspace methods for PageRank problem, especially when the damping factor is close to 1. |
| |
| Keywords: | Google PageRank Arnoldi block Arnoldi Krylov subspace |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
