A note on the two-step matrix splitting iteration for computing PageRank

DOI10.1016/J.CAM.2016.10.020MaRDI QIDQ729852zbMATH OpenOpenAlexFDO

Authors Chun Wen, Ting-Zhu Huang, Zhaoli Shen

Publication date 22 December 2016

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.2016.10.020

zbMATH Keywords

convergenceinner-outer methodPageRankpower method

Mathematics Subject Classification ID

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

Recommendations

• A two-step matrix splitting iteration for computing PageRank
• A relaxed two-step splitting iteration method for computing PageRank
• Two-splitting iteration method for computing higher-order PageRank
• On the multi-splitting iteration method for computing PageRank
• On a generalized two-stage iterative method for computing PageRank
• A general multi-splitting iteration method for computing PageRank
• An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank
• The modified matrix splitting iteration method for computing PageRank problem
• A preprocessed multi-step splitting iteration for computing PageRank
• A generalized two-step splitting iterative method modified with the multi-step power method for computing PageRank

Cites work

• A Power–Arnoldi algorithm for computing PageRank
• A preconditioned and extrapolation-accelerated GMRES method for pagerank
• A Survey of Eigenvector Methods for Web Information Retrieval
• A two-step matrix splitting iteration for computing PageRank
• Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem
• Adaptive methods for the computation of PageRank
• An Arnoldi-type algorithm for computing Page Rank
• An inner-outer iteration for computing PageRank
• Deeper Inside PageRank
• Google's PageRank and beyond. The science of search engine rankings
• scientific article; zbMATH DE number 734901 (Why is no real title available?)
• scientific article; zbMATH DE number 1460605 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• On computing PageRank via lumping the Google matrix
• Ordinal Ranking for Google's PageRank
• PageRank Computation, with Special Attention to Dangling Nodes
• Probability and random processes.

Cited in

(27)

• Off-diagonal low-rank preconditioner for difficult PageRank problems
• A GMRES-power algorithm for computing PageRank problems
• A relaxed two-step splitting iteration method for computing PageRank
• An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank
• Multipreconditioned GMRES for simulating stochastic automata networks
• The general inner-outer iteration method based on regular splittings for the PageRank problem
• The coupled iteration algorithms for computing PageRank
• Acceleration of the generalized FOM algorithm for computing PageRank
• A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank
• A multi-step Smith-inner-outer iteration algorithm for solving coupled continuous Markovian jump Lyapunov matrix equations
• A variant of the Power-Arnoldi algorithm for computing PageRank
• Block-accelerated aggregation multigrid for Markov chains with application to PageRank problems
• Non-backtracking PageRank: from the classic model to Hashimoto matrices
• An adaptive Power-GArnoldi algorithm for computing PageRank
• Several relaxed iteration methods for computing PageRank
• A general multi-splitting iteration method for computing PageRank
• On the multi-splitting iteration method for computing PageRank
• Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors
• An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank
• A two-step matrix splitting iteration for computing PageRank
• The modified matrix splitting iteration method for computing PageRank problem
• Two-splitting iteration method for computing higher-order PageRank
• An inner-outer iteration method modified with multi-step power for computing PageRank
• A Two-Stage Algorithm for Computing PageRank and Multistage Generalizations
• The MFPIO iteration and the FPMPE method for multilinear PageRank computations
• Weak dangling block reordering and multi-step block compression for efficiently computing and updating PageRank solutions
• On the spectrum of two-layer approach and multiplex PageRank

This page was built for publication: A note on the two-step matrix splitting iteration for computing PageRank

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