Generalized Schwarz algorithm for obstacle problems
In this paper, we present so-called generalized additive and multiplicative Schwarz algorithms for solving the discretization problems of obstacle problems with a self-adjoint elliptic operator. We establish convergence theorems for the proposed algorithms. Numerical tests show that a faster convergence rate can be obtained by choosing suitable parameters in the algorithms. (C) 1999 Elsevier Science Ltd. All rights reserved.
generalized schwarz algorithms obstacle problems convergence variational inequalities