Searcharxiv⌕ Search

arXiv · 2610.24497

The Segal-Bargmann Transform in Neural Partial Differential Equations

Abstract

We introduce a novel neural operator method based on Segal-Bargmann transform and Bargmann-Fock space for learning the solution operators of partial differential equations (PDEs). The method brings data encoding, latent-space representation, operator learning, and decoding into an unifed framework. From only finitely many observations, we establish a sup-norm reconstruction error of order $ L^{-\frac{1}{2}} $, where L is the number of complex sampling points that are decoupled with the original samplings and observations. The reconstruction error is independent of the spatial dimension and the number of original sampling points. We show that this new mesh-free Segal-Bargmann Neural Operator approach has superior performance compared to existing NO approaches like FNO, BelNet, GNOT, etc.,\ particularly in terms of pointwise control $ \sup_{x}\lvert\hat{u}_{NO} - u_{truth}\rvert $ for solutions of PDEs $ \mathcal{L}u = f $ which provides pointwise accuracy and interpretability as classical numerical solvers. We also demonstrates the reconstructions of the solution operators for higher dimensional nonlinear PDEs, which suggest that our proposed method has great potential to be applied to more challenging PDEs and to even higher spatial dimensions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jie Xu, Julio Castrillón-Candás, Mark Kon, Qinxun Bai. 2026-10-17. The Segal-Bargmann Transform in Neural Partial Differential Equations. https://arxiv.org/abs/2610.24497

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

DDFEM: A Python Package for Diffuse Domain Methods

Solving partial differential equations (PDEs) on complex domains can present significant computational challenges. The Diffuse Domain Method (DDM) is an alternative that reformulates the partial differential equations on a larger, simpler domain. The original geometry is embedded into the problem by representing it with a phase-field function. This paper introduces DDFEM, an extensible Python package to provide a framework for transforming PDEs into a Diffuse Domain formulation. We aim to make the application of a variety of different Diffuse Domain approaches more accessible and straightforward to use. The DDFEM package includes features to intuitively define complex domains by combining signed distance functions and provides a number of Diffuse Domain transformers for general second-order evolution equations. In addition, we present a new approach for combining multiple boundary conditions of different types on distinct boundary segments. This is achieved by applying a normalised weighting, derived from the component signed distance functions, to combine the additional boundary terms in the Diffuse Domain formulations without requiring additional phase fields. The domain definition and Diffuse Domain transformation provided by our package are designed to be compatible with a wide range of existing finite element solvers without requiring code alterations. Both the original (non-linear) PDEs provided by the user and the resulting transformed PDEs on the extended domain are defined using the Unified Form Language (UFL). Here we focus on the software implementation and demonstrate its effectiveness across a range of problems.

math.NA↗

Diffuse Domain Methods with Dirichlet Boundary Conditions

The solution of partial differential equations (PDEs) on complex domains often presents a significant computational challenge by requiring the generation of fitted meshes. The Diffuse Domain Method (DDM) is an alternative which reformulates the problem on a larger, simple domain where the complex geometry is represented by a smooth phase-field function.This paper introduces and analyses several new DDM methods for solving problems with Dirichlet boundary conditions. We derive two new methods from the mixed formulation of the governing equations. This approach transforms the essential Dirichlet conditions into natural boundary conditions. Additionally, we develop coercive formulations based on Nitsche's method. We provide proofs of coercivity for all new methods and also for some approximations found in the literature for a wide range of linear advection-diffusion problems.Numerical experiments demonstrate the improved accuracy of the new methods, and reveal the balance between $L^2$ and $H^1$ errors. The practical effectiveness of this approach is demonstrated through the simulation of the incompressible Navier-Stokes equations on two fluid dynamics benchmark problems.

math.NA↗

A second-order energy-stable sequential regularization scheme for the Navier-Stokes equations

In this paper, we construct a second-order decoupled scheme for the Navier-Stokes equations based on the idea of the auxiliary variable and the sequential regularization method (SRM). The proposed scheme enjoys unconditional energy stability, which is generally unavailable for the existing SRM, while preserving its key advantage of avoiding artificial pressure boundary conditions and maintaining the original velocity boundary conditions. We establish a viscosity-independent low-order stability estimate and a higher-order stability estimate for the proposed scheme. Furthermore, we derive global-in-time second-order error estimates in two dimensions and corresponding local-in-time estimates in three dimensions, without imposing any time-step restrictions. A series of numerical experiments confirm the convergence and stability, and demonstrate improved accuracy and incompressibility control compared with the projection method and the conventional SRM. In particular, both high-Reynolds-number and three-dimensional numerical simulations further demonstrate the robustness and reliability of the proposed method for complex incompressible flows.

math.NA↗