无需网格即可高效求解复杂形状上的偏微分方程反问题
Meshless solutions of PDE inverse problems on irregular geometries
- 用超矩形上的谱基参数化解,避开传统网格划分
- 优化目标通过损失函数统一约束,实现指数级收敛
- 适合需融合观测数据的科学计算与工程反演场景
在复杂空间域上求解非线性偏微分方程的反问题和优化问题长期面临挑战。本文提出一种方法:将解用包含真实域的超矩形上的谱基进行参数化,通过优化问题求解基展开系数,使方程、边界条件及优化目标均通过损失函数强制满足,借鉴了物理信息神经网络(PINNs)的核心思想。由于函数表示本身具有指数收敛性,只要优化可高效求解,其解也具备指数收敛。我们实验证明,机器学习中常用的优化策略可在多种方程上实现指数收敛。该方法天然支持通过损失函数加入数据项,实现数据同化,并高效求解基于PDE解的优化问题。
原文摘要 · Abstract (English)
Solving inverse and optimization problems over solutions of nonlinear partial differential equations (PDEs) on complex spatial domains is a long-standing challenge. Here we introduce a method that parameterizes the solution using spectral bases on arbitrary spatiotemporal domains, whereby the basis is defined on a hyperrectangle containing the true domain. We find the coefficients of the basis expansion by solving an optimization problem whereby both the equations, the boundary conditions and any optimization targets are enforced by a loss function, building on a key idea from Physics-Informed Neural Networks (PINNs). Since the representation of the function natively has exponential convergence, so does the solution of the optimization problem, as long as it can be solved efficiently. We find empirically that the optimization protocols developed for machine learning find solutions with exponential convergence on a wide range of equations. The method naturally allows for the incorporation of data assimilation by including additional terms in the loss function, and for the efficient solution of optimization problems over the PDE solutions.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。