Table of Contents
Fetching ...

Efficient Primal-dual Forward-backward Splitting Method for Wasserstein-like Gradient Flows with General Nonlinear Mobilities

Yunhong Deng, Li Wang, Chaozhen Wei

TL;DR

This work develops a novel saddle-point reformulation for the JKO scheme of Wasserstein-like gradient flows with general nonlinear mobilities and solves it via a primal-dual forward-backward (PDFB) splitting method. The approach decouples mobility from the action using a Legendre–Fenchel transform, enabling a fully discrete, structure-preserving scheme on staggered grids that preserves energy dissipation, mass, and positivity. A rigorous convergence analysis shows ergodic convergence of the PDFB iterates with step-size conditions that can be made grid-size independent, and the method is accelerated by convex-splitting as nonlinear preconditioning. Numerical experiments in 1D and 2D, including porous media diffusion, saturated Fokker–Planck, thin-film lubrication, and Cahn–Hilliard-type models, demonstrate accurate, stable performance and computational efficiency, outperforming previous proximal-splitting approaches. The framework is readily adaptable to a broad class of nonlinear mobilities, offering a practical and scalable tool for simulating Wasserstein-like gradient flows.

Abstract

We construct an efficient primal-dual forward-backward (PDFB) splitting method for computing a class of minimizing movement schemes with nonlinear mobility transport distances, and apply it to computing Wasserstein-like gradient flows. This approach introduces a novel saddle point formulation for the minimizing movement schemes, leveraging a support function form from the Benamou-Brenier dynamical formulation of optimal transport. The resulting framework allows for flexible computation of Wasserstein-like gradient flows by solving the corresponding saddle point problem at the fully discrete level, and can be easily extended to handle general nonlinear mobilities. We also provide a detailed convergence analysis of the PDFB splitting method, along with practical remarks on its implementation and application. The effectiveness of the method is demonstrated through several challenging numerical examples.

Efficient Primal-dual Forward-backward Splitting Method for Wasserstein-like Gradient Flows with General Nonlinear Mobilities

TL;DR

This work develops a novel saddle-point reformulation for the JKO scheme of Wasserstein-like gradient flows with general nonlinear mobilities and solves it via a primal-dual forward-backward (PDFB) splitting method. The approach decouples mobility from the action using a Legendre–Fenchel transform, enabling a fully discrete, structure-preserving scheme on staggered grids that preserves energy dissipation, mass, and positivity. A rigorous convergence analysis shows ergodic convergence of the PDFB iterates with step-size conditions that can be made grid-size independent, and the method is accelerated by convex-splitting as nonlinear preconditioning. Numerical experiments in 1D and 2D, including porous media diffusion, saturated Fokker–Planck, thin-film lubrication, and Cahn–Hilliard-type models, demonstrate accurate, stable performance and computational efficiency, outperforming previous proximal-splitting approaches. The framework is readily adaptable to a broad class of nonlinear mobilities, offering a practical and scalable tool for simulating Wasserstein-like gradient flows.

Abstract

We construct an efficient primal-dual forward-backward (PDFB) splitting method for computing a class of minimizing movement schemes with nonlinear mobility transport distances, and apply it to computing Wasserstein-like gradient flows. This approach introduces a novel saddle point formulation for the minimizing movement schemes, leveraging a support function form from the Benamou-Brenier dynamical formulation of optimal transport. The resulting framework allows for flexible computation of Wasserstein-like gradient flows by solving the corresponding saddle point problem at the fully discrete level, and can be easily extended to handle general nonlinear mobilities. We also provide a detailed convergence analysis of the PDFB splitting method, along with practical remarks on its implementation and application. The effectiveness of the method is demonstrated through several challenging numerical examples.

Paper Structure

This paper contains 29 sections, 7 theorems, 168 equations, 12 figures, 1 algorithm.

Key Result

Theorem 1

Let $\rho^{n + 1}$ be the numerical solution given by 2-11, we have

Figures (12)

  • Figure 1: Illustration of the domain decomposition and the discrete variables. Here the dot denotes the location of discrete density in a box, and the arrows denotes the location of normal fluxes of discrete momentum on the bounding faces.
  • Figure 2: Numerical results for porous media diffusion equation in Example 1. (a) The numerical solution at several time steps computed using the PDFB splitting method, where the dash line represents the exact solution given in \ref{['exam_11']}. (b) The energy evolution of the numerical solution. (c) The error of the numerical total mass with respect to the initial total mass over time. (d) The minimal value of the numerical solution over time.
  • Figure 3: The convergence behavior for Example 1. (a) The convergence rate of the PDFB splitting method in each time step. (b) The averaged number of iterations over all time steps and the number of iterations in the first time step with different spatial grid spacing.
  • Figure 4: Numerical results for Example 2 with full implicit mobility scheme. (a) The numerical solution at several time steps. Here the dashed gray line represents the stationary state of the equation with the considered initial value, which has been given in Carrillo2022Carrillo2023. (b) The convergence rate of the PDFB splitting method in several time steps.
  • Figure 5: Numerical results for Example 2 with semi-implicit mobility scheme. (a) The numerical solution at several time steps. (b) The zoom-in figure of the numerical solution singled out by the frame.
  • ...and 7 more figures

Theorems & Definitions (30)

  • Theorem 1: structure-preserving
  • Theorem 2
  • Remark 1
  • Remark 2
  • Remark 3: Comparison with the previous framework
  • Remark 4
  • Remark 5
  • Remark 6: Sparse linear solver
  • Example 1: Otto2001
  • Example 2: Carrillo2022Carrillo2023
  • ...and 20 more