pith. sign in

arxiv: 1812.10988 · v1 · pith:2B2QVGEFnew · submitted 2018-12-28 · 🧮 math.AP · math.NA

On the numerical approximation of vectorial absolute minimisers in L^infty

classification 🧮 math.AP math.NA
keywords inftymathbbmathcalminimisersomegaopenabsolutefunctional
0
0 comments X
read the original abstract

Let $\Omega$ be an open set. We consider the supremal functional \[ \tag{1} \label{1} \ \ \ \ \ \ \mathrm{E}_\infty (u,\mathcal{O})\, :=\, \| \mathrm D u \|_{L^\infty( \mathcal{O} )}, \ \ \ \mathcal{O} \subseteq \Omega \text{ open}, \] applied to locally Lipschitz mappings $u : \mathbb R^n \supseteq \Omega \longrightarrow \mathbb R^N$, where $n,N\in \mathbb N$. This is the model functional of Calculus of Variations in $L^\infty$. The area is developing rapidly, but the vectorial case of $N\geq 2$ is still poorly understood. Due to the non-local nature of \eqref{1}, usual minimisers are not truly optimal. The concept of so-called absolute minimisers is the primary contender in the direction of variational concepts. However, these cannot be obtained by direct minimisation and the question of their existence under prescribed boundary data is open when $n,N\geq 2$. Herein we present numerical experiments based on a new method recently proposed by the first author in the papers [33, 35].

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.