PageRank computation with MAAOR and lumping methods
From MaRDI portal
Publication:1993371
Recommendations
- An extrapolation iteration and its lumped type iteration for computing PageRank
- PageRank problem, survey and future research directions
- On computing PageRank via lumping the Google matrix
- The PageRank model of minimal irreducible adjustment and its lumping method
- On accelerating the PageRank computation
Cites work
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- A Reordering for the PageRank Problem
- A preconditioned and shifted GMRES algorithm for the PageRank problem with multiple damping factors
- Accelerated Overrelaxation Method
- Algorithms and Models for the Web-Graph
- Convergence of Matrix Iterations Subject to Diagonal Dominance
- Fast PageRank Computation via a Sparse Linear System
- Google's PageRank and beyond. The science of search engine rankings
- Matrix computations.
- On computing PageRank via lumping the Google matrix
- On the convergence of the generalized AOR method
- On the solution of the linear complementarity problem by the generalized accelerated overrelaxation iterative method
- PageRank Computation, with Special Attention to Dangling Nodes
- The PageRank Vector: Properties, Computation, Approximation, and Acceleration
- The matrix analogue of the scalar AOR iterative method
Cited in
(4)
This page was built for publication: PageRank computation with MAAOR and lumping methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1993371)