The Deep Minimizing Movement Scheme
arXiv:2109.14851 · doi:10.1016/j.jcp.2023.112518
Abstract
Solutions of certain partial differential equations (PDEs) are often represented by the steepest descent curves of corresponding functionals. Minimizing movement scheme was developed in order to study such curves in metric spaces. Especially, Jordan-Kinderlehrer-Otto studied the Fokker-Planck equation in this way with respect to the Wasserstein metric space. In this paper, we propose a deep learning-based minimizing movement scheme for approximating the solutions of PDEs. The proposed method is highly scalable for high-dimensional problems as it is free of mesh generation. We demonstrate through various kinds of numerical examples that the proposed method accurately approximates the solutions of PDEs by finding the steepest descent direction of a functional even in high dimensions.
arXiv comment29 pages, 17 figures
References in corpus (8)
- DeepXDE: A deep learning library for solving differential equations
- Artificial Neural Networks for Solving Ordinary and Partial Differential Equations
- DGM: A deep learning algorithm for solving partial differential equations
- A unified deep artificial neural network approach to partial differential equations in complex geometries
- Improving the Accuracy and Consistency of the Scalar Auxiliary Variable (SAV) Method with Relaxation
- A generalized SAV approach with relaxation for dissipative systems
- Trend to Equilibrium for the Kinetic Fokker-Planck Equation via the Neural Network Approach
- Convergence of the Allen-Cahn equation with Neumann boundary conditions