arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.23901math.NAcs.NAmath-phmath.MP
收藏

深度动能JKO方案用于Vlasov-Fokker-Planck方程

Deep Kinetic JKO schemes for Vlasov-Fokker-Planck Equations

The Ohio State University(俄亥俄州立大学);University of Minnesota(明尼苏达大学);University of South Carolina(南卡罗来纳大学)

Wonjun Lee, Li Wang, Wuchen Li

AI总结:

本文提出基于深度神经网络的数值方法求解动能Fokker-Planck方程,结合线性与非线性情况,通过保守耗散结构构建广义最小化运动方案,并验证其在高维模拟中的有效性。

摘要:

我们引入一种基于深度神经网络的数值方法来求解动能Fokker-Planck方程,包括线性和非线性情况。基于Vlasov型方程的保守耗散结构,我们将一类广义最小化运动方案作为迭代约束最小化问题:保守部分确定约束集,耗散部分定义目标泛函。这导致了经典Jordan-Kinderlehrer-Otto(JKO)方案的类比,称为动能JKO方案。为计算每个动能JKO迭代步骤,我们引入一种粒子近似,其中速度场由深度神经网络参数化。所得算法可解释为一种面向动能的神经微分方程,能够在保持底层PDE变分和结构性质的同时表示高维动能动力学。我们通过广泛的数值实验验证了该方法,并证明所提出的动能JKO-神经ODE框架在高维数值模拟中是有效的。

英文摘要:

We introduce a deep neural network-based numerical method for solving kinetic Fokker Planck equations, including both linear and nonlinear cases. Building upon the conservative dissipative structure of Vlasov-type equations, we formulate a class of generalized minimizing movement schemes as iterative constrained minimization problems: the conservative part determines the constraint set, while the dissipative part defines the objective functional. This leads to an analog of the classical Jordan-Kinderlehrer-Otto (JKO) scheme for Wasserstein gradient flows, and we refer to it as the kinetic JKO scheme. To compute each step of the kinetic JKO iteration, we introduce a particle-based approximation in which the velocity field is parameterized by deep neural networks. The resulting algorithm can be interpreted as a kinetic-oriented neural differential equation that enables the representation of high-dimensional kinetic dynamics while preserving the essential variational and structural properties of the underlying PDE. We validate the method with extensive numerical experiments and demonstrate that the proposed kinetic JKO-neural ODE framework is effective for high-dimensional numerical simulations.

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

↑