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, 17]. Our method is based on domain decomposition and optimization. Upon an extra integrability assumption on the exact normal flux trace along the sign-changing interface, our method is proved to be convergent as soon as, for a given loading, the PDE admits a unique solution of finite energy. Departing from the T-coercivity approach, which relies on the use of geometrically fitted mesh families, our method works for arbitrary (interface-compliant) mesh sequences. Moreover, it is shown convergent for a class of problems for which T-coercivity is not applicable. A comprehensive set of test-cases complements our analysis.