An adaptive Power-GArnoldi algorithm for computing PageRank

DOI10.1016/j.cam.2020.113209zbMath1461.65042OpenAlexW3089935041MaRDI QIDQ2222161

Chun Wen, Guojian Yin, Zhao-Li Shen, Qian-Ying Hu, Xian-Ming Gu

Publication date: 3 February 2021

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

zbMATH Keywords

Krylov subspace methodpower methodArnoldi processPageRankgeneralized Arnoldi method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)

Related Items (4)

Acceleration of the generalized FOM algorithm for computing PageRank ⋮ Acceleration of an adaptive generalized Arnoldi method 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

Cites Work

• Unnamed Item
• Unnamed Item
• An Arnoldi-Inout algorithm for computing PageRank problems
• A new extrapolation method for PageRank computations
• A two-step matrix splitting iteration for computing PageRank
• A note on the two-step matrix splitting iteration for computing PageRank
• An Arnoldi-type algorithm for computing Page Rank
• FOM accelerated by an extrapolation method for solving PageRank problems
• 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
• Weighted FOM and GMRES for solving nonsymmetric linear systems
• Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
• Adaptive methods for the computation of PageRank
• A GMRES-power algorithm for computing PageRank problems
• An efficient elimination strategy for solving PageRank problems
• On convergence of the inner-outer iteration method for computing Pagerank
• The general inner-outer iteration method based on regular splittings for the PageRank problem
• A preprocessed multi-step splitting iteration for computing PageRank
• A preconditioned and extrapolation-accelerated GMRES method for pagerank
• A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
• Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
• On the multi-splitting iteration method for computing PageRank
• An Inner-Outer Iteration for Computing PageRank
• A Power–Arnoldi algorithm for computing PageRank
• The PageRank Vector: Properties, Computation, Approximation, and Acceleration
• Deeper Inside PageRank
• On adaptively accelerated Arnoldi method for computing PageRank
• A Survey of Eigenvector Methods for Web Information Retrieval
• A Survey on PageRank Computing
• The principle of minimized iterations in the solution of the matrix eigenvalue problem

This page was built for publication: An adaptive Power-GArnoldi algorithm for computing PageRank