| HAL-Inria | Publications, software ... of Inria's scientists |
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.
Cited literature [24 references]
https://hal.inria.fr/hal-01286413
Contributor : Hal Ifip <>
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
Contributor : Hal Ifip <>
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