An optimal-transport finite-particle method for mass diffusion

We formulate a class of velocity-free finite-particle methods for mass transport problems based on a time-discrete incremental variational principle that combines entropy and the cost of particle transport, as measured by the Wasserstein metric. The incremental functional is further spatially discretized into finite particles, i.e., particles characterized by a fixed spatial profile of finite width, each carrying a fixed amount of mass. The motion of the particles is then governed by a competition between the cost of transport, that aims to keep the particles fixed, and entropy maximization, that aims to spread the particles so as to increase the entropy of the system. We show how the optimal width of the particles can be determined variationally by minimization of the governing incremental functional. Using this variational principle, we derive optimal scaling relations between the width of the particles, their number and the size of the domain. We also address matters of implementation including the acceleration of the computation of diffusive forces by exploiting the Gaussian decay of the particle profiles and by instituting fast nearest-neighbor searches. We demonstrate the robustness and versatility of the finite-particle method by means of a test problem concerned with the injection of mass into a sphere. There test results demonstrate the meshless character of the method in any spatial dimension, its ability to redistribute mass particles and follow their evolution in time, its ability to satisfy flux boundary conditions for general domains based solely on a distance function, and its robust convergence characteristics.

[1]  Magdalena Ortiz,et al.  A semi-discrete line-free method of monopoles for dislocation dynamics , 2021, Extreme Mechanics Letters.

[2]  XiaoBai Li,et al.  The Hot Optimal Transportation Meshfree (HOTM) method for materials under extreme dynamic thermomechanical conditions , 2020 .

[3]  H. Lensch,et al.  GGNN: Graph-Based GPU Nearest Neighbor Search , 2019, IEEE Transactions on Big Data.

[4]  Karl-Theodor Sturm,et al.  Heat flow with Dirichlet boundary conditions via optimal transport and gluing of metric measure spaces , 2018, Calculus of Variations and Partial Differential Equations.

[5]  Peter Wriggers,et al.  Metal particle fusion analysis for additive manufacturing using the stabilized optimal transportation meshfree method , 2018, Computer Methods in Applied Mechanics and Engineering.

[6]  M. Ortiz,et al.  A line-free method of monopoles for 3D dislocation dynamics , 2018, Journal of the Mechanics and Physics of Solids.

[7]  Susana López-Querol,et al.  Optimal transportation meshfree method in geotechnical engineering problems under large deformation regime , 2018, International Journal for Numerical Methods in Engineering.

[8]  Peter Wriggers,et al.  Stabilization algorithm for the optimal transportation meshfree approximation scheme , 2018 .

[9]  J. Carrillo,et al.  A blob method for diffusion , 2017, Calculus of Variations and Partial Differential Equations.

[10]  Michael Ortiz,et al.  Geometrically exact time‐integration mesh‐free schemes for advection‐diffusion problems derived from optimal transportation theory and their connection with particle methods , 2017, 1703.02165.

[11]  Xuemin Lin,et al.  Approximate Nearest Neighbor Search on High Dimensional Data — Experiments, Analyses, and Improvement , 2016, IEEE Transactions on Knowledge and Data Engineering.

[12]  S. Dweik Optimal Transportation with Boundary Costs and Summability Estimates on the Transport Density , 2016, 1609.08418.

[13]  F. Santambrogio,et al.  Summability estimates on transport densities with Dirichlet regions on the boundary via symmetrization techniques , 2016, ESAIM: Control, Optimisation and Calculus of Variations.

[14]  J. Carrillo,et al.  Numerical Study of a Particle Method for Gradient Flows , 2015, 1512.03029.

[15]  David G. Lowe,et al.  Scalable Nearest Neighbor Algorithms for High Dimensional Data , 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Gideon Simpson,et al.  Kullback-Leibler Approximation for Probability Measures on Infinite Dimensional Spaces , 2013, SIAM J. Math. Anal..

[17]  Bernd Schmidt,et al.  On the Infinite Particle Limit in Lagrangian Dynamics and Convergence of Optimal Transportation Meshfree Methods , 2013, Multiscale Model. Simul..

[18]  Michael Ortiz,et al.  Convergent meshfree approximation schemes of arbitrary order and smoothness , 2012 .

[19]  Bernd Schmidt,et al.  Convergence Analysis of Meshfree Approximation Schemes , 2011, SIAM J. Numer. Anal..

[20]  Karl-Theodor Sturm,et al.  Optimal transport from Lebesgue to Poisson , 2010, 1012.3845.

[21]  Sara Daneri,et al.  Lecture notes on gradient flows and optimal transport , 2010, Optimal Transport.

[22]  Bo Li,et al.  Optimal transportation meshfree approximation schemes for fluid and plastic flows , 2010 .

[23]  Nicola Gigli,et al.  A new transportation distance between non-negative measures, with applications to gradients flows with Dirichlet boundary conditions , 2010 .

[24]  Romesh C. Batra,et al.  Modified smoothed particle hydrodynamics method and its application to transient problems , 2004 .

[25]  D. Kinderlehrer,et al.  Dynamics of the fokker-planck equation , 1999 .

[26]  J. K. Chen,et al.  An improvement for tensile instability in smoothed particle hydrodynamics , 1999 .

[27]  D. Kinderlehrer,et al.  Free energy and the Fokker-Planck equation , 1997 .

[28]  W. Gangbo,et al.  The geometry of optimal transportation , 1996 .

[29]  Wing Kam Liu,et al.  Reproducing kernel particle methods , 1995 .

[30]  D. Sulsky,et al.  A particle method for history-dependent materials , 1993 .

[31]  Jeffrey K. Uhlmann,et al.  Satisfying General Proximity/Similarity Queries with Metric Trees , 1991, Inf. Process. Lett..

[32]  Robert F. Sproull,et al.  Refinements to nearest-neighbor searching ink-dimensional trees , 1991, Algorithmica.

[33]  M. Knott,et al.  On the optimal mapping of distributions , 1984 .

[34]  J. Monaghan Why Particle Methods Work , 1982 .

[35]  I. Olkin,et al.  The distance between two random vectors with given dispersion matrices , 1982 .

[36]  D. Dowson,et al.  The Fréchet distance between multivariate normal distributions , 1982 .

[37]  L. Lucy A numerical approach to the testing of the fission hypothesis. , 1977 .

[38]  Jon Louis Bentley,et al.  An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.

[39]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[40]  Keinosuke Fukunaga,et al.  A Branch and Bound Algorithm for Computing k-Nearest Neighbors , 1975, IEEE Transactions on Computers.

[41]  Ailsa H. Land,et al.  An Automatic Method of Solving Discrete Programming Problems , 1960 .

[42]  Michael Ortiz,et al.  Material-point erosion simulation of dynamic fragmentation of metals , 2015 .

[43]  Yann Brenier,et al.  A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem , 2000, Numerische Mathematik.

[44]  D. Kinderlehrer,et al.  THE VARIATIONAL FORMULATION OF THE FOKKER-PLANCK EQUATION , 1996 .

[45]  C. Givens,et al.  A class of Wasserstein metrics for probability distributions. , 1984 .