2026-08-17T08:31:57Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1068 2024-03-06T11:07:19Z ddc:004 open_access

Extrapolation and minimization procedures for the PageRank vector Brezinski, Claude Redivo-Zaglia, Michela Extrapolation PageRank Web matrix eigenvector computation. An important problem in Web search is to determine the importance of each page. This problem consists in computing, by the power method, the left principal eigenvector (the PageRank vector) of a matrix depending on a parameter $c$ which has to be chosen close to 1. However, when $c$ is close to 1, the problem is ill-conditioned, and the power method converges slowly. So, the idea developed in this paper consists in computing the PageRank vector for several values of $c$, and then to extrapolate them, by a conveniently chosen rational function, at a point near 1. The choice of this extrapolating function is based on the mathematical considerations about the PageRank vector. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Claude Brezinski and Michela Redivo-Zaglia 2007 Is Part Of Dagstuhl Seminar Proceedings, Volume 7071, Web Information Retrieval and Linear Algebra Algorithms (2007) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.07071.9 urn:nbn:de:0030-drops-10682 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.9 eng https://creativecommons.org/licenses/by/4.0/legalcode