Revisiting the D-iteration method: from theoretical to practical computation cost
arXiv:1203.60305 citationsh-index: 16
Originality Synthesis-oriented
AI Analysis
Provides theoretical and practical insights into D-iteration for researchers working on PageRank and linear system solvers.
The paper revisits the D-iteration algorithm, clarifying its connection to Gauss-Seidel and analyzing practical runtime versus theoretical iterations, while proposing an exact error formula for PageRank equations.
In this paper, we revisit the D-iteration algorithm in order to better explain its connection to the Gauss-Seidel method and different performance results that were observed. In particular, we study here the practical computation cost based on the execution runtime compared to the theoretical number of iterations. We also propose an exact formula of the error for PageRank class of equations.