Off-diagonal low-rank preconditioner for difficult PageRank problems
From MaRDI portal
Publication:1624665
DOI10.1016/j.cam.2018.07.015zbMath1402.65028OpenAlexW2883327543WikidataQ129457057 ScholiaQ129457057MaRDI QIDQ1624665
Xian-Ming Gu, Zhao-Li Shen, Chun Wen, Ting-Zhu Huang, Bruno Carpentieri, Xue-Yuan Tan
Publication date: 16 November 2018
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://pure.rug.nl/ws/files/103307690/1_s2.0_S0377042718304357_main.pdf
Searching and sorting (68P10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)
Related Items
Acceleration of the generalized FOM algorithm for computing PageRank, A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank, On randomized partial block Kaczmarz method for solving huge linear algebraic systems, 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, Parametric controllability of the personalized PageRank: Classic model vs biplex approach, The coupled iteration algorithms for computing PageRank
Uses Software
Cites Work
- A new extrapolation method for PageRank computations
- An explicit formula for the inverse of a pentadiagonal Toeplitz matrix
- 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
- An Arnoldi-extrapolation algorithm for computing pagerank
- A lower bound for the smallest singular value of a matrix
- Adaptive methods for the computation of PageRank
- An efficient elimination strategy for solving PageRank problems
- Preconditioning techniques for large linear systems: A survey
- A preconditioned and extrapolation-accelerated GMRES method for pagerank
- Comparison of Krylov subspace methods on the PageRank problem
- PageRank Beyond the Web
- The university of Florida sparse matrix collection
- An Inner-Outer Iteration for Computing PageRank
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Updating the Inverse of a Matrix
- A Preconditioned and Shifted GMRES Algorithm for the PageRank Problem with Multiple Damping Factors
- A Reordering for the PageRank Problem
- A Survey on PageRank Computing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
