A note on the two-step matrix splitting iteration for computing PageRank
From MaRDI portal
Publication:729852
DOI10.1016/j.cam.2016.10.020zbMath1354.65068OpenAlexW2550303287MaRDI QIDQ729852
Zhao-Li Shen, Ting-Zhu Huang, Chun Wen
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
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)
Related Items (18)
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 ⋮ A GMRES-power algorithm for computing PageRank problems ⋮ The modified matrix splitting iteration method for computing PageRank problem ⋮ Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors ⋮ A multi-step Smith-inner-outer iteration algorithm for solving coupled continuous Markovian jump Lyapunov matrix equations ⋮ An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank ⋮ 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 ⋮ Multipreconditioned GMRES for simulating stochastic automata networks ⋮ The general inner-outer iteration method based on regular splittings for the PageRank problem ⋮ On the spectrum of two-layer approach and multiplex PageRank ⋮ A general multi-splitting iteration method for computing PageRank ⋮ The coupled iteration algorithms for computing PageRank
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem
- A two-step matrix splitting iteration for computing PageRank
- An Arnoldi-type algorithm for computing Page Rank
- On computing PageRank via lumping the Google matrix
- Adaptive methods for the computation of PageRank
- A preconditioned and extrapolation-accelerated GMRES method for pagerank
- An Inner-Outer Iteration for Computing PageRank
- A Power–Arnoldi algorithm for computing PageRank
- PageRank Computation, with Special Attention to Dangling Nodes
- Ordinal Ranking for Google's PageRank
- Deeper Inside PageRank
- A Survey of Eigenvector Methods for Web Information Retrieval
This page was built for publication: A note on the two-step matrix splitting iteration for computing PageRank