An Arnoldi-MSI algorithm for computing PageRank problems

MaRDI QIDQ2987614zbMATH OpenFDO

Authors Chuanqing Gu, Wenwen Wang

Publication date 17 May 2017

zbMATH Keywords

convergencenumerical examplesrestarted Arnoldi methodArnoldi-MSI algorithmmulti-splitting iteration methodPageRank problems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Searching and sorting (68P10) Iterative numerical methods for linear systems (65F10)

Recommendations

• An Arnoldi-Inout algorithm for computing PageRank problems
• An Arnoldi-type algorithm for computing Page Rank
• A preprocessed multi-step splitting iteration for computing PageRank
• Arnoldi-RPIO algorithm for computing PageRank problems
• An adaptive Power-GArnoldi algorithm for computing PageRank

Cited in

(7)

• A Hessenberg-type algorithm for computing PageRank problems
• An Arnoldi-Inout algorithm for computing PageRank problems
• A modified Arnoldi-type method for computing GeneRank problem
• An Arnoldi-type algorithm for computing Page Rank
• A preprocessed multi-step splitting iteration for computing PageRank
• Arnoldi-PIO algorithm for PageRank
• Arnoldi-RPIO algorithm for computing PageRank problems

This page was built for publication: An Arnoldi-MSI algorithm for computing PageRank problems

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