A General Setting for the Parametric Google Matrix

DOI10.1080/15427951.2006.10129131zbMath1146.65315OpenAlexW2014368003MaRDI QIDQ3519884

Roger A. Horn, Stefano Serra Capizzano

Publication date: 19 August 2008

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2006.10129131

zbMATH Keywords

eigenvalueseigenvectorconditioningpower methodJordan blocksextrapolation algorithmPageRank vectornonnegative, positive, and stochastic matricesspectral and Jordan structuresstochastic Google matrixweb hyperlink matrix

Mathematics Subject Classification ID

Searching and sorting (68P10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Canonical forms, reductions, classification (15A21) Stochastic matrices (15B51)

Related Items (10)

Acceleration of the generalized FOM algorithm for computing PageRank ⋮ Shift techniques for quasi-birth and death processes: canonical factorizations and matrix equations ⋮ Eigenvalues and Jordan canonical form of a successively rank-one updated complex matrix with applications to Google's PageRank problem ⋮ The eigenvalue shift technique and its eigenstructure analysis of a matrix ⋮ Accelerated multigrid for graph Laplacian operators ⋮ Rational extrapolation for the PageRank vector ⋮ Google pageranking problem: The model and the analysis ⋮ Relationship between the characteristic polynomial and the spectrum of a diagonalizable matrix and those of its low-rank update ⋮ PageRank Beyond the Web ⋮ A Dynamical System for PageRank with Time-Dependent Teleportation

This page was built for publication: A General Setting for the Parametric Google Matrix