pith. sign in

arxiv: 1208.4870 · v1 · pith:EJIWKVKMnew · submitted 2012-08-23 · 🧮 math.NA · math.AP

Numerical solution of the Optimal Transportation problem using the Monge-Ampere equation

classification 🧮 math.NA math.AP
keywords equationmethodmonge-ampereboundarycomputationalconditionsfastgiven
0
0 comments X
read the original abstract

A numerical method for the solution of the elliptic Monge-Ampere Partial Differential Equation, with boundary conditions corresponding to the Optimal Transportation (OT) problem is presented. A local representation of the OT boundary conditions is combined with a finite difference scheme for the Monge-Ampere equation. Newton's method is implemented leading to a fast solver, comparable to solving the Laplace equation on the same grid several times. Theoretical justification for the method is given by a convergence proof in the companion paper (Benamou et al., 2012). In this paper, the algorithm is modified to a simpler compact stencil implementation and details of the implementation are given. Solutions are computed with densities supported on non-convex and disconnected domains. Computational examples demonstrate robust performance on singular solutions and fast computational times.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.