The convergence rate of domain decomposition method for obstacle problem

J.P.Zeng and Shuzi Zhou

Abstract

A kind of additive or multiplicative space decomposition methods for obstacle problems are discussed. The convergence theorem and the geometrical rate (in quadratical functional case) or asymptotically geometrical convergence rate have been proved.