Appendix: theoretical additions to contraction analysis
Parallel Asynchronous Algorithms III. Application, Performances

We have seen in [AF 1 385] the importance of strongly diagonal dominant matrices for analyzing the behavior of asynchronous parallel algorithms. In this appendix, we illustrate the link between these strongly diagonal-dominant matrices and a notion of accreteness that extends the notion of monotonicity to the case of normed vector spaces, restricting it to the case where the space is normed by the norm of the maximum.

...