A variant of the Power-Arnoldi algorithm for computing PageRank
From MaRDI portal
Publication:2195926
DOI10.1016/j.cam.2020.113034zbMath1452.65068OpenAlexW3033977959MaRDI QIDQ2195926
Ting-Zhu Huang, Chun Wen, Zhao-Li Shen, Qian-Ying Hu, Xian-Ming Gu
Publication date: 28 August 2020
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.2020.113034
Related Items (10)
Acceleration of the generalized FOM algorithm for computing PageRank ⋮ Acceleration of an adaptive generalized Arnoldi method for computing PageRank ⋮ 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 ⋮ Optimal secret share distribution in degree splitting communication networks ⋮ Distributed PageRank computation with improved round complexities ⋮ A simple extrapolation method for clustered eigenvalues ⋮ An extrapolation iteration and its lumped type iteration for computing PageRank ⋮ The coupled iteration algorithms for computing PageRank
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- A note on the two-step matrix splitting iteration for computing PageRank
- An Arnoldi-type algorithm for computing Page Rank
- FOM accelerated by an extrapolation method for solving PageRank problems
- 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 GMRES-power algorithm for computing PageRank problems
- An efficient elimination strategy for solving PageRank problems
- On convergence of the inner-outer iteration method for computing Pagerank
- The general inner-outer iteration method based on regular splittings for the PageRank problem
- A preprocessed multi-step splitting iteration for computing PageRank
- A preconditioned and extrapolation-accelerated GMRES method for pagerank
- A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
- On the multi-splitting iteration method for computing PageRank
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- An Inner-Outer Iteration for Computing PageRank
- A Power–Arnoldi algorithm for computing PageRank
- The PageRank Vector: Properties, Computation, Approximation, and Acceleration
- Matrix Analysis
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Numerical Methods in Markov Chain Modeling
- Deeper Inside PageRank
- On adaptively accelerated Arnoldi method for computing PageRank
- A Survey of Eigenvector Methods for Web Information Retrieval
- A Reordering for the PageRank Problem
- A Survey on PageRank Computing
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
This page was built for publication: A variant of the Power-Arnoldi algorithm for computing PageRank
