An adaptive Power-GArnoldi algorithm for computing PageRank
type: Item
instance of: scholarly article
title: An adaptive Power-GArnoldi algorithm for computing PageRank
zbMATH Open document ID: 1461.65042
author: Chun Wen
author: Qian-Ying Hu
author: Guojian Yin
author: Xian-Ming Gu
author: Zhaoli Shen
published in: Journal of Computational and Applied Mathematics
publication date: 2021-02-03T00:00:00Z
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65F15
zbMATH DE Number: 7305135
zbMATH Keywords: PageRank
zbMATH Keywords: power method
zbMATH Keywords: generalized Arnoldi method
zbMATH Keywords: Arnoldi process
zbMATH Keywords: Krylov subspace method
MaRDI profile type: Publication
full work available at URL: j.cam.2020.113209
OpenAlex ID: W3089935041
cites work: A Survey of Eigenvector Methods for Web Information Retrieval
cites work: Deeper Inside PageRank
cites work: A Survey on PageRank Computing
cites work: Q5689624
cites work: A preconditioned and extrapolation-accelerated GMRES method for pagerank
cites work: A new extrapolation method for PageRank computations
cites work: The PageRank Vector: Properties, Computation, Approximation, and Acceleration
cites work: Vector extrapolation methods with applications to solution of large systems of equations and to PageRank computations
cites work: An Inner-Outer Iteration for Computing PageRank
cites work: A note on the two-step matrix splitting iteration for computing PageRank
cites work: On the multi-splitting iteration method for computing PageRank
cites work: A two-step matrix splitting iteration for computing PageRank
cites work: A preprocessed multi-step splitting iteration for computing PageRank
cites work: On convergence of the inner-outer iteration method for computing Pagerank
cites work: The general inner-outer iteration method based on regular splittings for the PageRank problem
cites work: Adaptive methods for the computation of PageRank
cites work: On adaptively accelerated Arnoldi method for computing PageRank
cites work: On computing PageRank via lumping the Google matrix
cites work: Numerical methods for large eigenvalue problems
cites work: An Arnoldi-type algorithm for computing Page Rank
cites work: Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
cites work: A Power–Arnoldi algorithm for computing PageRank
cites work: A harmonic restarted Arnoldi algorithm for calculating eigenvalues and determining multiplicity
cites work: An Arnoldi-extrapolation algorithm for computing pagerank
cites work: An Arnoldi-Inout algorithm for computing PageRank problems
cites work: A GMRES-power algorithm for computing PageRank problems
cites work: An efficient elimination strategy for solving PageRank problems
cites work: FOM accelerated by an extrapolation method for solving PageRank problems
cites work: Weighted FOM and GMRES for solving nonsymmetric linear systems
cites work: Weighted restarting method in the weighted Arnoldi algorithm for computing the eigenvalues of a nonsymmetric matrix
cites work: The principle of minimized iterations in the solution of the matrix eigenvalue problem
DOI: 10.1016/J.CAM.2020.113209
description: scientific article