Related papers: A Characteristic Mapping Method for Tracer Transpo…
Starting from Brenier's relaxed formulation of the incompressible Euler equation in terms of geodesics in the group of measure-preserving diffeomorphisms, we propose a numerical method based on Sinkhorn's algorithm for the entropic…
When analyzing cell trajectories, we often have to deal with noisy data due to the random motion of the cells and possible imperfections in cell center detection. To smooth these trajectories, we present a mathematical model and numerical…
We study the transportation problem on the unit sphere $S^{n-1}$ for symmetric probability measures and the cost function $c(x,y) = \log \frac{1}{\langle x, y \rangle}$. We calculate the variation of the corresponding Kantorovich functional…
A significant drawback of Lagrangian (particle-tracking) reactive transport models has been their inability to properly simulate interactions between solid and liquid chemical phases, such as dissolution and precipitation reactions. This…
In this work we develop a numerical method for solving a type of convex graph-structured tensor optimization problems. This type of problems, which can be seen as a generalization of multi-marginal optimal transport problems with…
The transverse velocities of steadily rotating, non--axisymmetric patterns in flat galaxies may be determined by a purely kinematical method, using two dimensional maps of a tracer surface brightness and radial current density. The…
Tracer tests in natural porous media sometimes show abnormalities that suggest considering a fractional variant of the Advection Diffusion Equation supplemented by a time derivative of non-integer order. We are describing an inverse method…
We demonstrate the effectiveness of one of the many multi-tracer analyses enabled by Optimal Transport (OT) reconstruction. Leveraging a semi-discrete OT algorithm, we determine the displacements between initial and observed positions of…
This paper presents a vector HD-mapping algorithm that formulates the mapping as a tracking task and uses a history of memory latents to ensure consistent reconstructions over time. Our method, MapTracker, accumulates a sensor stream into…
We develop a third-order conservative semi-Lagrangian discontinuous Galerkin (SLDG) scheme for solving linear transport equations on curvilinear unstructured triangular meshes, tailored for complex geometries. To ensure third-order spatial…
We introduce a new method of symmetrization of mappings on the $n$-sphere ($n\geq 2$). They are applied to estimate solutions of quasilinear elliptic partial differential equations of $p$-Laplacian type, with combinations of Dirac measures…
In this work, we apply two meshless methods for the numerical solution of the time-dependent transport equation defined on the sphere in spherical coordinates. The first technique, which was introduced by Mirzaei (BIT Numerical Mathematics,…
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…
A Coefficient Inverse Problem for the radiative transport equation is considered. The globally convergent numerical method, the so-called convexification, is developed. For the first time, the viscosity solution is considered for a boundary…
In this work, we develop a collection of novel methods for the entropic-regularised optimal transport problem, which are inspired by existing mirror descent interpretations of the Sinkhorn algorithm used for solving this problem. These are…
The dynamics of a tracer particle in a glassy matrix of obstacles displays slow complex transport as the free volume approaches a critical value and the void space falls apart. We investigate the emerging subdiffusive motion of the test…
Optimal transport aims to estimate a transportation plan that minimizes a displacement cost. This is realized by optimizing the scalar product between the sought plan and the given cost, over the space of doubly stochastic matrices. When…
This work originates from a heart's images tracking which is to generate an apparent continuous motion, observable through intensity variation from one starting image to an ending one both supposed segmented. Given two images p0 and p1, we…
Scaling algorithms for entropic transport-type problems have become a very popular numerical method, encompassing Wasserstein barycenters, multi-marginal problems, gradient flows and unbalanced transport. However, a standard implementation…
We discuss the mathematical modeling and numerical discretization of transport problems on one-dimensional networks. Suitable coupling conditions are derived that guarantee conservation of mass across network junctions and dissipation of a…