arXiv subjects

Klaus Deckelnick

Publications and source records attributed to Klaus Deckelnick.

32 records · Page 2Linked to original sources

arXiv2021

A Novel $p$-Harmonic Descent Approach Applied to Fluid Dynamic Shape Optimization

We introduce a novel method for the implementation of shape optimziation in fluid dynamics applications, where we propose to use the shape derivative to determine deformation fields with the help of the $p-$ Laplacian for $p > 2$. This approach is closely related to the computation of steepest descent directions of the shape functional in the $W^{1,\infty}-$ topology. Our approach is demonstrated for shape optimization related to drag-minimal free floating bodies. The method is validated against existing approaches with respect to convergence of the optimization algorithm, the obtained shape, and regarding the quality of the computational grid after large deformations. Our numerical results strongly indicate that shape optimization related to the $W^{1,\infty}$-topology -- though numerically more demanding -- seems to be superior over the classical approaches invoking Hilbert space methods, concerning the convergence, the obtained shapes and the mesh quality after large deformations, in particular when the optimal shape features sharp corners.

math.OC↗

arXiv2020

Boundary value problems for a special Helfrich functional for surfaces of revolution

The central object of this article is (a special version of) the Helfrich functional which is the sum of the Willmore functional and the area functional times a weight factor $\varepsilon\ge 0$. We collect several results concerning the existence of solutions to a Dirichlet boundary value problem for Helfrich surfaces of revolution and cover some specific regimes of boundary conditions and weight factors $\varepsilon\ge 0$. These results are obtained with the help of different techniques like an energy method, gluing techniques and the use of the implicit function theorem close to Helfrich cylinders. In particular, concerning the regime of boundary values, where a catenoid exists as a global minimiser of the area functional, existence of minimisers of the Helfrich functional is established for \emph{all} weight factors $\varepsilon\ge 0$. For the singular limit of weight factors $ \varepsilon \nearrow \infty $ they converge uniformly to the catenoid which minimises the surface area in the class of surfaces of revolution.

math.AP↗

arXiv2020

A finite element error analysis for axisymmetric mean curvature flow

We consider the numerical approximation of axisymmetric mean curvature flow with the help of linear finite elements. In the case of a closed genus-1 surface, we derive optimal error bounds with respect to the $L^2$-- and $H^1$--norms for a fully discrete approximation. We perform convergence experiments to confirm the theoretical results, and also present numerical simulations for some genus-0 and genus-1 surfaces, including for the Angenent torus.

math.NA↗

arXiv2020

A Practical Phase Field Method for an Elliptic Surface PDE

We consider a diffuse interface approach for solving an elliptic PDE on a given closed hypersurface. The method is based on a (bulk) finite element scheme employing numerical quadrature for the phase field function and hence is very easy to implement compared to other approaches. We estimate the error in natural norms in terms of the spatial grid size, the interface width and the order of the underlying quadrature rule. Numerical test calculations are presented which confirm the form of the error bounds.

math.NA↗

arXiv2018

Global minima for optimal control of the obstacle problem

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.

math.OC↗

arXiv2018

Hamilton--Jacobi equations on an evolving surface

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.

math.NA↗

arXiv2017

Error analysis for global minima of semilinear optimal control problems

In [1] we consider an optimal control problem subject to a semilinear elliptic PDE together with its variational discretization, where we provide a condition which allows to decide whether a solution of the necessary first order conditions is a global minimum. This condition can be explicitly evaluated at the discrete level. Furthermore, we prove that if the above condition holds uniformly with respect to the discretization parameter the sequence of discrete solutions converges to a global solution of the corresponding limit problem. With the present work we complement our investigations of [1] in that we prove an error estimate for those discrete global solutions. Numerical experiments confirm our analytical findings.

math.OC↗

arXiv2016

Stability and error analysis for a diffuse interface approach to an advection-diffusion equation on a moving surface

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.

math.NA↗

arXiv2016

Numerical Analysis for a System Coupling Curve Evolution to Reaction-Diffusion on the Curve

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.

math.NA↗

arXiv2016

Double obstacle phase field approach to an inverse problem for a discontinuous diffusion coefficient

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.

math.NA↗

arXiv2015

An optimal shape design problem for plates

We consider an optimal shape design problem for the plate equation, where the variable thickness of the plate is the design function. This problem can be formulated as a control in the coefficient PDE-constrained optimal control problem with additional control and state constraints. The state constraints are treated with a Moreau-Yosida regularization of a dual problem. Variational discretization is employed for discrete approximation of the optimal control problem. For discretization of the state in the mixed formulation we compare the standard continuous piecewise linear ansatz with a piecewise constant one based on the lowest-order Raviart-Thomas mixed finite element. We derive bounds for the discretization and regularization errors and also address the coupling of the regularization parameter and finite element grid size. The numerical solution of the optimal control problem is realized with a semismooth Newton algorithm. Numerical examples show the performance of the method.

math.OC↗

arXiv2015

Global minima for semilinear optimal control problems

We consider an optimal control problem subject to a semilinear elliptic PDE together with its variational discretization. We provide a condition which allows to decide whether a solution of the necessary first order conditions is a global minimum. This condition can be explicitly evaluated at the discrete level. Furthermore, we prove that if the above condition holds uniformly with respect to the discretization parameter the sequence of discrete solutions converges to a global solution of the corresponding limit problem. Numerical examples with unique global solutions are presented.

math.OC↗

arXiv2015

Minimising a relaxed Willmore functional for graphs subject to boundary conditions

For a bounded smooth domain in the plane and smooth boundary data we consider the minimisation of the Willmore functional for graphs subject to Dirichlet or Navier boundary conditions. For $H^2$-regular graphs we show that bounds for the Willmore energy imply area and diameter bounds. We then consider the $L^1$-lower semicontinuous relaxation of the Willmore functional, which is shown to be indeed its largest possible extension, and characterise properties of functions with finite relaxed energy. In particular, we deduce compactness and lower-bound estimates for energy-bounded sequences. The lower bound is given by a functional that describes the contribution by the regular part of the graph and is defined for a suitable subset of $BV(Ω)$. We further show that finite relaxed Willmore energy implies the attainment of the Dirichlet boundary data in an appropriate sense, and obtain the existence of a minimiser in $L^\infty\cap BV$ for the relaxed energy. Finally, we extend our results to Navier boundary conditions and more general curvature energies of Canham-Helfrich type.

math.AP↗

arXiv2014

Unfitted finite element methods using bulk meshes for surface partial differential equations

In this paper, we define new unfitted finite element methods for numerically approximating the solution of surface partial differential equations using bulk finite elements. The key idea is that the $n$-dimensional hypersurface, $Γ\subset \mathbb{R}^{n+1}$, is embedded in a polyhedral domain in $\mathbb R^{n+1}$ consisting of a union, $\mathcal{T}_h$, of $(n+1)$-simplices. The finite element approximating space is based on continuous piece-wise linear finite element functions on $\mathcal{T}_h$. Our first method is a sharp interface method, \emph{SIF}, which uses the bulk finite element space in an approximating weak formulation obtained from integration on a polygonal approximation, $Γ_{h}$, of $Γ$. The full gradient is used rather than the projected tangential gradient and it is this which distinguishes \emph{SIF} from the method of [42]. The second method, \emph{NBM}, is a narrow band method in which the region of integration is a narrow band of width $O(h)$. \emph{NBM} is similar to the method of [13]. but again the full gradient is used in the discrete weak formulation. The a priori error analysis in this paper shows that the methods are of optimal order in the surface $L^{2}$ and $H^{1}$ norms and have the advantage that the normal derivative of the discrete solution is small and converges to zero. Our third method combines bulk finite elements, discrete sharp interfaces and narrow bands in order to give an unfitted finite element method for parabolic equations on evolving surfaces. We show that our method is conservative so that it preserves mass in the case of an advection diffusion conservation law. Numerical results are given which illustrate the rates of convergence.

math.NA↗