A relaxed two-step splitting iteration method for computing PageRank
From MaRDI portal
Publication:1655370
DOI10.1007/s40314-016-0338-4zbMath1397.65053OpenAlexW2341787873MaRDI QIDQ1655370
Publication date: 9 August 2018
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-016-0338-4
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors ⋮ Several relaxed iteration methods for computing PageRank ⋮ A multi-power and multi-splitting inner-outer iteration for PageRank computation ⋮ The coupled iteration algorithms for computing PageRank
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A two-step matrix splitting iteration for computing PageRank
- Some techniques for solving absolute value equations
- A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
- An Arnoldi-type algorithm for computing Page Rank
- Absolute value equations
- Absolute value programming
- Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
- Adaptive methods for the computation of PageRank
- Parallel multisplitting iteration methods based on M-splitting for the PageRank problem
- An algorithm for computing all solutions of an absolute value equation
- On convergence of the inner-outer iteration method for computing Pagerank
- Complementary pivot theory of mathematical programming
- An Inner-Outer Iteration for Computing PageRank
- A Power–Arnoldi algorithm for computing PageRank
- Distributed Algorithms for Finding Local Clusters Using Heat Kernel Pagerank
- Block Triangular and Skew-Hermitian Splitting Methods for Positive-Definite Linear Systems
- On adaptively accelerated Arnoldi method for computing PageRank
- A Survey of Eigenvector Methods for Web Information Retrieval
- A Reordering for the PageRank Problem
- Jordan Canonical Form of the Google Matrix: A Potential Contribution to the PageRank Computation
- A Survey on PageRank Computing
This page was built for publication: A relaxed two-step splitting iteration method for computing PageRank