اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBranching structures emerging from a continuous optimal transport model
53
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Recently a Dynamic-Monge-Kantorovich formulation of the PDE-based $L^1$-optimal transport problem was presented. The model considers a diffusion equation enforcing the balance of the transported masses with a time-varying conductivity that volves proportionally to the transported flux. In this paper we present an extension of this model that considers a time derivative of the conductivity that grows as a power law of the transport flux with exponent $beta>0$. A sub-linear growth ($0<beta<1$) penalizes the flux intensity and promotes distributed transport, with equilibrium solutions that are reminiscent of Congested Transport Problems. On the contrary, a super-linear growth ($beta>1$) favors flux intensity and promotes concentrated transport, leading to the emergence of steady-state singular and fractal-like configurations that resemble those of Branched Transport Problems. We derive a numerical discretization of the proposed model that is accurate, efficient, and robust for a wide range of scenarios. For $beta>1$ the numerical model is able to reproduce highly irregular and fractal-like formations without any a-priory structural assumption.
قيم البحث
اقرأ أيضاً
In this paper, we give a new characterization of the cut locus of a point on a compact Riemannian manifold as the zero set of the optimal transport density solution of the Monge-Kantorovich equations, a PDE formulation of the optimal transport proble
m with cost equal to the geodesic distance. Combining this result with an optimal transport numerical solver based on the so-called dynamical Monge-Kantorovich approach, we propose a novel framework for the numerical approximation of the cut locus of a point in a manifold. We show the applicability of the proposed method on a few examples settled on 2d-surfaces embedded in $R^{3}$ and discuss advantages and limitations.
We study the connections between Physarum Dynamics and Dynamic Monge Kantorovich (DMK) Optimal Transport algorithms for the solution of Basis Pursuit problems. We show the equivalence between these two models and unveil their dynamic character by sho
wing existence and uniqueness of the solution for all times and constructing a Lyapunov functional with negative Lie-derivative that drives the large-time convergence. We propose a discretization of the equation by means of a combination of implicit time-stepping and Newton method yielding an efficient and robust method for the solution of general basis pursuit problems. Several numerical experiments run on literature benchmark problems are used to show the accuracy, efficiency, and robustness of the proposed method.
In this work, we introduce a nonlinear Lanchester model of NCW-type and study a problem of finding the optimal fire allocation for this model. A Blue party $B$ will fight against a Red party consisting of $A$ and $R$, where $A$ is an independent forc
e and $R$ fights with supports from a supply unit $N$. A battle may consist of several stages but we consider the problem of finding optimal fire allocation for $B$ in the first stage only. Optimal fire allocation is a set of three non-negative numbers whose sum equals to one, such that the remaining force of $B$ is maximal at any instants. In order to tackle this problem, we introduce the notion of textit{threatening rates} which are computed for $A, R, N$ at the beginning of the battle. Numerical illustrations are presented to justify the theoretical findings.
In this article we study the numerical solution of the $L^1$-Optimal Transport Problem on 2D surfaces embedded in $R^3$, via the DMK formulation introduced in [FaccaCardinPutti:2018]. We extend from the Euclidean into the Riemannian setting the DMK m
odel and conjecture the equivalence with the solution Monge-Kantorovich equations, a PDE-based formulation of the $L^1$-Optimal Transport Problem. We generalize the numerical method proposed in [FaccaCardinPutti:2018,FaccaDaneriCardinPutti:2020] to 2D surfaces embedded in $REAL^3$ using the Surface Finite Element Model approach to approximate the Laplace-Beltrami equation arising from the model. We test the accuracy and efficiency of the proposed numerical scheme, comparing our approximate solution with respect to an exact solution on a 2D sphere. The results show that the numerical scheme is efficient, robust, and more accurate with respect to other numerical schemes presented in the literature for the solution of ls$L^1$-Optimal Transport Problem on 2D surfaces.
In this paper, a thermal-dynamical consistent model for mass transfer across permeable moving interfaces is proposed by using the energy variation method. We consider a restricted diffusion problem where the flux across the interface depends on its c
onductance and the difference of the concentration on each side. The diffusive interface phase-field framework used here has several advantages over the sharp interface method. First of all, explicit tracking of the interface is no longer necessary. Secondly, the interfacial condition can be incorporated with a variable diffusion coefficient. A detailed asymptotic analysis confirms the diffusive interface model converges to the existing sharp interface model as the interface thickness goes to zero. A decoupled energy stable numerical scheme is developed to solve this system efficiently. Numerical simulations first illustrate the consistency of theoretical results on the sharp interface limit. Then a convergence study and energy decay test are conducted to ensure the efficiency and stability of the numerical scheme. To illustrate the effectiveness of our phase-field approach, several examples are provided, including a study of a two-phase mass transfer problem where drops with deformable interfaces are suspended in a moving fluid.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
