اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدNumerical Solution of the $L^1$-Optimal Transport Problem on Surfaces
85
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 model 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.
قيم البحث
اقرأ أيضاً
For the first time, we develop a convergent numerical method for the llinear integral equation derived by M.M. Lavrentev in 1964 with the goal to solve a coefficient inverse problem for a wave-like equation in 3D. The data are non overdetermined. Con
vergence analysis is presented along with the numerical results. An intriguing feature of the Lavrentev equation is that, without any linearization, it reduces a highly nonlinear coefficient inverse problem to a linear integral equation of the first kind. Nevertheless, numerical results for that equation, which use the data generated for that coefficient inverse problem, show a good reconstruction accuracy. This is similar with the classical Gelfand-Levitan equation derived in 1951, which is valid in the 1D case.
When time-dependent partial differential equations (PDEs) are solved numerically in a domain with curved boundary or on a curved surface, mesh error and geometric approximation error caused by the inaccurate location of vertices and other interior gr
id points, respectively, could be the main source of the inaccuracy and instability of the numerical solutions of PDEs. The role of these geometric errors in deteriorating the stability and particularly the conservation properties are largely unknown, which seems to necessitate very fine meshes especially to remove geometric approximation error. This paper aims to investigate the effect of geometric approximation error by using a high-order mesh with negligible geometric approximation error, even for high order polynomial of order p. To achieve this goal, the high-order mesh generator from CAD geometry called NekMesh is adapted for surface mesh generation in comparison to traditional meshes with non-negligible geometric approximation error. Two types of numerical tests are considered. Firstly, the accuracy of differential operators is compared for various p on a curved element of the sphere. Secondly, by applying the method of moving frames, four different time-dependent PDEs on the sphere are numerically solved to investigate the impact of geometric approximation error on the accuracy and conservation properties of high-order numerical schemes for PDEs on the sphere.
This article is an account of the NABUCO project achieved during the summer camp CEMRACS 2019 devoted to geophysical fluids and gravity flows. The goal is to construct finite difference approximations of the transport equation with nonzero incoming b
oundary data that achieve the best possible convergence rate in the maximum norm. We construct, implement and analyze the so-called inverse Lax-Wendroff procedure at the incoming boundary. Optimal convergence rates are obtained by combining sharp stability estimates for extrapolation boundary conditions with numerical boundary layer expansions. We illustrate the results with the Lax-Wendroff and O3 schemes.
Given a function $uin L^2=L^2(D,mu)$, where $Dsubset mathbb R^d$ and $mu$ is a measure on $D$, and a linear subspace $V_nsubset L^2$ of dimension $n$, we show that near-best approximation of $u$ in $V_n$ can be computed from a near-optimal budget of
$Cn$ pointwise evaluations of $u$, with $C>1$ a universal constant. The sampling points are drawn according to some random distribution, the approximation is computed by a weighted least-squares method, and the error is assessed in expected $L^2$ norm. This result improves on the results in [6,8] which require a sampling budget that is sub-optimal by a logarithmic factor, thanks to a sparsification strategy introduced in [17,18]. As a consequence, we obtain for any compact class $mathcal Ksubset L^2$ that the sampling number $rho_{Cn}^{rm rand}(mathcal K)_{L^2}$ in the randomized setting is dominated by the Kolmogorov $n$-width $d_n(mathcal K)_{L^2}$. While our result shows the existence of a randomized sampling with such near-optimal properties, we discuss remaining issues concerning its generation by a computationally efficient algorithm.
We show stability of the $L^2$-projection onto Lagrange finite element spaces with respect to (weighted) $L^p$ and $W^{1,p}$-norms for any polynomial degree and for any space dimension under suitable conditions on the mesh grading. This includes $W^{
1,2}$-stability in two space dimensions for any polynomial degree and meshes generated by newest vertex bisection. Under realistic but conjectured assumptions on the mesh grading in three dimensions we show $W^{1,2}$-stability for all polynomial degrees. We also propose a modified bisection strategy that leads to better $W^{1,p}$-stability. Moreover, we investigate the stability of the $L^2$-projection onto Crouzeix-Raviart elements.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
