The coupled iteration algorithms for computing PageRank

DOI10.1007/S11075-021-01166-XzbMATH Open1485.65040OpenAlexW3196932851MaRDI QIDQ2118952FDOQ2118952

Authors: Yinghui Dong, Zhao Lu Tian, Zhongyun Liu 

Publication date: 23 March 2022

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-021-01166-x

Recommendations

• On a generalized two-stage iterative method for computing PageRank
• An inner-outer iteration for computing PageRank
• Several relaxed iteration methods for computing PageRank
• On the multi-splitting iteration method for computing PageRank
• A general multi-splitting iteration method for computing PageRank
• On convergence of the inner-outer iteration method for computing Pagerank
• A relaxed two-step splitting iteration method for computing PageRank
• An extrapolation iteration and its lumped type iteration for computing PageRank
• A Hessenberg-type algorithm for computing PageRank problems

zbMATH Keywords

convergencematrix splittingoptimal parameterPageRank problemcoupled iteration algorithm

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Deeper Inside PageRank
• Adaptive methods for the computation of PageRank
• Title not available (Why is that?)
• Title not available (Why is that?)
• On parameterized inexact Uzawa methods for generalized saddle point problems
• Google's PageRank and beyond. The science of search engine rankings
• A Survey on PageRank Computing
• Accelerated SOR-like method for augmented linear systems
• A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
• Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
• A variant of the Power-Arnoldi algorithm for computing PageRank
• An inner-outer iteration for computing PageRank
• An Arnoldi-Inout algorithm for computing PageRank problems
• A Power–Arnoldi algorithm for computing PageRank
• A two-step matrix splitting iteration for computing PageRank
• An Arnoldi-type algorithm for computing Page Rank
• An Arnoldi-extrapolation algorithm for computing pagerank
• On the convergence of the MAOR method
• Accelerated Overrelaxation Method
• The PageRank Vector: Properties, Computation, Approximation, and Acceleration
• Recent advances in bibliometric indexes and the PaperRank problem
• Towards Google matrix of brain
• Competitivity groups on social network sites
• Vector extrapolation methods with applications to solution of large systems of equations and to PageRank computations
• Several relaxed iteration methods for computing PageRank
• Paradoxical Effects in PageRank Incremental Computations
• A GMRES-power algorithm for computing PageRank problems
• The Jacobi and Gauss-Seidel-type iteration methods for the matrix equation \(A X B = C\)
• An efficient elimination strategy for solving PageRank problems
• A note on the two-step matrix splitting iteration for computing PageRank
• A relaxed two-step splitting iteration method for computing PageRank
• A general multi-splitting iteration method for computing PageRank
• A preprocessed multi-step splitting iteration for computing PageRank
• On the multi-splitting iteration method for computing PageRank
• The modified matrix splitting iteration method for computing PageRank problem
• Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
• Off-diagonal low-rank preconditioner for difficult PageRank problems
• The monotonicity of two-stage iterative methods
• The general inner-outer iteration method based on regular splittings for the PageRank problem
• Coupled iterative algorithms based on optimisation for solving Sylvester matrix equations

Cited In (7)

• Secure fast evaluation of iterative methods: with an application to secure PageRank
• A Hessenberg-type algorithm for computing PageRank problems
• Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
• On efficient randomized algorithms for finding the PageRank vector
• An extrapolation iteration and its lumped type iteration for computing PageRank
• Saddle point mirror descent algorithm for the robust PageRank problem
• A Two-Stage Algorithm for Computing PageRank and Multistage Generalizations

This page was built for publication: The coupled iteration algorithms for computing PageRank

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