物理信息神经网络中的硬约束投影(Burgers)
Hard Constraint Projection in a Physics Informed Neural Network (Burgers)
Miranda J S Horne · Peter K Jimack · Amirul Khan · He Wang
中文摘要
物理信息机器学习为流体动力学的研究与模拟提供了框架,其计算成本可能仅为传统数值方法的一小部分,目标是提升纯数据驱动机器学习方法的可解释性、精度与鲁棒性。本工作将 Chen 等人(Journal of Computational Physics, 445, 110624, 2021)提出的硬约束投影(HCP)方法从线性偏微分方程(PDE)推广到非线性 PDE:一维 Burgers 方程。为严格施加控制方程的离散近似,先对 Burgers 方程做局部离散(使用有限差分模板),再分解为约束矩阵与预测矩阵。利用线性代数工具,由约束矩阵构造投影矩阵。物理信息神经网络(PINN)(Raissi 等,Journal of Computational Physics, 378, 686, 2019)用于预测速度,最后的不可学习层将速度预测投影到 Burgers 方程离散形式精确解的超平面上。初步结果表明,HCP-PINN 初期训练与等价 PINN 相似,而当 PINN 损失趋于平台时,HCP-PINN 损失继续下降。在覆盖求解域的未见均匀网格点上测试时,HCP-PINN 精度更高,收敛到的数据误差比可比 PINN 低约一个数量级。还观察到引入 HCP 层后对控制 PDE 的遵循更好。结果表明 HCP-PINN 对物理配点选择更鲁棒,对配点数量的依赖更小。
关键要点
- 01将硬约束投影(HCP)从线性 PDE 推广到非线性一维 Burgers 方程,构造投影矩阵严格施加离散控制方程。
- 02HCP-PINN 初期训练与等价 PINN 相似,PINN 损失平台后 HCP-PINN 损失继续下降。
- 03在未见均匀网格上,HCP-PINN 数据误差比可比 PINN 低约一个数量级。
- 04引入 HCP 层后对控制 PDE 的遵循更好,对物理配点选择更鲁棒、对配点数量依赖更小。
解读
尚无解读。
原始英文摘要
arXiv:2610.42106v1 Announce Type: cross Abstract: Physics informed machine learning provides a framework to study and simulate fluid dynamics, potentially at a fraction of the computational cost of traditional numerical methods, with the goal of improving the explainability, accuracy and robustness of purely data driven machine learning methods. In this work, we extend the hard constraint projection (HCP) method developed by Chen et al. [Journal of Computational Physics, 445, 110624, 2021] from a linear partial differential equation (PDE) to a nonlinear PDE: the 1D Burgers' equation. To strictly impose a discrete approximation of the governing equation, the Burgers' equation is first locally discretised (using a finite difference stencil) then decomposed into a constraint matrix and a prediction matrix. Using tools from linear algebra, the constraint matrix is used to construct a projection matrix. A physics informed neural network (PINN) [Raissi et al. Journal of Computational Physics, 378, 686, 2019] is used to predict the velocity, and a final unlearnable layer projects the velocity prediction to the hyperplane of exact solutions to a discretised form of the Burgers' equation. Our initial results indicate that the HCP-PINN initially trains similarly to an equivalent PINN, and as the PINN loss plateaus, the HCP-PINN loss continues to decline. When tested on a previously unseen uniform grid of points covering the domain, the HCP-PINN exhibits higher accuracy, converging to a data error approximately an order of magnitude lower than the comparable PINN. We also observe that the inclusion of the HCP layer results in better observance of the governing PDE. Our findings suggest that the HCP-PINN can be more robust to the selection of physics collocation points, and less dependent on collocation point quantity.