An efficient elimination strategy for solving PageRank problems
From MaRDI portal
Publication:1735084
DOI10.1016/j.amc.2016.10.031zbMath1411.65053OpenAlexW2549877740MaRDI QIDQ1735084
Xian-Ming Gu, Ting-Zhu Huang, Bruno Carpentieri, Chun Wen, Zhao-Li Shen
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
Computational methods for sparse matrices (65F50) Numerical analysis or methods applied to Markov chains (65C40) Iterative numerical methods for linear systems (65F10)
Related Items (16)
Acceleration of the generalized FOM algorithm for computing PageRank ⋮ Off-diagonal low-rank preconditioner for difficult PageRank problems ⋮ A simpler GMRES algorithm accelerated by Chebyshev polynomials 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 variant of the Power-Arnoldi algorithm for computing PageRank ⋮ Distributed PageRank computation with improved round complexities ⋮ 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 ⋮ Multipreconditioned GMRES for simulating stochastic automata networks ⋮ Schur complement-based infinity norm bounds for the inverse of SDD matrices ⋮ The general inner-outer iteration method based on regular splittings for the PageRank problem ⋮ Adaptive nonnegative matrix factorization and measure comparisons for recommender systems ⋮ On the spectrum of two-layer approach and multiplex PageRank ⋮ The coupled iteration algorithms for computing PageRank
Uses Software
Cites Work
- The extrapolation-accelerated multilevel aggregation method in PageRank computation
- FOM accelerated by an extrapolation method for solving PageRank problems
- A lower bound for the smallest singular value of a matrix
- A preconditioned conjugate gradient algorithm for GeneRank with application to microarray data mining
- Comparison of Krylov subspace methods on the PageRank problem
- PageRank Beyond the Web
- A general approach to analyse preconditioners for two-by-two block matrices
- The university of Florida sparse matrix collection
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Iterative Solution Methods
- A Preconditioned and Shifted GMRES Algorithm for the PageRank Problem with Multiple Damping Factors
- A Reordering for the PageRank Problem
This page was built for publication: An efficient elimination strategy for solving PageRank problems
