A preconditioning approach to the pagerank computation problem-Reference-Cited by-同舟云学术

A preconditioning approach to the pagerank computation problem

Published:2011-11 Issue:9 Volume:435 Page:2222-2246
ISSN:0024-3795
Container-title:Linear Algebra and its Applications
language:en
Short-container-title:Linear Algebra and its Applications

Author:

Tudisco Francesco,Di Fiore Carmine

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Geometry and Topology,Numerical Analysis,Algebra and Number Theory

Reference32 articles.

1. A survey on PageRank computing;Berkhin;Internet Math.,2005

2. Google’s PageRank and Beyond: The Science of Search Engine Rankings;Langville,2006

3. Fast PageRank computation via a sparse linear system;Del Corso;Internet Math.,2005

4. G.M. Del Corso, A. Gulli, F. Romani, Comparison of Krylov Subspace Methods on the PageRank Problem, University of Pisa, Technical Report, TR-05-20, 2005.

5. An Arnoldi-type algorithm for computing PageRank;Golub;BIT,2006

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Acceleration of an adaptive generalized Arnoldi method for computing PageRank;AIMS Mathematics;2021

2. Extrapolation methods for fixed‐point multilinear PageRank computations;Numerical Linear Algebra with Applications;2020-01-03

3. A short survey on preconditioners and Korovkin-type theorems;The Journal of Analysis;2019-10-22

4. Euler-Richardson method preconditioned by weakly stochastic matrix algebras: a potential contribution to Pagerank computation;The Electronic Journal of Linear Algebra;2017-02-06

5. A note on certain ergodicity coeflcients;Special Matrices;2015-01-03