A GMRES-Power algorithm for computing PageRank problems

被引:16
作者
Gu, Chuanqing [1 ]
Jiang, Xianglong [1 ]
Shao, Chenchen [1 ]
Chen, Zhibing [2 ]
机构
[1] Shanghai Univ, Dept Math, Shanghai 200444, Peoples R China
[2] Shenzhen Univ, Sch Math & Stat, Shenzhen 518052, Peoples R China
关键词
pageRank; GMRES algorithm; Power method; GMRES-Power; MATRIX SPLITTING ITERATION;
D O I
10.1016/j.cam.2018.03.017
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The PageRank algorithm for determining the importance of Web pages has become a central technique in Web search. we propose a new method to speed up the convergence performance for computing PageRank when the damping factor is close to one, called as GMRES-Power, which is based on a periodic combination of the power method with the GMRES algorithm. The description and convergence analysis of the new algorithm are discussed in detail. Numerical results are reported to confirm the efficiency of the new algorithm. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:113 / 123
页数:11
相关论文
共 22 条
[1]  
[Anonymous], 1992, Numerical Methods for Large Eigenvalue Problems
[2]  
[Anonymous], [No title captured]
[3]   ON CONVERGENCE OF THE INNER-OUTER ITERATION METHOD FOR COMPUTING PAGERANK [J].
Bai, Zhong-Zhi .
NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION, 2012, 2 (04) :855-862
[4]   AN INNER-OUTER ITERATION FOR COMPUTING PAGERANK [J].
Gleich, David F. ;
Gray, Andrew P. ;
Greif, Chen ;
Lau, Tracy .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2010, 32 (01) :349-371
[5]   An Arnoldi-type algorithm for computing page rank [J].
Golub, G. H. ;
Greif, C. .
BIT NUMERICAL MATHEMATICS, 2006, 46 (04) :759-771
[6]  
GOLUB H., 2013, Matrix Computations
[7]   An Arnoldi-Inout algorithm for computing PageRank problems [J].
Gu, Chuanqing ;
Wang, Wenwen .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2017, 309 :219-229
[8]   A two-step matrix splitting iteration for computing PageRank [J].
Gu, Chuanqing ;
Xie, Fei ;
Zhang, Ke .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2015, 278 :19-28
[9]  
Haveliwala T., 2003, P 12 INT WORLD WID W
[10]   Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems [J].
Jia, ZX .
LINEAR ALGEBRA AND ITS APPLICATIONS, 1997, 259 :1-23