Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
