arXiv · 1712.07150
The planar Least Gradient problem in convex domains
Abstract
We study the two dimensional least gradient problem in a convex, but not necessary strictly convex region. We look for solutions in the space of $BV$ functions satisfying the boundary data $f$ in trace sense. We assume that $f$ is in $BV$ too. We state admissibility conditions on the trace and on the domain that are sufficient for existence of solutions.
Explore related subjects
Keep this discovery
Piotr Rybka, Ahmad Sabra. 2017-12-19. The planar Least Gradient problem in convex domains. https://arxiv.org/abs/1712.07150
Cite the original work for its findings. Save a collection to share your selection of sources.