AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (603.2 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Acceleration of the generalized FOM algorithm for computing PageRank

Yu Jin1Chun Wen1( )Zhao-Li Shen2( )
School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu 611731, China
College of Science, Sichuan Agricultural University, Ya'an 625000, China
Show Author Information

Abstract

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.

References

【1】
【1】
 
 
Electronic Research Archive
Pages 732-754

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Jin Y, Wen C, Shen Z-L. Acceleration of the generalized FOM algorithm for computing PageRank. Electronic Research Archive, 2022, 30(2): 732-754. https://doi.org/10.3934/era.2022039

12

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 14 December 2021
Revised: 07 February 2022
Accepted: 13 February 2022
Published: 15 February 2022
©2022 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)