Thomas Jankuhn

Thomas Jankuhn, Arnold Reusken

In this paper we analyze a class of trace finite element methods (TraceFEM) for the discretization of vector-Laplace equations. A key issue in the finite element discretization of such problems is the treatment of the constraint that the unknown vector field must be tangential to the surface (``tangent condition''). We study three different natural techniques for treating the tangent condition, namely a consistent penalty method, a simpler inconsistent penalty method and a Lagrange multiplier method. A main goal of the paper is to present an analysis that reveals important properties of these three different techniques for treating the tangent constraint. A detailed error analysis is presented that takes the approximation of both the geometry of the surface and the solution of the partial differential equation into account. Error bounds in the energy norm are derived that show how the discretization error depends on relevant parameters such as the degree of the polynomials used for the approximation of the solution, the degree of the polynomials used for the approximation of the level set function that characterizes the surface, the penalty parameter and the degree of the polynomials used for the approximation of Lagrange multiplier.

Sven Groß, Thomas Jankuhn, Maxim A. Olshanskii et al.

We consider a vector-Laplace problem posed on a 2D surface embedded in a 3D domain, which results from the modeling of surface fluids based on exterior Cartesian differential operators. The main topic of this paper is the development and analysis of a finite element method for the discretization of this surface partial differential equation. We apply the trace finite element technique, in which finite element spaces on a background shape-regular tetrahedral mesh that is surface-independent are used for discretization. In order to satisfy the constraint that the solution vector field is tangential to the surface we introduce a Lagrange multiplier. We show well-posedness of the resulting saddle point formulation. A discrete variant of this formulation is introduced which contains suitable stabilization terms and is based on trace finite element spaces. For this method we derive optimal discretization error bounds. Furthermore algebraic properties of the resulting discrete saddle point problem are studied. In particular an optimal Schur complement preconditioner is proposed. Results of a numerical experiment are included.