Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON
In this paper we consider relaxation methods for solving linear systems of equations. These methods are suited for execution on a parallel system of processors. They have the feature of allowing a minimal amount of communication of computational status between the computers, so that the relaxation process, while taking on a chaotic appearance, reduces programming and processor time of a bookkeeping nature. We give a precise characterization of chaotic relaxation, some examples of divergence, and conditions guaranteeing convergence. © 1969.
Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
Shu Tezuka
WSC 1991
Igor Devetak, Andreas Winter
ISIT 2003