Wonjun Lee

Assistant Professor
Department of Mathematics
The Ohio State University
Office : Math Tower MW548
profile photo

Wasserstein Gradient Flows

PDF Code

This page briefly describes the paper, The back-and-forth method for Wasserstein gradient flows [1]. To see the details, check the PDF and Code links above.


In this project, we proposed a new algorithm to compute the following class of PDEs (also known as Darcy's law):

tρ(ρϕ)=0ϕ=δU(ρ)

where ρ is a mass density, ϕ is a pressure, and δU(ρ) is the Frechet derivative of U at ρ. This class of PDEs models various physical phenomena such as fluid flow, heat transfer, aggregation-diffusion, and crowd motion. For example, if

U(ρ)=1m1ρmdx,

then the PDE becomes the porous medium equation,

tρΔ(ρm)=0.

We solve this PDE via the JKO scheme [2], a discrete-in-time variational formulation of the PDE. Given ρ(0), the scheme iterates

ρ(n+1)=argminρU(ρ)+12τW2(ρ,ρ(n))2

where τ is a time step size, W2 is a 2-Wasserstein distance, and ρ(n) is an approximate solution ρ(nτ,) of the PDE. We solve developed an algorithm to solve the JKO scheme expanding upon the back-and-forth method (BFM) [3], a fast numerical method for optimal transport problems.

Below are some of our results solving difficult PDE problems including porous medium equations, incompressible flows, and aggregation-diffusion equations.

Videos

Porous medium equations with an obstacle and potential

U(ρ)=13ρ4(x)+V(x)dxV(x)=xa2,a=(0.9,0.9).

Aggregation-diffusion equations

U(ρ)=ρ2(x)dx+ρ(x)xy2ρ(y)dxdy.

Incompressible flows (crowd motion) with an obstacle and potential

U(ρ)=u(ρ(x))+V(x)dxV(x)=xa2,a=(0.9,0.9)

u(t)={0if 0t1otherwise.

References

[1] Matt Jacobs, Wonjun Lee and Flavien Léger. The back-and-forth method for Wasserstein gradient flows. 2020.

[2] Richard Jordan and David Kinderlehrer and Felix Otto. The variational formulation of the Fokker-Planck equation. SIAM journal on mathematical analysis 29.1 (1998): 1–17.

[3] Matt Jacobs and Flavien Léger. A fast approach to optimal transport: The back-and-forth method. Numerische Mathematik (2020): 1-32.