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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…