2000 character limit reached
The planar Least Gradient problem in convex domains (1712.07150v1)
Published 19 Dec 2017 in math.AP
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.