ON CONVERGENCE OF THE INNER-OUTER ITERATION METHOD FOR COMPUTING PAGERANK

被引：20

作者：

Bai, Zhong-Zhi ^{[1
,2
]}

机构：

[1] Guizhou Normal Univ, Sch Math Comp & Sci, Guiyang 550001, Guizhou, Peoples R China

[2] Chinese Acad Sci, Acad Math & Syst Sci, State Key Lab Sci Engn Comp, Inst Comp Math & Sci Engn Comp, Beijing 100190, Peoples R China

来源：

NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION | 2012年 / 2卷 / 04期

关键词：

PageRank; inner-outer iteration; convergence;

D O I：

10.3934/naco.2012.2.855

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Without imposing any restriction on the damping factors and the stopping tolerances, we prove the overall convergence of the inner-outer it eration method for computing the PageRank vector, which was proposed by Gleich, Gray, Greif and Lau (SIAM J. Sci. Comput. 32(2010)349-371). Based on the formula of the contraction factor of the method, we discuss possible choices of the iteration parameters, which could be practically useful for accelerating the convergence rate of the inner-outer iteration method.

引用

页码：855 / 862

页数：8

共 6 条

[1]

[Anonymous], 1999, SIDLWP19990120

[2] A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations [J].