Least Gradient Problems with Neumann Boundary Condition

Abstract

We study existence of minimizers of the least gradient problem \[∈fv ∈ BVg ∫(x, Dv),\] where BVg=\v ∈ BV(): ∫∂ gv=1\, (x,p): × n → is a convex, continuous, and homogeneous function of degree 1 with respect to the p variable, and g satisfies the comparability condition ∫∂ g dS=0. We prove that for every 0 g ∈ L∞(∂ ) there are infinitely many minimizers in BV(). Moreover there exists a divergence free vector field T∈ (L∞())n that determines the structure of level sets of all minimizers, i.e. T determines Du|Du|, |Du|- a.e. in , for every minimizer u. We also prove some existence results for general 1-Laplacian type equations with Neumann boundary condition. A numerical algorithm is presented that simultaneously finds T and a minimizer of the above least gradient problem. Applications of the results in conductivity imaging are discussed.

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…