On asynchronous iterations in partially ordered spaces
- 1 January 1991
- journal article
- research article
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 12 (3-4) , 315-325
- https://doi.org/10.1080/01630569108816431
Abstract
We extend the idea of asynchronous iterations to self-mappings of product spaces with infinitely many components. In addition to giving a rather general convergence theorem we study in some detail the case of isotone and isotonically decomposable mappings in partially ordered spaces. In particular, we obtain relationships between asynchronous iterations and the total step method and results on enclosures for fixed points. They appear to be new, even for mappings defined on a product space with only finitely many components.Keywords
This publication has 19 references indexed in Scilit:
- M-Functions and Parallel Asynchronous AlgorithmsSIAM Journal on Numerical Analysis, 1990
- Sufficient conditions for the convergence of asynchronous iterationsParallel Computing, 1989
- Convergence of asynchronous iteration with arbitrary splitting formLinear Algebra and its Applications, 1989
- Models of parallel chaotic iteration methodsLinear Algebra and its Applications, 1988
- An asynchronous parallel mixed algorithm for linear and nonlinear equationsParallel Computing, 1987
- Regular splittings and monotone iteration functionsNumerische Mathematik, 1985
- Parallel S.O.R. iterative methodsParallel Computing, 1984
- Asynchronous Iterative Methods for MultiprocessorsJournal of the ACM, 1978
- Chaotic relaxationLinear Algebra and its Applications, 1969
- Newton’s Method for Convex Operators in Partially Ordered SpacesSIAM Journal on Numerical Analysis, 1967