%0 Journal Article
%T Ranking websites
%A Horvat
%A Damir
%A Mun£¿ar
%A Du£¿an
%J -
%D 2017
%X Sa£¿etak In this paper we describe the mathematical foundations of the Google¡¯s PageRank algorithm. We explain two methods used by the algorithm. The first one, the method of powers, is an iterative method. The second method is founded on solving a system of linear equations. Both methods are related to the problem of finding an eigenvector of the dominant eigenvalue of the corresponding matrix. Functioning of the algorithm is illustrated on a small example of four web pages
%K Google PageRank
%K power method
%K stochastic matrix
%K Perron-Frobenius theorem
%U https://hrcak.srce.hr/index.php?show=clanak&id_clanak_jezik=275075