Jump to Content
Your Recent History
View Cart
Logged Out Log In
SIAM J. Sci. Comput. 32, pp. 349-371 (23 pages)
An Inner-Outer Iteration for Computing PageRank
Alerts
Alert Me When Cited
Alert Me When Corrected
Tools
Download Citation
Add to MyScitation
Blog This Article
Print-Friendly
Research Toolkit
Share
Email Abstract
Connotea
CiteULike
del.icio.us
BibSonomy
Tweet this Article
Add to FacebookWe present a new iterative scheme for PageRank computation. The algorithm is applied to the linear system formulation of the problem, using inner-outer stationary iterations. It is simple, can be easily implemented and parallelized, and requires minimal storage overhead. Our convergence analysis shows that the algorithm is effective for a crude inner tolerance and is not sensitive to the choice of the parameters involved. The same idea can be used as a preconditioning technique for nonstationary schemes. Numerical examples featuring matrices of dimensions exceeding 100,000,000 in sequential and parallel environments demonstrate the merits of our technique. Our code is available online for viewing and testing, along with several large scale examples.
© 2010 Society for Industrial and Applied Mathematics
RELATED DATABASES
To view database links for this article,
you need to log in.
KEYWORDS
PUBLICATION DATA
ARTICLE DATA
History
Received June 15, 2008
Accepted June 05, 2009
Published online February 05, 2010
Accepted June 05, 2009
Published online February 05, 2010
Digital Object Identifier
For access to fully linked references, you need to log in.
For access to citing articles, you need to log in.
ALL SIAM Content
Scitation
Google Scholar