Revisiting the D-iteration method: from theoretical to practical computation cost
From MaRDI portal
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 page was built for publication: Revisiting the D-iteration method: from theoretical to practical computation cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6231907)
