求解Fokker-Planck方程的近似递推法
Proximal Recursion for Solving the Fokker-Planck Equation
摘要:
我们发展了一种新的方法来解决福克-普朗克或Kolmogorov的向前方程,支配的联合密度函数的时间演化的连续时间随机非线性系统。该方程的数值解对于通过非线性动力系统传播初始条件、参数和强迫不确定性的影响是基本的,并且具有包括但不限于预测、风险评估、非线性滤波和随机控制的应用。我们的方法打破了传统的空间离散化的方法来解决这个二阶偏微分方程(PDE),这在一般情况下,患有“维数灾难”。相反,我们数值求解无穷维的密度函数,这是理论上相当于解决福克-普朗克-柯尔莫哥洛夫偏微分方程的空间中的近似递归。我们表明,随着引入熵正则化的对偶配方,导致一个光滑的凸优化问题,可以通过适当的块坐标迭代实现,并具有快速收敛,由于一定的收缩性能,我们建立。这种方法使无网格实现,导致非常快的计算。
英文摘要:
We develop a new method to solve the Fokker-Planck or Kolmogorov's forward equation that governs the time evolution of the joint probability density function of a continuous-time stochastic nonlinear system. Numerical solution of this equation is fundamental for propagating the effect of initial condition, parametric and forcing uncertainties through a nonlinear dynamical system, and has applications encompassing but not limited to forecasting, risk assessment, nonlinear filtering and stochastic control. Our methodology breaks away from the traditional approach of spatial discretization for solving this second-order partial differential equation (PDE), which in general, suffers from the "curse-of-dimensionality". Instead, we numerically solve an infinite dimensional proximal recursion in the space of probability density functions, which is theoretically equivalent to solving the Fokker-Planck-Kolmogorov PDE. We show that the dual formulation along with the introduction of an entropic regularization, leads to a smooth convex optimization problem that can be implemented via suitable block co-ordinate iteration and has fast convergence due to certain contraction property that we establish. This approach enables meshless implementation leading to remarkably fast computation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。