Revisiting the D-iteration method: runtime comparison
classification
💻 cs.NA
cs.NAcs.PF
keywords
computationd-iterationrevisitruntimealgorithmassociatedbettercompared
read the original abstract
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.
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.