A new stopping criterion for linear perturbed asynchronous iterations

Authors:
J. C. Miellou;P. Spiteri;D. El Baz
Affiliations:
Département de Mathématiques, UFR Sciences et Techniques, 16 route de Gray, F-25030 Besançon-Cedex, France;ENSEEIHT-IRIT/LIMA, 2 rue Camichel, B.P. 7122, F- 31071 Toulouse-Cedex, France;LAAS-CNRS, 7 avenue du Colonel Roche, F-31077 Toulouse-Cedex 4, France
Venue:
Journal of Computational and Applied Mathematics
Year:
2008

Citing 10
Cited 0

Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Some aspects of the parallel and distributed iterative algorithms—a survey

Automatica (Journal of IFAC)
Finite termination of asynchronous iterative algorithms

Parallel Computing
On the Compatibility of a Given Solution With the Data of a Linear System

Journal of the ACM (JACM)
Asynchronous Iterative Methods for Multiprocessors

Journal of the ACM (JACM)
Timing models and local stopping criteria for asynchronous iterative algorithms

Journal of Parallel and Distributed Computing
On asynchronous iterations

Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. III: linear algebra
A Decentralized Convergence Detection Algorithm for Asynchronous Parallel Iterative Algorithms

IEEE Transactions on Parallel and Distributed Systems
Performance Comparison of Parallel Programming Environments for Implementing AIAC Algorithms

The Journal of Supercomputing
Super-Scalable algorithms for computing on 100,000 processors

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I

Quantified Score

Hi-index	7.29

Visualization

Abstract

A new stopping criterion is proposed for asynchronous linear fixed point methods in finite precision. The case of absolute error is considered. The originality of this stopping criterion relies on the fact that all tests are made within the same macroiteration.