A note on Lanczos algorithm for computing PageRank

MaRDI QIDQ2787244zbMATH OpenFDO

Authors Kazuma Teramoto, Takashi Nodera

Publication date 25 February 2016

zbMATH Keywords

eigenvalue problemPageRankLanczos method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• An Arnoldi-type algorithm for computing Page Rank
• A Power–Arnoldi algorithm for computing PageRank
• An Arnoldi-Inout algorithm for computing PageRank problems
• An adaptive Power-GArnoldi algorithm for computing PageRank
• A variant of the Power-Arnoldi algorithm for computing PageRank

Cites work

• scientific article; zbMATH DE number 1953444 (Why is no real title available?)
• A Power–Arnoldi algorithm for computing PageRank
• An Arnoldi-type algorithm for computing Page Rank
• On adaptively accelerated Arnoldi method for computing PageRank.
• The $25,000,000,000 Eigenvector: The Linear Algebra behind Google
• The principle of minimized iterations in the solution of the matrix eigenvalue problem

Cited in

(1)

• A Hessenberg-type algorithm for computing PageRank problems

This page was built for publication: A note on Lanczos algorithm for computing PageRank

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