This article is available for purchase or by subscription. See below.
Abstract
|
We analyse the functional
defined on Lipschitz functions with homogeneous Dirichlet boundary conditions. Our analysis
is performed directly on the functional without the need to approximate with smooth
-norms.
We prove that its ground states coincide with multiples of the distance
function to the boundary of the domain. Furthermore, we compute the
-subdifferential
of
and characterize the distance function as the unique nonnegative eigenfunction of the
subdifferential operator. We also study properties of general eigenfunctions,
in particular their nodal sets. Furthermore, we prove that the distance
function can be computed as the asymptotic profile of the gradient flow of
and construct analytic solutions of fast marching type. In addition, we give
a geometric characterization of the extreme points of the unit ball of
.
Finally, we transfer many of these results to a discrete version of the functional
defined on a finite weighted graph. Here, we analyze properties of distance functions
on graphs and their gradients. The main difference between the continuum and
discrete setting is that the distance function is not the unique nonnegative
eigenfunction on a graph.
|
PDF Access Denied
We have not been able to recognize your IP address
34.239.153.44
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for
USD 40.00:
Keywords
distance functions, nonlinear eigenfunctions, extreme
points, gradient flows, weighted graphs
|
Mathematical Subject Classification 2010
Primary: 35P30, 47J10, 47J35, 49R05
Secondary: 05C12, 26A16
|
Milestones
Received: 21 January 2020
Revised: 13 May 2020
Accepted: 3 July 2020
Published: 17 November 2020
|
|