Finite termination of asynchronous iterative algorithms
From MaRDI portal
DOI10.1016/0167-8191(95)00059-3zbMATH Open0873.65018OpenAlexW2029041711MaRDI QIDQ672103FDOQ672103
Authors: S. A. Savari, Dimitri P. Bertsekas
Publication date: 27 February 1997
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8191(95)00059-3
Recommendations
- Some aspects of parallel and distributed iterative algorithms - a survey
- Sufficient conditions for the convergence of asynchronous iterations
- On asynchronous iterations
- A distributed-termination experiment on a mesh-connected array of processors
- Asynchronous iterative algorithms for nonexpansive linear systems
linear algebramessage-passing systemtermination detectionasynchronous iterative methodsdistributed memory multiprocessor
Cited In (7)
- Asynchronous Multiplicative Coarse-Space Correction
- Discrete asynchronous iterations
- A distributed-termination experiment on a mesh-connected array of processors
- Title not available (Why is that?)
- A new stopping criterion for linear perturbed asynchronous iterations
- Title not available (Why is that?)
- On asynchronous iterations
This page was built for publication: Finite termination of asynchronous iterative algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672103)