Convergence of the D-iteration algorithm: convergence rate and asynchronous distributed scheme

Dohy Hong 1, 2 Fabien Mathieu 2, 3 Gérard Burnside 1
3 GANG - Networks, Graphs and Algorithms
LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications, Inria Paris-Rocquencourt
Abstract : 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.
Type de document :
Rapport
[Research Report] 2013, pp.9
Liste complète des métadonnées

https://hal.inria.fr/hal-00776084
Contributeur : Dohy Hong <>
Soumis le : vendredi 18 janvier 2013 - 14:55:49
Dernière modification le : jeudi 11 janvier 2018 - 06:21:34

Identifiants

  • HAL Id : hal-00776084, version 1
  • ARXIV : 1301.3007

Collections

Citation

Dohy Hong, Fabien Mathieu, Gérard Burnside. Convergence of the D-iteration algorithm: convergence rate and asynchronous distributed scheme. [Research Report] 2013, pp.9. 〈hal-00776084〉

Partager

Métriques

Consultations de la notice

283