arXiv Analytics

Sign in

arXiv:2408.13064 [math.AP]AbstractReferencesReviewsResources

The non-convex planar Least Gradient Problem

Samer Dweik, Piotr Rybka, Ahmad Sabra

Published 2024-08-23Version 1

We study the least gradient problem in bounded regions with Lipschitz boundary in the plane. We provide a set of conditions for the existence of solutions in non-convex simply connected regions. We assume the boundary data is continuous and in the space of functions of bounded variation, and we are interested in solutions that satisfy the boundary conditions in the trace sense. Our method relies on the equivalence of the least gradient problem and the Beckman problem which allows us to use the tools of the optimal transportation theory.

Related articles: Most relevant | Search more
arXiv:1908.09113 [math.AP] (Published 2019-08-24)
Least gradient problem on annuli
arXiv:1709.02185 [math.AP] (Published 2017-09-07)
(Non)uniqueness of minimizers in the least gradient problem
arXiv:2009.04048 [math.AP] (Published 2020-09-09)
Least gradient problem with Dirichlet condition imposed on a part of the boundary