An efficient elimination strategy for solving PageRank problems

DOI10.1016/J.AMC.2016.10.031MaRDI QIDQ1735084zbMATH OpenOpenAlexFDO

Authors Zhaoli Shen, Ting-Zhu Huang, Bruno Carpentieri, Xian-Ming Gu, Chun Wen

Publication date 28 March 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2016.10.031

zbMATH Keywords

sparsityiterative methodsspectral distributionPageRankelimination strategyrow patterns

Mathematics Subject Classification ID

Numerical analysis or methods applied to Markov chains (65C40) Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)

Recommendations

• An improved approach to the PageRank problems
• Fast PageRank Computation via a Sparse Linear System
• A Hessenberg-type algorithm for computing PageRank problems
• Off-diagonal low-rank preconditioner for difficult PageRank problems
• Algorithms and Models for the Web-Graph

Cites work

• A Reordering for the PageRank Problem
• A general approach to analyse preconditioners for two-by-two block matrices.
• A lower bound for the smallest singular value of a matrix
• A preconditioned and shifted GMRES algorithm for the PageRank problem with multiple damping factors
• A preconditioned conjugate gradient algorithm for GeneRank with application to microarray data mining
• Comparison of Krylov subspace methods on the PageRank problem
• FOM accelerated by an extrapolation method for solving PageRank problems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Iterative Solution Methods
• PageRank beyond the web
• The University of Florida sparse matrix collection
• The extrapolation-accelerated multilevel aggregation method in PageRank computation

Cited in

(17)

• The coupled iteration algorithms for computing PageRank
• Multipreconditioned GMRES for simulating stochastic automata networks
• Schur complement-based infinity norm bounds for the inverse of SDD matrices
• An adaptive Power-GArnoldi algorithm for computing PageRank
• Several relaxed iteration methods for computing PageRank
• Off-diagonal low-rank preconditioner for difficult PageRank problems
• The general inner-outer iteration method based on regular splittings for the PageRank problem
• Adaptive nonnegative matrix factorization and measure comparisons for recommender systems
• Acceleration of the generalized FOM algorithm for computing PageRank
• On the spectrum of two-layer approach and multiplex PageRank
• Non-backtracking PageRank: from the classic model to Hashimoto matrices
• Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors
• A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank
• An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank
• Distributed PageRank computation with improved round complexities
• A variant of the Power-Arnoldi algorithm for computing PageRank
• Weak dangling block reordering and multi-step block compression for efficiently computing and updating PageRank solutions

Describes a project that uses

Uses Software

• WebGraph
• UbiCrawler
• ILUPACK
• SparseMatrix

This page was built for publication: An efficient elimination strategy for solving PageRank problems

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