Arnoldi-PIO algorithm for PageRank

DOI10.12066/J.ISSN.1007-2861.1867MaRDI QIDQ4640918zbMATH OpenOpenAlexFDO

Authors Chuanqing Gu, Ying Nie, Jinbo Wang

Publication date 25 May 2018

Full work available at URL https://www.journal.shu.edu.cn/CN/abstract/abstract6120.shtml

zbMATH Keywords

PageRankinner-outer iterationthick restarted Arnoldi algorithmtwo-step splitting iteration

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Searching and sorting (68P10) Internet topics (68M11)

Recommendations

• Arnoldi-RPIO algorithm for computing PageRank problems
• An Arnoldi-Inout algorithm for computing PageRank problems
• An Arnoldi-MSI algorithm for computing PageRank problems
• An adaptive Power-GArnoldi algorithm for computing PageRank
• An Arnoldi-Inout method accelerated with a two-stage matrix splitting iteration for computing PageRank

Cited in

(4)

• Ordinal Ranking for Google's PageRank
• An Arnoldi-Inout algorithm for computing PageRank problems
• An Arnoldi-type algorithm for computing Page Rank
• Arnoldi-RPIO algorithm for computing PageRank problems

This page was built for publication: Arnoldi-PIO algorithm for PageRank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640918)