Karthik Visweswariah, Sanjeev Kulkarni, et al.
IEEE International Symposium on Information Theory - Proceedings
Paper
Chaotic relaxation
Abstract
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.
Related
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
Conference paper
Single and dual wavelength exposure of photoresist
J. LaRue, C. Ting
Proceedings of SPIE 1989
Conference paper
Optimization of real phase-mask performance
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991