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.
CITATION STYLE
Murea, C. M., & Tiba, D. (2014). A penalization method for the elliptic bilateral obstacle problem. IFIP Advances in Information and Communication Technology, 443, 189–198. https://doi.org/10.1007/978-3-662-45504-3_18
Mendeley helps you to discover research relevant for your work.