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.
Christian Pötzsche; Clemens Heuberger; Barbara Kaltenbacher; Franz Rendl. 26th Conference on System Modeling and Optimization (CSMO), Sep 2013, Klagenfurt, Austria. Springer Berlin Heidelberg, IFIP Advances in Information and Communication Technology, AICT-443, pp.189-198, 2014, System Modeling and Optimization. 〈10.1007/978-3-662-45504-3_18〉
https://hal.inria.fr/hal-01286413
Contributeur : Hal Ifip
<>
Soumis le : jeudi 10 mars 2016 - 17:16:59
Dernière modification le : mercredi 14 mars 2018 - 16:46:11
Document(s) archivé(s) le : dimanche 13 novembre 2016 - 15:36:25
Cornel Murea, Dan Tiba. A Penalization Method for the Elliptic Bilateral Obstacle Problem. Christian Pötzsche; Clemens Heuberger; Barbara Kaltenbacher; Franz Rendl. 26th Conference on System Modeling and Optimization (CSMO), Sep 2013, Klagenfurt, Austria. Springer Berlin Heidelberg, IFIP Advances in Information and Communication Technology, AICT-443, pp.189-198, 2014, System Modeling and Optimization. 〈10.1007/978-3-662-45504-3_18〉. 〈hal-01286413〉
