On convergence of the inner-outer iteration method for computing Pagerank

DOI10.3934/NACO.2012.2.855MaRDI QIDQ1940968zbMATH OpenOpenAlexFDO

Authors Zhong-Zhi Bai

Publication date 11 March 2013

Published in Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/naco.2012.2.855

zbMATH Keywords

convergenceinner-outer iterationPagerank

Mathematics Subject Classification ID

Numerical analysis or methods applied to Markov chains (65C40) Iterative numerical methods for linear systems (65F10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Searching and sorting (68P10)

Review text

The author provides the convergence analysis of the Pagerank vector iteration proposed \textit{D. F. Gleich} et al. [SIAM J. Sci. Comput. 32, No. 1, 349--371 (2010; Zbl 1209.65043)], together with a detailed discussion on the choice of the iteration parameters.

Recommendations

• An inner-outer iteration for computing PageRank
• On a generalized two-stage iterative method for computing PageRank
• An inner-outer iteration method modified with multi-step power for computing PageRank
• A multi-power and multi-splitting inner-outer iteration for PageRank computation
• The general inner-outer iteration method based on regular splittings for the PageRank problem

Cited in

(23)

• A GMRES-power algorithm for computing PageRank problems
• A relaxed two-step splitting iteration method for computing PageRank
• An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank
• Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
• An iteration method for solving the linear system \(Ax=b\)
• The general inner-outer iteration method based on regular splittings for the PageRank problem
• A multi-power and multi-splitting inner-outer iteration for PageRank computation
• The coupled iteration algorithms for computing PageRank
• Acceleration of the generalized FOM algorithm for computing PageRank
• A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank
• A variant of the Power-Arnoldi algorithm for computing PageRank
• An adaptive Power-GArnoldi algorithm for computing PageRank
• Several relaxed iteration methods for computing PageRank
• A general multi-splitting iteration method for computing PageRank
• A preprocessed multi-step splitting iteration for computing PageRank
• On some analytical properties of a general PageRank algorithm
• An inner-outer iteration for computing PageRank
• A two-step matrix splitting iteration for computing PageRank
• Convergence of the fixed‐point iteration for multilinear PageRank
• The modified matrix splitting iteration method for computing PageRank problem
• On a generalized two-stage iterative method for computing PageRank
• Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
• Secure fast evaluation of iterative methods: with an application to secure PageRank

This page was built for publication: On convergence of the inner-outer iteration method for computing Pagerank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1940968)