A multi-power and multi-splitting inner-outer iteration for PageRank computation
From MaRDI portal
Publication:2053558
DOI10.1515/math-2020-0120zbMath1475.65019OpenAlexW3124338227MaRDI QIDQ2053558
Bing-Yuan Pu, Chun Wen, Qian-Ying Hu
Publication date: 29 November 2021
Published in: Open Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/math-2020-0120
Searching and sorting (68P10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
- Unnamed Item
- An Arnoldi-Inout algorithm for computing PageRank problems
- A new extrapolation method for PageRank computations
- A two-step matrix splitting iteration for computing PageRank
- Vector extrapolation methods with applications to solution of large systems of equations and to PageRank computations
- An Arnoldi-extrapolation algorithm for computing pagerank
- On computing PageRank via lumping the Google matrix
- Adaptive methods for the computation of PageRank
- A relaxed two-step splitting iteration method for computing PageRank
- On convergence of the inner-outer iteration method for computing Pagerank
- PageRank computation with MAAOR and lumping methods
- The general inner-outer iteration method based on regular splittings for the PageRank problem
- A preconditioned and extrapolation-accelerated GMRES method for pagerank
- An Inner-Outer Iteration for Computing PageRank
- Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking
- Ordinal Ranking for Google's PageRank
- Deeper Inside PageRank
- A Survey on PageRank Computing
This page was built for publication: A multi-power and multi-splitting inner-outer iteration for PageRank computation
