NAJan 14, 2013
Convergence of the D-iteration algorithm: convergence rate and asynchronous distributed schemeDohy Hong, Fabien Mathieu, Gérard Burnside
In this paper, we define the general framework to describe the diffusion operators associated to a positive matrix. We define the equations associated to diffusion operators and present some general properties of their state vectors. We show how this can be applied to prove and improve the convergence of a fixed point problem associated to the matrix iteration scheme, including for distributed computation framework. The approach can be understood as a decomposition of the matrix-vector product operation in elementary operations at the vector entry level.
NAJun 15, 2012
Note on the equations of diffusion operators associated to a positive matrixDohy Hong, Gérard Burnside
In this paper, we describe the general framework to describe the diffusion operators associated to a positive matrix. We define the equations associated to diffusion operators and present some general properties of their state vectors. We show how this can be applied to prove and improve the convergence of a fixed point problem associated to the matrix iteration scheme. The approach can be understood as a decomposition of the matrix-vector product operation in elementary operation at the vector entry level.
NAApr 27, 2012
Revisiting the D-iteration method: runtime comparisonDohy Hong, Gérard Burnside, Philippe Raoult
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.