An optimization-based method for sign-changing elliptic PDEs - Inria EPFL
Preprints, Working Papers, ... Year : 2023

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.
Fichier principal
Vignette du fichier
nim.pdf (1.15 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04140542 , version 1 (25-06-2023)
hal-04140542 , version 2 (04-02-2024)

Identifiers

  • HAL Id : hal-04140542 , version 1

Cite

Assyr Abdulle, Simon Lemaire. An optimization-based method for sign-changing elliptic PDEs. 2023. ⟨hal-04140542v1⟩
282 View
145 Download

Share

More