Accelerating the Arnoldi method via Chebyshev polynomials for computing PageRank

DOI10.1016/j.cam.2020.112891zbMath1439.65049OpenAlexW3014951829MaRDI QIDQ2175838

Cun-Qiang Miao, Xue-Yuan Tan

Publication date: 30 April 2020

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.2020.112891

zbMATH Keywords

Chebyshev polynomialseigenvectorArnoldi processPageRank

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical analysis or methods applied to Markov chains (65C40) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25)

Related Items

Acceleration of the generalized FOM algorithm for computing PageRank ⋮ A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank ⋮ An adaptively preconditioned multi-step matrix splitting iteration for computing PageRank ⋮ Unnamed Item ⋮ An extrapolation iteration and its lumped type iteration for computing PageRank

Uses Software

• JDQZ

Cites Work

• Unnamed Item
• Unnamed Item
• An Arnoldi-Inout algorithm for computing PageRank problems
• A new extrapolation method for PageRank computations
• 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
• The Tchebychev iteration for nonsymmetric linear systems
• Computing eigenpairs in augmented Krylov subspace produced by Jacobi-Davidson correction equation
• A preconditioned and extrapolation-accelerated GMRES method for pagerank
• Comparison of Krylov subspace methods on the PageRank problem
• PageRank Beyond the Web
• Numerical Methods for Large Eigenvalue Problems
• An Inner-Outer Iteration for Computing PageRank
• Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
• A Power–Arnoldi algorithm for computing PageRank
• PageRank Computation, with Special Attention to Dangling Nodes
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• Three Hypergraph Eigenvector Centralities
• A Reordering for the PageRank Problem
• Traffic modelling framework for electric vehicles