HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-01286413
Contributor : Hal Ifip Connect 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

File

978-3-662-45504-3_18_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

29

Files downloads

158