A Penalization Method for the Elliptic Bilateral Obstacle Problem
Abstract
In this paper we propose a new algorithm for the wellknown elliptic bilateral obstacle problem. Our approach enters the category of fixed domain methods and solves just linear elliptic equations at each iteration. The approximating coincidence set is explicitly computed. In the numerical examples, the algorithm has a fast convergence.
Domains
Computer Science [cs]| Origin | Files produced by the author(s) |
|---|
Loading...
