Maximum norm analysis of an overlapping nonmatching grids method for the obstacle problem

Abstract

We provide a maximum norm analysis of an overlapping Schwarz method on nonmatching grids for second-order elliptic obstacle problem. We consider a domain which is the union of two overlapping subdomains where each subdomain has its own independently generated grid. The grid points on the subdomain boundaries need not match the grid points from the other subdomain. Under a discrete maximum principle, we show that the discretization on each subdomain converges quasi-optimally in the L∞ norm. Copyright © 2006 M. Boulbrachene and S. Saadi.