PageRank computation with MAAOR and lumping methods
From MaRDI portal
Publication:1993371
DOI10.1007/S11786-018-0335-7zbMATH Open1453.65077OpenAlexW2793682714MaRDI QIDQ1993371FDOQ1993371
Authors: Yanyan Li 
Publication date: 5 November 2018
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-018-0335-7
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
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
- Title not available (Why is that?)
- Matrix computations.
- PageRank Computation, with Special Attention to Dangling Nodes
- Google's PageRank and beyond. The science of search engine rankings
- On computing PageRank via lumping the Google matrix
- On the convergence of the generalized AOR method
- Accelerated Overrelaxation Method
- Convergence of Matrix Iterations Subject to Diagonal Dominance
- On the solution of the linear complementarity problem by the generalized accelerated overrelaxation iterative method
- The matrix analogue of the scalar AOR iterative method
- The PageRank Vector: Properties, Computation, Approximation, and Acceleration
- A Reordering for the PageRank Problem
- A preconditioned and shifted GMRES algorithm for the PageRank problem with multiple damping factors
- Algorithms and Models for the Web-Graph
- Fast PageRank Computation via a Sparse Linear System
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)
