Parallel multisplitting iteration methods based on M-splitting for the PageRank problem

Na Huang and Chang-Feng Ma

Applied Mathematics and Computation, 2015, vol. 271, issue C, 337-343

Abstract: A class of iterative schemes based on the regular splitting is proposed for PageRank computation. By some specific splitting, these methods will reduce to some well-known iterative schemes, like Jacobi method and successive overrelaxation method. To suit computational requirements of the modern high-speed multiprocessor environments, we further study synchronous parallel counterparts for the new splitting iteration methods. By using the M-splitting of the coefficient matrix, we establish the convergence theory of these synchronous multisplitting iteration methods. Finally, some numerical experiments are presented to illustrate the feasibility, stability and effectiveness of the proposed algorithms.

Keywords: PageRank; Linear systems; Regular splitting; M-splitting; Iteration method (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315012345
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:271:y:2015:i:c:p:337-343

DOI: 10.1016/j.amc.2015.09.016

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