An Arnoldi-extrapolation algorithm for computing pagerank (Q989127)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5775757
Language Label Description Also known as
default for all languages
No label defined
    English
    An Arnoldi-extrapolation algorithm for computing pagerank
    scientific article; zbMATH DE number 5775757

      Statements

      An Arnoldi-extrapolation algorithm for computing pagerank (English)
      0 references
      0 references
      0 references
      27 August 2010
      0 references
      The authors aim at improving the PageRank algorithm which is commonly used to determine the global importance of Web pages. The algorithm essentially needs to compute the principal eigenvector of the Google matrix and is obviously required to be very efficient. To this end, the paper proposes a new Arnoldi-Extrapolation algorithm, based on the Arnoldi-type algorithm already presented in literature. An extrapolation method based on Ritz values is developed and then conveniently introduced into the Arnoldi-type algorithm. A detailed convergence analysis is provided. Some enlightening numerical examples show the very good properties of the proposed method.
      0 references
      PageRank
      0 references
      GeneRank
      0 references
      Krylov subspace method
      0 references
      Arnoldi method
      0 references
      algorithm
      0 references
      eigenvector
      0 references
      Google matrix
      0 references
      extrapolation method
      0 references
      Ritz values
      0 references
      convergence
      0 references
      numerical examples
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers