相关论文: Computation of Optimal Transport with Finite Volum…
The dynamical formulation of optimal transport, also known as Benamou-Brenier formulation or Computational Fluid Dynamics formulation, amounts to write the optimal transport problem as the optimization of a convex functional under a PDE…
We consider a finite volume scheme with two-point flux approximation (TPFA) to approximate a Laplace problem when the solution exhibits no more regularity than belonging to $H^1_0(\Omega)$. We establish in this case some error bounds for…
This article reviews the use of first order convex optimization schemes to solve the discretized dynamic optimal transport problem, initially proposed by Benamou and Brenier. We develop a staggered grid discretization that is well adapted…
In this paper, we deal with numerical approximations for solving the Black-Scholes Partial Differential Equation (PDE). This PDE is well known to be degenerated. The space discretization is performed using the classical finite volume method…
Numerous infinite dimensional dynamical systems arising in different fields have been shown to exhibit a gradient flow structure in the Wasserstein space. We construct Two Point Flux Approximation Finite Volume schemes discretizing such…
We rephrase Monge's optimal transportation (OT) problem with quadratic cost--via a Monge-Amp\`ere equation--as an infinite-dimensional optimization problem, which is in fact a convex problem when the target is a log-concave measure with…
In this paper, we develop novel numerical methods based on the Multi-Point Flux Approximation (MPFA) method to solve the degenerated partial differential equation (PDE) arising from pricing two-assets options. The standard MPFA is used as…
We address an original approach for the convergence analysis of a finite-volume scheme for the approximation of a stochastic diffusion-convection equation with multiplicative noise in a bounded domain of $\mathbb{R}^d$ (with $d=2$ or $3$)…
We propose a fast algorithm to approximate the optimal transport distance. The main idea is to add a Fisher information regularization into the dynamical setting of the problem, originated by Benamou and Brenier. The regularized problem is…
We consider so-called branched transport and variants thereof in two space dimensions. In these models one seeks an optimal transportation network for a given mass transportation task. In two space dimensions, they are closely connected to…
In this paper we introduce a new class of finite element discretizations of the quadratic optimal transport problem based on its dynamical formulation. These generalize to the finite element setting the finite difference scheme proposed by…
We introduce a convergent finite difference method for solving the optimal transportation problem on the sphere. The method applies to both the traditional squared geodesic cost (arising in mesh generation) and a logarithmic cost (arising…
The dynamic formulation of optimal transport, also known as the Benamou-Brenier formulation, has been extended to the unbalanced case by introducing a source term in the continuity equation. When this source term is penalized based on the…
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…
We present a numerical method to solve the optimal transport problem with a quadratic cost when the source and target measures are periodic probability densities. This method is based on a numerical resolution of the corresponding…
We propose a variational finite volume scheme to approximate the solutions to Wasserstein gradient flows. The time discretization is based on an implicit linearization of the Wasserstein distance expressed thanks to Benamou-Brenier formula,…
We present a primal-dual dynamical formulation of the multi-marginal optimal transport problem for (semi-)convex cost functions. Even in the two-marginal setting, this formulation applies to cost functions not covered by the classical…
We demonstrate an iterative scheme to approximate the optimal transportation problem with a discrete target measure under certain standard conditions on the cost function. Additionally, we give a finite upper bound on the number of…
We establish numerical methods for solving the martingale optimal transport problem (MOT) - a version of the classical optimal transport with an additional martingale constraint on transport's dynamics. We prove that the MOT value can be…
Finite volume methods are prevalent in reservoir simulation due to their mass conservation properties and their ability to handle complex grids. However, a simple and consistent finite volume method for elasticity was unavailable until the…