A preprocessed multi-step splitting iteration for computing PageRank

Chuanqing Gu, Xianglong Jiang, Ying Nie and Zhibing Chen

Applied Mathematics and Computation, 2018, vol. 338, issue C, 87-100

Abstract: The PageRank algorithm plays an important role in determining the importance of Web pages. The multi-step splitting iteration (MSPI) method for calculating the Pagerank problem is an iterative framework of combining the multi-step classical power method with the inner-outer method. In this paper, we present a preprocessed MSPI method called the Arnoldi-MSPI iteration, which is the MSPI method modified with the thick restarted Arnoldi algorithm. The implementation and convergence of the new method are discussed in detail. Numerical experiments are given to show that our method has a good computational effect when the damping factor is close to 1.

Keywords: PageRank; Two-step iteration; Multi-step splitting method; Preprocessed multi-step splitting method; Thick restarted Arnoldi algorithm (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318304429
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:338:y:2018:i:c:p:87-100

DOI: 10.1016/j.amc.2018.05.033

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().