论文精选73°

算子学习中狄利克雷边界条件强制方法

Enforcing Dirichlet Boundary Conditions in Operator Learning

精选理由

这篇论文解决了算子学习中边界条件处理的难题,适用于任意网格数据和一般几何形状。

AI 摘要

该研究提出了一种新型神经网络架构,能够在训练前满足齐次狄利克雷边界条件。该方法通过确保每层输出都包含在拉普拉斯算子齐次狄利克雷特征函数的子空间中实现。研究团队在二维PDE问题上验证了该方法,包括方形区域上的达西流动和圆形区域上的亥姆霍兹方程。

原文 · arXiv cs.LG

Enforcing Dirichlet Boundary Conditions in Operator Learning

Operator learning in scientific machine learning is concerned with approximation of maps between infinite-dimensional function spaces; such maps frequently arise as the solution operators of partial differential equations (PDEs). Neural operators have demonstrated broad empirical success at approximating such maps from data. However, most existing neural operator architectures enforce boundary conditions indirectly through training from data even though the boundary condition is often known exactly. Furthermore, existing modifications and approaches that do enforce boundary conditions explicitly suffer from impractical restrictions, including boundary smoothness, uniform grids, and separable, box-like domains. In this work, we propose an architecture which, independently of training, satisfies homogeneous Dirichlet boundary conditions, whilst simultaneously retaining the expressivity of existing kernel-integral neural operator architectures. This is achieved by enforcing the property that the output of each layer is contained in the span of a subset of the homogeneous Dirichlet eigenfunctions of the Laplacian on the output domain. The method requires only that the output domain be bounded with Lipschitz boundary and places no restriction on the choice of discretization, making it applicable to arbitrary mesh data and general geometries. We prove universal approximation for the resulting architecture; furthermore the approach we adopt in the analysis proves universality for a broad class of kernel-integral neural operators thereby uniting existing theory for a variety of operator learning methods. We validate the proposed method on maps defined by the coefficient to solution map in 2D PDEs: Darcy flow on a square domain and the Helmholtz equation on a circular domain. Comparisons are made with alternative methods.