arXiv · 2408.13064
The non-convex planar Least Gradient Problem
Abstract
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.
Explore related subjects
Keep this discovery
Samer Dweik, Piotr Rybka, Ahmad Sabra. 2024-08-23. The non-convex planar Least Gradient Problem. https://arxiv.org/abs/2408.13064
Cite the original work for its findings. Save a collection to share your selection of sources.