A general multi-splitting iteration method for computing PageRank
From MaRDI portal
Publication:2322449
DOI10.1007/s40314-019-0830-8zbMath1438.65068OpenAlexW2921642051MaRDI QIDQ2322449
Maoyi Tian, Yan Zhang, Yudong Wang, Zhao Lu Tian
Publication date: 4 September 2019
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-019-0830-8
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Related Items (4)
Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors ⋮ Several relaxed iteration methods for computing PageRank ⋮ An extrapolation iteration and its lumped type iteration for computing PageRank ⋮ The coupled iteration algorithms for computing PageRank
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
- Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem
- A two-step matrix splitting iteration for computing PageRank
- A unified framework for the construction of various matrix multisplitting iterative methods for large sparse system of linear equations
- A note on the two-step matrix splitting iteration for computing PageRank
- An Arnoldi-type algorithm for computing Page Rank
- An Arnoldi-extrapolation algorithm for computing pagerank
- On computing PageRank via lumping the Google matrix
- On the convergence of the MAOR method
- 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
- On convergence of the inner-outer iteration method 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
- An Inner-Outer Iteration for Computing PageRank
- Block s-step Krylov iterative methods
- A Power–Arnoldi algorithm for computing PageRank
- PageRank Computation, with Special Attention to Dangling Nodes
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Accelerated Overrelaxation Method
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- A Survey of Eigenvector Methods for Web Information Retrieval
- Paradoxical Effects in PageRank Incremental Computations
- Matrix Iterative Analysis
This page was built for publication: A general multi-splitting iteration method for computing PageRank
