A Hessenberg-type Algorithm for Computing PageRank Problems

08/01/2019

∙

by   Xian-Ming Gu, et al.

∙

0

∙

share

PageRank is a greatly essential ranking algorithm in web information retrieval or search engine. In the current paper, we present a cost-effective Hessenberg-type method built upon the Hessenberg process for the computation of PageRank vector, which is better suited than the Arnoldi-type algorithm when the damping factor becomes high and especially the dimension of the search subspace is large. The convergence and complexity of the proposed algorithm are also investigated. Numerical results are reported to show that the proposed method is efficient and faster than some existing related algorithms, in particular when the damping factor is large.