THE CONVERGENCE OF GLOWINSKI'S ALGORITHM FOR ELLIPTIC PROBLEMS

Recently, Bourgat et al.[3] gave a domain decomposition algorithm which can be implemented in parallel, and many numerical experiments have illustrated its efficiency. In this paper, we make a detailed theoretical analysis about this algorithm.