A preconditioning approach to the pagerank computation problem (Q551350)
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 5924585
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A preconditioning approach to the pagerank computation problem |
scientific article; zbMATH DE number 5924585 |
Statements
A preconditioning approach to the pagerank computation problem (English)
0 references
15 July 2011
0 references
A graph is associated to the web, where the web pages are the nodes and the links are the arcs. A stochastic matrix is defined by the graph. Its eigenvector with nonnegative entries is assumed to characterize the importance of the pages. The power method is embedded in a Euler-Richardson iterative scheme. Several preconditioners are discussed with emphasis on a method called \(ER_{\mathcal U}\) method.
0 references
pagerank
0 references
eigenvalues
0 references
stochastic matrices
0 references
preconditioning
0 references
clustering
0 references
fast discrete transforms
0 references
graph
0 references
eigenvector
0 references
power method
0 references
Euler-Richardson iterative scheme
0 references
0 references
0 references
0 references
0.8418195247650146
0 references
0.7842980027198792
0 references
0.782289445400238
0 references
0.7769883871078491
0 references
0.7751799821853638
0 references
