A reordering for the pagerank problem

We describe a reordering particularly suited to the PageRank problem, which reduces the computation of the PageRank vector to that of solving a much smaller system and then using forward substitution to get the full solution vector. We compare the theoretical rates of convergence of the original Pag...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIAM journal on scientific computing 2006, Vol.27 (6), p.2112-2120
Hauptverfasser:	LANGVILLE, Amy N, MEYER, Carl D
Format:	Artikel
Sprache:	eng
Schlagworte:	Acceleration of convergence Algorithms Applied mathematics Datasets Eigenvectors Exact sciences and technology Markov analysis Markov processes Mathematics Numerical analysis Numerical analysis. Scientific computation Numerical linear algebra Numerical methods in probability and statistics Probability and statistics Probability theory and stochastic processes Sciences and techniques of general use Search engines
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!