On convergence of the inner-outer iteration method for computing Pagerank
From MaRDI portal
Publication:1940968
DOI10.3934/naco.2012.2.855zbMath1264.65041OpenAlexW2333977424MaRDI QIDQ1940968
Publication date: 11 March 2013
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/naco.2012.2.855
Searching and sorting (68P10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical analysis or methods applied to Markov chains (65C40) Iterative numerical methods for linear systems (65F10)
Related Items
Acceleration of the generalized FOM algorithm for computing PageRank ⋮ A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank ⋮ A GMRES-power algorithm for computing PageRank problems ⋮ A relaxed two-step splitting iteration method for computing PageRank ⋮ The modified matrix splitting iteration method for computing PageRank problem ⋮ An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration 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 two-step 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 ⋮ A general multi-splitting iteration method for computing PageRank ⋮ A preprocessed multi-step splitting iteration for computing PageRank
