Off-diagonal low-rank preconditioner for difficult PageRank problems
From MaRDI portal
Recommendations
- A preconditioning approach to the pagerank computation problem
- A preconditioned and extrapolation-accelerated GMRES method for pagerank
- An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank
- Regularization-based solution of the PageRank problem for large matrices
- Euler-Richardson method preconditioned by weakly stochastic matrix algebras: a potential contribution to PageRank computation
- A preconditioned and shifted GMRES algorithm for the PageRank problem with multiple damping factors
- Preconditioners for rank deficient least squares problems
- Comparison of Krylov subspace methods on the PageRank problem
- Preconditioned conjugate gradient method for rank deficient least-squares problems
- Algorithms and Models for the Web-Graph
Cites work
- A lower bound for the smallest singular value of a matrix
- A new extrapolation method for PageRank computations
- A note on the two-step matrix splitting iteration for computing PageRank
- A preconditioned and extrapolation-accelerated GMRES method for pagerank
- 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
- A two-step matrix splitting iteration for computing PageRank
- Adaptive methods for the computation of PageRank
- An Arnoldi-extrapolation algorithm for computing pagerank
- An Arnoldi-type algorithm for computing Page Rank
- An efficient elimination strategy for solving PageRank problems
- An explicit formula for the inverse of a pentadiagonal Toeplitz matrix
- An inner-outer iteration for computing PageRank
- Comparison of Krylov subspace methods on the PageRank problem
- Current trends in high performance computing and its applications. Proceedings of the international conference on high performance computing and applications, Shanghai, P. R. China, August 8--10, 2004.
- FOM accelerated by an extrapolation method for solving PageRank problems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Google's PageRank and beyond. The science of search engine rankings
- scientific article; zbMATH DE number 3002670 (Why is no real title available?)
- scientific article; zbMATH DE number 194908 (Why is no real title available?)
- PageRank beyond the web
- Preconditioning techniques for large linear systems: A survey
- The University of Florida sparse matrix collection
- Updating the Inverse of a Matrix
Cited in
(11)- An efficient elimination strategy for solving PageRank problems
- The coupled iteration algorithms for computing PageRank
- 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
- A preconditioned and extrapolation-accelerated GMRES method for 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
- A preconditioned and shifted GMRES algorithm for the PageRank problem with multiple damping factors
- Parametric controllability of the personalized PageRank: Classic model vs biplex approach
- Weak dangling block reordering and multi-step block compression for efficiently computing and updating PageRank solutions
This page was built for publication: Off-diagonal low-rank preconditioner for difficult PageRank problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1624665)
