科研之友
微信
新浪微博
Facebook
分享链接
摘要
We deal with an optimal matching problem, that is, we want to transport two measures to a given place (the target set), where they will match, minimizing the total transport cost that in our case is given by the sum of the Euclidean distance that each measure is transported. We show that such a problem has a solution with matching measure concentrated on the boundary of the target set. Furthermore we perform a method to approximate the solution of the problem taking the limit as p -%26gt;infinity in a system of PDEs of p-Laplacian type.
- 出版日期2014
