A note on the two-step matrix splitting iteration for computing PageRank
详细信息 查看全文
- 作者：Chun Wen ; wchun17@163.com ; Ting-Zhu Huang tingzhuhuang@126.com ; Zhao-Li Shen z.shen@rug.nl
- 关键词：65F10 ; 65F15
- 刊名：Journal of Computational and Applied Mathematics
- 出版年：2017
- 出版时间：1 May 2017
- 年：2017
- 卷：315
- 期：Complete
- 页码：87-97
- 全文大小：877 K
- 卷排序：315
文摘
Computing PageRank plays an important part in determining the importance of Web pages. Based on the classical power method and the inner–outer iteration proposed by Gleich et al. (2010), Gu et al. (2015) presented a two-step splitting iteration, i.e., the power-inner–outer (PIO) iteration, for the computation of PageRank. In this paper, we develop a variant of the PIO iteration by applying multi-step power method to combine with the inner–outer iteration. The new method is denoted as the MPIO iteration, its convergence is analyzed in detail. Numerical experiments on several PageRank problems are used to illustrate the effectiveness of the MPIO iteration.