The coupled iteration algorithms for computing PageRank

DOI10.1007/S11075-021-01166-XMaRDI QIDQ2118952zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

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)