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
Liste complète des métadonnées

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-01286413
Contributor : Hal Ifip <>
Submitted on : Thursday, March 10, 2016 - 5:16:59 PM
Last modification on : Wednesday, March 14, 2018 - 4:46:11 PM
Document(s) archivé(s) le : 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

41

Files downloads

57