Extrapolation and minimization procedures for the PageRank vector

Authors Claude Brezinski, Michela Redivo-Zaglia

Thumbnail PDF


  • Filesize: 157 kB
  • 6 pages

Document Identifiers

Author Details

Claude Brezinski
Michela Redivo-Zaglia

Cite AsGet BibTex

Claude Brezinski and Michela Redivo-Zaglia. Extrapolation and minimization procedures for the PageRank vector. In Web Information Retrieval and Linear Algebra Algorithms. Dagstuhl Seminar Proceedings, Volume 7071, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)


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.
  • Extrapolation
  • PageRank
  • Web matrix
  • eigenvector computation.


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads