A projection algorithm for bilateral obstacle problem (Q2479450): Difference between revisions

A bilateral obstacle problem is considered: \[ \text{Find }u\in K= \{\upsilon\in H^1_0(\Omega): \psi_1\leq\upsilon\leq\psi_2\text{ a.e. in }\Omega\} \] such that \[ \int_\Omega\nabla u(\nabla\upsilon-\nabla u)\,dx\geq \int_\Omega f(u-\upsilon)\,dx\text{ for all }\upsilon\in K, \] where \(\psi_1\), \(\psi_2\), \(f\) and \(\Omega\) are sufficiently regular data. This problem is equivalent to the following Dirichlet problem: Find \(u\in H^1_0(\Omega)\) such that \(\Delta_u= F+\mu\), where \(F\) and \(\mu\) are in \(L^2(\Omega)\) and they are calculable according to the data of the problem. In addition, \(\mu\) is the sum of two elements \(\mu_1, \mu_2\in L^2(\Omega)\) that characterize contacts, respectively, with \(\psi_1\) and \(\psi_2\). For the resolution of the Dirichlet problem, the authors propose a projection algorithm. The convergence of this algorithm is proved. To formulate the variational inequality an abstract problem is studied. The authors have in mind to generalize the results to parabolic systems, or to nonlinear problems, in the future. There are no examples until now, the treatment of examples is in preparation in a forthcoming paper.