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.
https://hal.inria.fr/hal-01286413 Contributor : Hal IfipConnect in order to contact the contributor Submitted on : Thursday, March 10, 2016 - 5:16:59 PM Last modification on : Thursday, March 5, 2020 - 4:32:02 PM Long-term archiving on: : Sunday, November 13, 2016 - 3:36:25 PM
Cornel Murea, Dan Tiba. A Penalization Method for the Elliptic Bilateral Obstacle Problem. 26th Conference on System Modeling and Optimization (CSMO), Sep 2013, Klagenfurt, Austria. pp.189-198, ⟨10.1007/978-3-662-45504-3_18⟩. ⟨hal-01286413⟩