Tong Zhang, G.H. Golub, et al.
Linear Algebra and Its Applications
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.
Tong Zhang, G.H. Golub, et al.
Linear Algebra and Its Applications
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
David L. Shealy, John A. Hoffnagle
SPIE Optical Engineering + Applications 2007
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence