Open AccessThe modified matrix splitting iteration method for computing PageRank problem
Author(s) -
Zhaolu Tian,
Xiaoyan Liu,
Yudong Wang,
P.H. Wen
Publication year - 2019
Publication title -
filomat
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 34
eISSN - 2406-0933
pISSN - 0354-5180
DOI - 10.2298/fil1903725t
Subject(s) - power iteration , pagerank , convergence (economics) , mathematics , matrix (chemical analysis) , iterative method , fixed point iteration , mathematical optimization , preconditioner , matrix splitting , algorithm , computer science , symmetric matrix , theoretical computer science , fixed point , state transition matrix , mathematical analysis , eigenvalues and eigenvectors , physics , quantum mechanics , economics , composite material , economic growth , materials science
In this paper, based on the iteration methods [3,10], we propose a modified multi-step power-inner-outer (MMPIO) iteration method for solving the PageRank problem. In the MMPIO iteration method, we use the multi-step matrix splitting iterations instead of the power method, and combine with the inner-outer iteration [24]. The convergence of the MMPIO iteration method is analyzed in detail, and some comparison results are also given. Several numerical examples are presented to illustrate the effectiveness of the proposed algorithm.