Revisiting the D-iteration method: runtime comparison
arXiv:1204.6255h-index: 16
Originality Synthesis-oriented
AI Analysis
For researchers using D-iteration for PageRank, this work clarifies runtime behavior but is incremental.
The paper revisits the D-iteration algorithm for PageRank eigenvector computation, comparing practical runtime to theoretical iteration counts to explain observed performance discrepancies.
In this paper, we revisit the D-iteration algorithm in order to better explain different performance results that were observed for the numerical computation of the eigenvector associated to the PageRank score. We revisit here the practical computation cost based on the execution runtime compared to the theoretical number of iterations.