论文部分内容阅读
Considering multiplicative Schwarz algorithm for solving algebraic obstacleproblems, we show the geometric convergence of the algorithm by the use of discretemaximun principle. We also get a decay rate bound independent of the meshsize for theiterative error and illustrate the method by some numerical experiments.