The planar Least Gradient problem in convex domains: the discontinuous case

preprint2020arXivOpen access

Abstract

We study the two dimensional least gradient problem in convex polygonal sets in the plane, ΩΩ. We show the existence of solutions when the boundary data ff are attained in the trace sense. The main difficulty here is a possible discontinuity of ff. Moreover, due to the lack of strict convexity of ΩΩ, the classical results are not applicable. We state the admissibility conditions on the boundary datum ff, that are sufficient for establishing an existence result. One of them is that f∈BV(∂Ω)f\in BV(\partialΩ). The solutions are constructed by a limiting process, which uses solutions to known problems

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.