A new extrapolation method for PageRank computations

DOI10.1016/j.cam.2016.08.034zbMath1353.65028OpenAlexW2528025091MaRDI QIDQ344287

Xue-Yuan Tan

Publication date: 22 November 2016

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2016.08.034

zbMATH Keywords

convergencenumerical examplestraceiterative methodextrapolation methodpower methodArnoldi-type algorithmPageRank algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items (17)

Acceleration of the generalized FOM algorithm for computing PageRank ⋮ Off-diagonal low-rank preconditioner for difficult PageRank problems ⋮ Acceleration of an adaptive generalized Arnoldi method for computing PageRank ⋮ A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank ⋮ The modified matrix splitting iteration method for computing PageRank problem ⋮ Accelerating the Arnoldi method via Chebyshev polynomials for computing 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 variant of the Power-Arnoldi algorithm for computing PageRank ⋮ Non-backtracking PageRank: from the classic model to Hashimoto matrices ⋮ An adaptive Power-GArnoldi algorithm for computing PageRank ⋮ The general inner-outer iteration method based on regular splittings for the PageRank problem ⋮ On the spectrum of two-layer approach and multiplex PageRank ⋮ A multi-power and multi-splitting inner-outer iteration for PageRank computation ⋮ A general multi-splitting iteration method for computing PageRank ⋮ An extrapolation iteration and its lumped type iteration for computing PageRank ⋮ A Hessenberg-type algorithm for computing PageRank problems

Uses Software

• GeneRank

Cites Work

• Unnamed Item
• Unnamed Item
• Recent advances in bibliometric indexes and the PaperRank problem
• Towards Google matrix of brain
• Competitivity groups on social network sites
• An Arnoldi-type algorithm for computing Page Rank
• Vector extrapolation methods with applications to solution of large systems of equations and to PageRank computations
• An Arnoldi-extrapolation algorithm for computing pagerank
• On computing PageRank via lumping the Google matrix
• Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
• Adaptive methods for the computation of PageRank
• A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
• PageRank Beyond the Web
• Numerical Methods for Large Eigenvalue Problems
• An Inner-Outer Iteration for Computing PageRank
• A Power–Arnoldi algorithm for computing PageRank
• The PageRank Vector: Properties, Computation, Approximation, and Acceleration
• Matrix Analysis
• Deeper Inside PageRank
• A Survey of Eigenvector Methods for Web Information Retrieval
• The Matrix Eigenvalue Problem

This page was built for publication: A new extrapolation method for PageRank computations