Several relaxed iteration methods for computing PageRank

DOI10.1016/J.CAM.2020.113295MaRDI QIDQ2223865zbMATH OpenOpenAlexFDO

Authors Yan Zhang, Junxin Wang, Chuanqing Gu, Zhao Lu Tian

Publication date 3 February 2021

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2020.113295

zbMATH Keywords

matrix splittingconvergence analysisinner-outer iterationPageRank problem

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• A relaxed two-step splitting iteration method for computing PageRank
• On the multi-splitting iteration method for computing PageRank
• A note on the two-step matrix splitting iteration for computing PageRank
• A generalized two-step splitting iterative method modified with the multi-step power method for computing PageRank
• On a generalized two-stage iterative method for computing PageRank

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 Survey on PageRank Computing
• A general multi-splitting iteration method for computing PageRank
• 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 unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
• Accelerated Overrelaxation Method
• An Arnoldi-Inout algorithm for computing PageRank problems
• An efficient elimination strategy for solving PageRank problems
• An inner-outer iteration for computing PageRank
• Deeper Inside PageRank
• Google's PageRank and beyond. The science of search engine rankings
• On convergence of the inner-outer iteration method for computing Pagerank
• On the convergence of the MAOR method
• On the multi-splitting iteration method for computing PageRank
• Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
• The general inner-outer iteration method based on regular splittings for the PageRank problem
• The modified matrix splitting iteration method for computing PageRank problem

Cited in

(9)

• Secure fast evaluation of iterative methods: with an application to secure PageRank
• An adaptive reordered method for computing PageRank
• The coupled iteration algorithms for computing PageRank
• Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
• Acceleration of the generalized FOM algorithm for computing PageRank
• An extrapolation iteration and its lumped type iteration for computing PageRank
• A relaxed two-step splitting iteration method for computing PageRank
• On a generalized two-stage iterative method for computing PageRank
• Extrapolation methods for PageRank computations

This page was built for publication: Several relaxed iteration methods for computing PageRank

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