On the convergence of generalized Schwarz algorithms for solving obstacle problems with elliptic operators (Q929344)

The aim of this paper is to consider multiplicative and additive generalized Schwarz algorithms for solving obstacle problems with advection-diffusion operators. The following model (obstacle) problem: \[ \text{Find }u \in K\text{ such that }\langle Lu-f, v-u\rangle_\Omega \geq 0\text{ for any }v \in K, \] is considered, where \(K=\{v \in V = H^1_0(\Omega):v \geq 0\) a.e. in \(\Omega \}\), \(Lu:=- \Delta u+ \text{div} (\mathbf{b}u) + cu\), \(\mathbf{b} \in (L^\infty (\Omega))^d\), \(\operatorname{div} \mathbf{b} \in L^\infty (\Omega)\), \(c \in L^\infty (\Omega)\), \(\frac{1}{2} \operatorname{div} \mathbf{b} + c(x) \geq 0\). The computational domain \(\Omega\) is split into two subdomains \( \Omega_1, \Omega_2\), without overlap and on \(\Gamma(=\overline{\Omega}_1 \cap \overline{\Omega}_2)\) the transmission conditions are formulated \((g_{i,\gamma}(v)=\frac{\partial v}{\partial n_i} - (\frac{1}{2}\mathbf{b}. \mathbf{n}_1 - \gamma)v, \gamma >0, n_i\) is the unit outer normal direction on \(\partial \Omega_i \cap \Gamma, i=1,2)\). Main result: The multiplicative and additive generalized Schwarz algorithms with two (or more than two) subdomains for solving the obstacle problems with advection-diffusion operators are proposed. Compared with the classical Schwarz algorithms (the subproblems are coupled by the Dirichlet boundary conditions), the generalized Schwarz algorithms use Robin conditions with parameters as the transmission conditions on the interface boundaries. Convergence of the proposed algorithms is established. Finally some preliminary numerical results are presented.