Simulations of asynchronous evolution of discrete systems

Simulation Practice and Theory

Volumn 7, Issue 4, 1999, Pages 309-324

  Bahi, Jacques M ^a   Michel, Christian J ^b  

^a Laboratoire De Mathématiques De Besançon Umr Cnrs 6623 Ufr Sciences Et Techniques   (France)

^b UNIVERSITÉ DE TECHNOLOGIE DE BELFORT MONTBÉLIARD   (France)

Author keywords

Asynchronous algorithms; Boolean iterations; Discrete dynamic systems; Numerical simulations; Research software

Indexed keywords

EID: 0011872838     PISSN: 09284869     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0928-4869(99)00010-5     Document Type: Article

References (8)

1. G.M. Baudet, Asynchronous iterative methods for multiprocessors, J. ACM 25 (1978) 226-244.
2. J.M. Bahi, C.J. Michel, Convergence of discrete asynchronous iterations, International Journal of Computer Mathematics, (1999) in press.
3. D.P. Bertsekas, J.N. Tsitsiklis, Parallel and Distributed Computation, Prentice Hall, Englewood Cliffs, 1989.
4. D. Chazan, W.L. Miranker, Chaotic relaxation, Linear Alg. Appl. 2 (1969) 199-222.
5. M.N. El Tarazi, Some convergence results for asynchronous algorithms, Numer. Math 39 (1982) 325-340.
6. J.-C. Miellou, Algorithmes de relaxation chaotique retard, RAIRO R1 (1975) 55-82.
7. F. Robert, Les Systèmes Dynamiques Discrets, Mathéḿatiques and Applications 19, Springer, Berlin, 1995.
8. F. Robert, M. Charnay, F. Musy, Itérations chaotiques série-parallèle pour des équations non-linéaires de point fixe, Aplikace Matematiky 20 (1975) 1-38.