Author:
Jin Yu, ,Wen Chun,Shen Zhao-Li,
Abstract
<abstract><p>In this paper, a generalized full orthogonalization method (GFOM) based on weighted inner products is discussed for computing PageRank. In order to improve convergence performance, the GFOM algorithm is accelerated by two cheap methods respectively, one is the power method and the other is the extrapolation method based on Ritz values. Such that two new algorithms called GFOM-Power and GFOM-Extrapolation are proposed for computing PageRank. Their implementations and convergence analyses are studied in detail. Numerical experiments are used to show the efficiency of our proposed algorithms.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Reference41 articles.
1. L. Page, S. Brin, R. Motwami, T. Winograd, The PageRank citation ranking: Bringing order to the web, Stanford Digital Library Technol. Proj., 1998. https://doi.org/10.1007/978-3-319-08789-4-10
2. I. C. Ipsen, T. M. Selee, PageRank computation, with special attention to dangling nodes, SIAM J. Matrix Anal. Appl., 29 (2008), 1281–1296. https://doi.org/10.1137/060664331
3. A. Langville, C. Meyer, A survey of eigenvector methods for web information retrieval, SIAM Rev., 47 (2005), 135–161. https://doi.org/10.1137/S0036144503424786
4. A. Langville, C. Meyer, Deeper inside PageRank, Internet Math., 1 (2004), 335–380. https://doi.org/10.1080/15427951.2004.10129091
5. G. H. Golub, C. F. Van Loan, Matrix Computations, 3$^{rd}$ edition, The Johns Hopkins University Press, Baltimore, London, 1996. https://doi.org/10.1007/978-1-4612-5118-7-5