Revisiting the D-iteration method: from theoretical to practical computation cost
classification
💻 cs.NA
cs.NA
keywords
computationcostd-iterationmethodpracticaltheoreticalalgorithmbetter
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.