Numerically Informed Convolutional Operator Network with Subproblem Decomposition for Poisson Equations
Kyoungjin Jung, Jae Yong Lee, Dongwook Shin
TL;DR
This work addresses the challenge of learning PDE solution operators with reliable convergence properties under grid refinement by integrating classical numerical discretizations with neural operator learning. The authors introduce NICON, featuring two residual-based, physics-informed networks—FD-CON (finite difference) and FE-CON (finite element)—coupled with a domain-to-image mapping and a subproblem decomposition u = u1 + u2 that exploits linearity to improve training efficiency and generalization. They derive $H^1$-seminorm error estimates linking convergence to the decay rate of the training losses and propose strategies to achieve optimal rates; extensive experiments on Poisson and Helmholtz problems validate the theory, showing competitive accuracy on fine grids and improved generalization via decomposition. The framework demonstrates data-free training, scalability to complex geometries, and robustness to oscillatory solutions, offering a practical alternative to traditional solvers for parametric or repeated-PDE tasks. This work advances physics-informed operator learning by making it numerically principled and computationally tractable on high-resolution grids.
Abstract
Neural operators have shown remarkable performance in approximating solutions of partial differential equations. However, their convergence behavior under grid refinement is still not well understood from the viewpoint of numerical analysis. In this work, we propose a numerically informed convolutional operator network, called NICON, that explicitly couples classical finite difference and finite element methods with operator learning through residual-based training loss functions. We introduce two types of networks, FD-CON and FE-CON, which use residual-based loss functions derived from the corresponding numerical methods. We derive error estimates for FD-CON and FE-CON using finite difference and finite element analysis. These estimates show a direct relation between the convergence behavior and the decay rate of the training loss. From these analyses, we establish training strategies that guarantee optimal convergence rates under grid refinement. Several numerical experiments are presented to validate the theoretical results and show performance on fine grids.
