Verified computation of solutions for obstacle problems with guaranteed L∞ error bound Original Research Article

In this paper, we consider a numerical enclosure method with guaranteed L∞ error bound for the solutions of obstacle problems. Using the finite-element approximations and the explicit a priori error estimates for obstacle problems, we present an effective verification procedure that automatically generates on a computer a set which includes the exact solution. A particular emphasis is that our method needs no assumption of the existence of the solution of the original obstacle problems, but it follows as the result of computation itself. A numerical example for an obstacle problem is presented.