arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2408.07027physics.comp-phnlin.PS
收藏

高阶Burgers层级方程的多孤子解与基于物理信息神经网络的数据驱动发现

Multi-soliton solutions and data-driven discovery of higher-order Burgers' hierarchy equations with physics informed neural networks

D. A. Kaltsas, L. Magafas, P. Papadopoulou, G. N. Throumoulopoulos

AI总结:

本文利用物理信息神经网络及其梯度增强变体和守恒律约束,首次对高阶Burgers层级方程的多孤子解进行数据驱动逼近与PDE模型发现,验证了其有效性、抗噪性和预测能力。

摘要:

Burgers层级由一系列具有逐阶更高色散项和非线性项的非线性演化偏微分方程(PDE)组成。该层级中著名的成员包括Burgers方程和Sharma-Tasso-Olver方程,它们被广泛应用于等离子体物理、流体力学、光学和生物物理等领域,用于描述非均匀介质中的非线性波。这些方程的各种孤子和多孤子解已被识别,并且孤子的分裂与融合已通过解析和数值技术进行了研究。近年来,深度学习方法,特别是物理信息神经网络(PINNs),已成为求解PDE的新途径。这些方法利用深度神经网络在拟合相关数据的同时最小化PDE残差。尽管PINNs已被应用于Burgers方程和Korteweg-de Vries方程等,但Burgers层级中的高阶成员在此背景下仍未得到探索。在本研究中,我们采用PINN算法来逼近Burgers层级内方程线性组合的多孤子解。这种半监督方法对PDE及相关数据进行编码,确定PDE参数并解析线性组合,从而发现描述数据的PDE。此外,我们采用梯度增强的PINNs(gPINNs)和特定于一般Burgers层级的守恒律来提高训练精度。结果表明,PINNs在描述一般Burgers层级内多孤子解方面具有有效性,对数据噪声水平增加具有鲁棒性,并具有有限但可测量的预测能力。结果还验证了在某些情况下使用增强方法进行训练细化和精度提升的潜力,同时能够发现描述所观测孤立结构的PDE模型。

英文摘要:

The Burgers hierarchy consists of nonlinear evolutionary partial differential equations (PDEs) with progressively higher-order dispersive and nonlinear terms. Notable members of this hierarchy are the Burgers equation and the Sharma-Tasso-Olver equation, which are widely applied in fields such as plasma physics, fluid mechanics, optics, and biophysics to describe nonlinear waves in inhomogeneous media. Various soliton and multi-soliton solutions to these equations have been identified and the fission and fusion of solitons have been studied using analytical and numerical techniques. Recently, deep learning methods, particularly Physics-Informed Neural Networks (PINNs), have emerged as a new approach for solving PDEs. These methods use deep neural networks to minimize PDE residuals while fitting relevant data. Although PINNs have been applied to equations like Burgers' and Korteweg-de Vries, higher-order members of the Burgers hierarchy remain unexplored in this context. In this study, we employ a PINN algorithm to approximate multi-soliton solutions of linear combinations of equations within the Burgers hierarchy. This semi-supervised approach encodes the PDE and relevant data, determining PDE parameters and resolving the linear combination to discover the PDE that describes the data. Additionally, we employ gradient-enhanced PINNs (gPINNs) and a conservation law, specific to the generic Burgers' hierarchy, to improve training accuracy. The results demonstrate the effectiveness of PINNs in describing multi-soliton solutions within the generic Burgers' hierarchy, their robustness to increased levels of data noise, and their limited yet measurable predictive capabilities. They also verify the potential for training refinement and accuracy improvement using enhanced approaches in certain cases, while enabling the discovery of the PDE model that describes the observed solitary structures.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑