The Deep Minimizing Movement Scheme

09/30/2021
by   Hyung Ju Hwang, et al.
0

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.

READ FULL TEXT

page 14

page 15

page 20

research
05/24/2022

Data driven gradient flows

We present a framework enabling variational data assimilation for gradie...
research
11/05/2019

Deep least-squares methods: an unsupervised learning-based numerical method for solving elliptic PDEs

This paper studies an unsupervised deep learning-based numerical approac...
research
07/23/2023

Tackling the Curse of Dimensionality with Physics-Informed Neural Networks

The curse-of-dimensionality (CoD) taxes computational resources heavily ...
research
06/01/2021

Optimizing Functionals on the Space of Probabilities with Input Convex Neural Networks

Gradient flows are a powerful tool for optimizing functionals in general...
research
08/11/2021

Normalized Wolfe-Powell-type Local Minimax Method for Finding Multiple Unstable Solutions of Nonlinear Elliptic PDEs

The local minimax method (LMM) proposed in [Y. Li and J. Zhou, SIAM J. S...
research
03/06/2022

Geometric Hermite Interpolation in ℝ^n by Refinements

We describe a general approach for constructing a broad class of operato...

Please sign up or login with your details

Forgot password? Click here to reset