Advanced Search
Article Contents
Article Contents

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

Abstract Related Papers Cited by
  • Without imposing any restriction on the damping factors and the stopping tolerances, we prove the overall convergence of the inner-outer iteration method for computing the PageRank vector, which was proposed by Gleich, Gray, Greif and Lau (SIAM J. Sci. Comput. 32(2010)349-371). Based on the formula of the contraction factor of the method, we discuss possible choices of the iteration parameters, which could be practically useful for accelerating the convergence rate of the inner-outer iteration method.
    Mathematics Subject Classification: Primary: 65F10, 65F15; Secondary: 65C40.


    \begin{equation} \\ \end{equation}
  • [1]

    Z. -Z. Bai, J. -C. Sun and D. -R. Wang, A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations, Computers Math. Appl., 32 (1996), 51-76.doi: 10.1016/S0898-1221(96)00207-6.


    P. Berkhin, A survey on PageRank computing, Internet Math., 2 (2005), 73-120.doi: 10.1080/15427951.2005.10129098.


    A. N. Langville and C. D. Meyer, A survey of eigenvector methods for Web information retrieval, SIAM Rev., 47 (2005), 135-161.doi: 10.1137/S0036144503424786.


    L. Page, S. Brin, R. Motwani and T. Winograd, "The PageRank Citation Ranking: Bringing Order to the Web," Stanford Digital Libraries SIDL-WP-1999-0120, Stanford, 1999.


    D. F. Gleich, A. P. Gray, C. Greif and T. Lau, An inner-outer iteration for computing PageRank, SIAM J. Sci. Comput., 32 (2010), 349-371.doi: 10.1137/080727397.


    J. -F. Yin, G. -J. Yin and M. K. Ng, On adaptively accelerated Arnoldi method for computing PageRank, Numer. Linear Algebra Appl., 19 (2012), 73-85.doi: 10.1002/nla.789.

  • 加载中

Article Metrics

HTML views() PDF downloads(112) Cited by(0)

Access History

Other Articles By Authors



    DownLoad:  Full-Size Img  PowerPoint