English

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

Analysis of PDEs 2020-07-14 v1

Abstract

We study the two dimensional least gradient problem in convex polygonal sets in the plane, Ω\Omega. 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 Ω\Omega, 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 fBV(Ω)f\in BV(\partial\Omega). The solutions are constructed by a limiting process, which uses solutions to known problems

Keywords

Cite

@article{arxiv.2007.06361,
  title  = {The planar Least Gradient problem in convex domains: the discontinuous case},
  author = {Piotr Rybka and Ahmad Sabra},
  journal= {arXiv preprint arXiv:2007.06361},
  year   = {2020}
}

Comments

This is the second part of the preprint arXiv:1712.07150v1 that we split. The first part can be found in arXiv:1911.08403

R2 v1 2026-06-23T17:04:32.713Z