The planar Least Gradient problem in convex domains
classification
🧮 math.AP
keywords
convexgradientleastproblemsolutionstraceadmissibilityassume
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.