相关论文: Semi-discrete optimal transport methods for the se…
We compute exact second-order asymptotics for the cost of an optimal solution to the entropic optimal transport problem in the continuous-to-discrete, or semi-discrete, setting. In contrast to the discrete-discrete or continuous-continuous…
We present a parametric family of semi-implicit second order accurate numerical methods for non-conservative and conservative advection equation for which the numerical solutions can be obtained in a fixed number of forward and backward…
The main objective of this paper is to develop a general method of geometric discretization for infinite-dimensional systems and apply this method to the EPDiff equation. The method described below extends one developed by Pavlov et al. for…
A high-order quasi-conservative discontinuous Galerkin (DG) method is proposed for the numerical simulation of compressible multi-component flows. A distinct feature of the method is a predictor-corrector strategy to define the grid…
In this paper we study finite element method for three-dimensional incompressible resistive magnetohydrodynamic equations, in which the velocity, the current density, and the magnetic induction are divergence-free. It is desirable that the…
A semi-Lagrangian Characteristic Mapping method for the solution of the tracer transport equations on the sphere is presented. The method solves for the solution operator of the equations by approximating the inverse of the diffeomorphism…
We introduce and prove convergence of a damped Newton algorithm to approximate solutions of the semi-discrete optimal transport problem with storage fees, corresponding to a problem with hard capacity constraints. This is a variant of the…
This paper is concerned with the approximation of linear and nonlinearinitial-boundary-value problems of pseudo-parabolic equations with Dirichlet boundary conditions. They are discretized in space by spectral Galerkin and collocation…
Recent applications (e.g. active gels and self-assembly of elastic sheets) motivate the need to efficiently simulate the dynamics of thin elastic sheets. We present semi-implicit time stepping algorithms to improve the time step constraints…
Given a fluid equation with reduced Lagrangian $l$ which is a functional of velocity $\MM{u}$ and advected density $D$ given in Eulerian coordinates, we give a general method for semidiscretising the equations to give a canonical…
In this study, a novel semi-implicit second-order temporal scheme combined with the finite element method for space discretization is proposed to solve the coupled system of infiltration and solute transport in unsaturated porous media. The…
In this paper, we propose a tensor type of discretization and optimization process for solving high dimensional partial differential equations. First, we design the tensor type of trial function for the high dimensional partial differential…
In this paper, the finite element Galerkin method is applied to the equations of motion arising in the Kelvin-Voigt viscoelastic fluid flow model, when the forcing function is in $L^{\infty}(L^2)$. Some a priori estimates for the exact…
The dynamic formulation of optimal transport has attracted growing interests in scientific computing and machine learning, and its computation requires to solve a PDE-constrained optimization problem. The classical Eulerian discretization…
In this paper we describe a fast algorithm for generating periodic RVEs of polycrystalline materials. In particular, we use the damped Newton method from semi-discrete optimal transport theory to generate 3D periodic Laguerre tessellations…
For the first time, a globally convergent numerical method is developed and Lipschitz stability estimate is obtained for the challenging problem of travel time tomography in 3D for formally determined incomplete data. The semidiscrete case…
We study the optimal transport problem for $d>2$ discrete measures. This is a linear programming problem on $d$-tensors. It gives a way to compute a "distance" between two sets of discrete measures. We introduce an entropic regularization…
Discrete optimal transport solvers do not scale well on dense large problems since they do not explicitly exploit the geometric structure of the cost function. In analogy to continuous optimal transport we provide a framework to verify…
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…
We investigate the approximation of Monge--Kantorovich problems on general compact metric spaces, showing that optimal values, plans and maps can be effectively approximated via a fully discrete method. First we approximate optimal values…