The general inner-outer iteration method based on regular splittings for the PageRank problem

Zhaolu Tian, Yong Liu, Yan Zhang, Zhongyun Liu and Maoyi Tian

Applied Mathematics and Computation, 2019, vol. 356, issue C, 479-501

Abstract: In this paper, combined the regular splittings of the coefficient matrix I−αP with the inner-outer iteration framework [9], a general inner-outer (GIO) iteration method is presented for solving the PageRank problem. Firstly, the AOR and modified AOR (MAOR) methods for solving the PageRank problem are constructed, and several comparison results are also given. Next, the GIO iteration scheme is developed, and its overall convergence is analyzed in detail. Furthermore, the preconditioner derived from the GIO iteration can be used to accelerate the Krylov subspace methods, such as GMRES method. Finally, some numerical experiments on several PageRank problems are provided to illustrate the efficiency of the proposed algorithm.

Keywords: PageRank; Inner-outer iteration; Regular splitting; Preconditioner; Convergence (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319301766
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:356:y:2019:i:c:p:479-501

DOI: 10.1016/j.amc.2019.02.066

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 ().