An optimization-based method for sign-changing elliptic PDEs
Abstract
We study the numerical approximation of sign-shifting problems of elliptic type. We fully analyze and assess the method briefly introduced in [Abdulle, Huber, Lemaire; CRAS, 2017]. Our method, which is based on domain decomposition and optimization, is proved to be convergent as soon as, for a given loading, the continuous problem admits a unique solution of finite energy. Departing from the $\texttt{T}$-coercivity approach, which relies on the use of geometrically fitted mesh families, our method works for arbitrary (interface-compliant) meshes and anisotropic coefficients. Moreover, it is shown convergent for a class of problems for which $\texttt{T}$-coercivity is not applicable. A comprehensive set of test-cases complements our analysis.
Origin | Files produced by the author(s) |
---|