PageRank computation with MAAOR and lumping methods

DOI10.1007/s11786-018-0335-7zbMath1453.65077OpenAlexW2793682714MaRDI QIDQ1993371

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

zbMATH Keywords

sparse matriceslumpinglinear system computationweb matrix

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (2)

A multi-power and multi-splitting inner-outer iteration for PageRank computation ⋮ An extrapolation iteration and its lumped type iteration for computing PageRank

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• The matrix analogue of the scalar AOR iterative method
• The PageRank Vector: Properties, Computation, Approximation, and Acceleration
• PageRank Computation, with Special Attention to Dangling Nodes
• Accelerated Overrelaxation Method
• A Preconditioned and Shifted GMRES Algorithm for the PageRank Problem with Multiple Damping Factors
• Algorithms and Models for the Web-Graph
• A Reordering for the PageRank Problem
• Fast PageRank Computation via a Sparse Linear System
• Convergence of Matrix Iterations Subject to Diagonal Dominance

This page was built for publication: PageRank computation with MAAOR and lumping methods