Klaus Deckelnick

John W. Barrett, Klaus Deckelnick, Vanessa Styles

We consider a finite element approximation for a system consisting of the evolution of a closed planar curve by forced curve shortening flow coupled to a reaction-diffusion equation on the evolving curve. The scheme for the curve evolution is based on a parametric description allowing for tangential motion, whereas the discretisation for the PDE on the curve uses an idea from [6]. We prove optimal error bounds for the resulting fully discrete approximation and present numerical experiments. These confirm our estimates and also illustrate the advantage of the tangential motion of the mesh points in practice.

Klaus Deckelnick, Charles M. Elliott, Vanessa Styles

We propose a double obstacle phase field approach to the recovery of piece-wise constant diffusion coefficients for elliptic partial differential equations. The approach to this inverse problem is that of optimal control in which we have a quadratic fidelity term to which we add a perimeter regularisation weighted by a parameter sigma. This yields a functional which is optimised over a set of diffusion coefficients subject to a state equation which is the underlying elliptic PDE. In order to derive a problem which is amenable to computation the perimeter functional is relaxed using a gradient energy functional together with an obstacle potential in which there is an interface parameter epsilon. This phase field approach is justified by proving Gamma-convergence to the functional with perimeter regularisation as epsilon tends to zero. The computational approach is based on a finite element approximation. This discretisation is shown to converge in an appropriate way to the solution of the phase field problem. We derive an iterative method which is shown to yield an energy decreasing sequence converging to a discrete critical point. The efficacy of the approach is illustrated with numerical experiments.

Klaus Deckelnick, Vanessa Styles

In this paper we analyze a fully discrete numerical scheme for solving a parabolic PDE on a moving surface. The method is based on a diffuse interface approach that involves a level set description of the moving surface. Under suitable conditions on the spatial grid size, the time step and the interface width we obtain stability and error bounds with respect to natural norms. Furthermore, we present test calculations that confirm our analysis.

Ahmad Ahmad Ali, Klaus Deckelnick, Michael Hinze

An optimal control problem subject to an elliptic obstacle problem is studied. We obtain a numerical approximation of this problem by discretising the PDE obtained via a Moreau--Yosida type penalisation. For the resulting discrete control problem we provide a condition that allows to decide whether a solution of the necessary first order conditions is a global minimum. In addition we show that the corresponding result can be transferred to the limit problem provided that the above condition holds uniformly in the penalisation and discretisation parameters. Numerical examples with unique global solutions are presented.

Klaus Deckelnick, Vanessa Styles

The paper is concerned with the error analysis of a numerical scheme for the approximation of parametric mean curvature flow. The scheme we study is based on a reparametrization using the DeTurck trick and was proposed by Elliott and Fritz in [15]. In the semidiscrete case, for a spatial discretization by finite elements of order $k \geq 2$ we prove an optimal $H^1$-error estimate for the position vector. We present numerical experiments that confirm this error bound and demonstrate that the scheme has good properties with respect to the distribution of mesh points as already observed in [15].

Klaus Deckelnick, Charles M. Elliott, Tatsu-Hiko Miura et al.

We consider the well-posedness and numerical approximation of a Hamilton--Jacobi equation on an evolving hypersurface in $\mathbb R^3$. Definitions of viscosity sub- and supersolutions are extended in a natural way to evolving hypersurfaces and provide uniqueness by comparison. An explicit in time monotone numerical approximation is derived on evolving interpolating triangulated surfaces. The scheme relies on a finite volume discretisation which does not require acute triangles. The scheme is shown to be stable and consistent leading to an existence proof via the proof of convergence. Finally an error bound is proved of the same order as in the flat stationary case.