Asynchronous iterations often converge under different conditions than their synchronous counterparts. In this paper we will study the global convergence of Jacobi-Newton-like methods for nonlinear equations F x = 0. It is a known fact, that the synchronous algorithm converges monotonically, if F is
Sufficient conditions for the convergence of asynchronous iterations
✍ Scribed by Aydin Üresin; Michel Dubois
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 568 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In multiprocessor systems, iterative algorithms can be implemented synchronously or asynchronously. Unfortunately, few guidelines exist to make a choice. In this paper, we compare the execution times of an asynchronous iterative algorithm and of its synchronous counterpart. Synchronization overhead
## Abstract This paper concludes one part of the local convergence analysis of a certain class of iterative aggregation–disaggregation methods for computing a stationary probability distribution vector of an irreducible stochastic matrix __B__. We show that the local convergence of the algorithm is