Consistent CutPINNs for Elliptic PDEs on Curved Level-Set Domains
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911715415818240 |
|---|---|
| author | Singh, Maneesh Kumar |
| author_facet | Singh, Maneesh Kumar |
| contents | We propose \emph{Consistent CutPINN}, a framework for partial differential equations posed on bounded curved domains defined implicitly by a $\C^2$ level-set function, $Ω= \{φ< 0\}$. In this paper we develop the framework for second-order elliptic problems in two dimensions. The standard PINN loss penalises the boundary mismatch in $L^2(\partialΩ)$, but $L^2(\partialΩ)$ does not control the $H^{1/2}(\partialΩ)$ trace norm that appears in the $H^1(Ω)$ energy estimate. The consistent PINN framework of Bonito et al.~\cite{bonito2025} fixes this on the unit cube $(0,1)^d$ via a Kuhn--Tucker simplicial decomposition of the flat boundary faces, but the construction relies on the affine structure of the faces and does not carry over to smooth curved boundaries. We address this gap. Specifically, (i) we introduce a discrete $H^{1/2}(\partialΩ)$ surrogate built directly from collocation points on a $\C^2$ curve, (ii) we prove a \textit{Chord-arc} norm equivalence between this surrogate and the continuous trace norm, (iii) we establish an \emph{a priori} $H^1$ error bound on cut domains, and (iv) we derive convergence rates under Besov regularity using optimal recovery theory. Numerical experiments on a disk and a non-convex flower domain confirm that the consistent loss is much more accurate than the standard PINN loss and far more robust to cut-cell configurations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_25562 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Consistent CutPINNs for Elliptic PDEs on Curved Level-Set Domains Singh, Maneesh Kumar Numerical Analysis We propose \emph{Consistent CutPINN}, a framework for partial differential equations posed on bounded curved domains defined implicitly by a $\C^2$ level-set function, $Ω= \{φ< 0\}$. In this paper we develop the framework for second-order elliptic problems in two dimensions. The standard PINN loss penalises the boundary mismatch in $L^2(\partialΩ)$, but $L^2(\partialΩ)$ does not control the $H^{1/2}(\partialΩ)$ trace norm that appears in the $H^1(Ω)$ energy estimate. The consistent PINN framework of Bonito et al.~\cite{bonito2025} fixes this on the unit cube $(0,1)^d$ via a Kuhn--Tucker simplicial decomposition of the flat boundary faces, but the construction relies on the affine structure of the faces and does not carry over to smooth curved boundaries. We address this gap. Specifically, (i) we introduce a discrete $H^{1/2}(\partialΩ)$ surrogate built directly from collocation points on a $\C^2$ curve, (ii) we prove a \textit{Chord-arc} norm equivalence between this surrogate and the continuous trace norm, (iii) we establish an \emph{a priori} $H^1$ error bound on cut domains, and (iv) we derive convergence rates under Besov regularity using optimal recovery theory. Numerical experiments on a disk and a non-convex flower domain confirm that the consistent loss is much more accurate than the standard PINN loss and far more robust to cut-cell configurations. |
| title | Consistent CutPINNs for Elliptic PDEs on Curved Level-Set Domains |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2605.25562 |