用分域方法让神经算子在不同几何上通用,解决数据少时泛化差的问题。
Operator Learning with Domain Decomposition for Geometry Generalization in PDE Solving
- 将问题区域拆成小块,局部用神经算子求解,再拼接成整体解
- 在多种边值条件下,对任意几何的泛化性能显著优于现有方法
- 适合需要少样本、跨几何求解微分方程的研究者
神经算子因其在复杂域上捕捉函数空间间复杂映射的能力,已成为求解偏微分方程(PDE)的热门方法。然而,其高数据依赖性限制了广泛应用,核心挑战在于神经算子难以迁移至新几何。为此,本文提出基于域分解的算子学习框架,构建从局部到全局的求解机制。在此框架下,设计了迭代算法Schwarz神经推理(SNI),将问题域划分为若干子域,在各子域上使用神经算子求解局部问题,并通过拼接获得全局解。此外,提供了收敛速率与误差界理论分析。在多个代表性PDE及不同边界条件下进行大量实验,结果表明该方法在几何泛化能力上显著优于其他方法,验证了其在应对几何泛化与数据效率挑战方面的潜力。
原文摘要 · Abstract (English)
Neural operators have become increasingly popular in solving \textit{partial differential equations} (PDEs) due to their superior capability to capture intricate mappings between function spaces over complex domains. However, the data-hungry nature of operator learning inevitably poses a bottleneck for their widespread applications. At the core of the challenge lies the absence of transferability of neural operators to new geometries. To tackle this issue, we propose operator learning with domain decomposition, a local-to-global framework to solve PDEs on arbitrary geometries. Under this framework, we devise an iterative scheme \textit{Schwarz Neural Inference} (SNI). This scheme allows for partitioning of the problem domain into smaller subdomains, on which local problems can be solved with neural operators, and stitching local solutions to construct a global solution. Additionally, we provide a theoretical analysis of the convergence rate and error bound. We conduct extensive experiments on several representative PDEs with diverse boundary conditions and achieve remarkable geometry generalization compared to alternative methods. These analysis and experiments demonstrate the proposed framework's potential in addressing challenges related to geometry generalization and data efficiency.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。