A preprocessed multi-step splitting iteration for computing PageRank
DOI10.1016/j.amc.2018.05.033zbMath1427.65046OpenAlexW2811510744MaRDI QIDQ2335735
Chuanqing Gu, Zhibing Chen, Ying Nie, Xiang-Long Jiang
Publication date: 15 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.05.033
PageRankthick restarted Arnoldi algorithmtwo-step iterationmulti-step splitting methodpreprocessed multi-step splitting method
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Internet topics (68M11)
Related Items (6)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A two-step matrix splitting iteration for computing PageRank
- On convergence of the inner-outer iteration method for computing Pagerank
- A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
- PageRank Beyond the Web
- An Inner-Outer Iteration for Computing PageRank
- Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
- A Power–Arnoldi algorithm for computing PageRank
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
This page was built for publication: A preprocessed multi-step splitting iteration for computing PageRank