Improving Learning of Green's Functions Through Kernel Decomposition

This work analyzes a framework for learning the solution operator, or equivalently, the Green’s function, of a general self-adjoint second-order elliptic operator $\text{cL}$. Subtracting the singular part of the Green’s function, either known analytically or supplied by an explicit Laplace parametrix, recasts the learning of ${\text{cL}}^{-1}$ as learning an $\text{cL}$-harmonic extension operator on the boundary. We formulate the process as operator learning between reproducing kernel Hilbert spaces (RKHSs) to show that the kernel decomposition strategy raises the algebraic input rate by two orders and, under uniform analytic regularity of the induced boundary data together with compatible output spaces, upgrades the output rate from algebraic to exponential. We extend the framework further to semilinear problems via an iterative decomposition in which the only learned object remains a linear operator, ensuring that the improved linear rates translate directly to the nonlinear iteration. Numerical experiments are provided to validate the theoretical development.