%0 Journal Article %1 jankuhn2020trace %A Jankuhn, Thomas %A Reusken, Arnold %D 2020 %J IMA Journal of Numerical Analysis %K 65d05-computational-geometric-interpolation 65n12-pdes-bvps-stability-and-convergence-of-numerical-methods 65n15-pdes-bvps-error-bounds 65n30-pdes-bvps-finite-elements %N drz062 %R 10.1093/imanum/drz062 %T Trace finite element methods for surface vector-Laplace equations %U https://academic.oup.com/imajna/advance-article-abstract/doi/10.1093/imanum/drz062/5829029? %X In this paper we analyze a class of trace finite element methods 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. The 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 the Lagrange multiplier.

@article{jankuhn2020trace, abstract = {In this paper we analyze a class of trace finite element methods 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. The 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 the Lagrange multiplier.}, added-at = {2020-11-10T02:43:53.000+0100}, author = {Jankuhn, Thomas and Reusken, Arnold}, biburl = {https://www.bibsonomy.org/bibtex/2becefc81ac00edc61fca99dcae32b2da/gdmcbain}, doi = {10.1093/imanum/drz062}, interhash = {a26749a17190a8eedb573c2573752584}, intrahash = {becefc81ac00edc61fca99dcae32b2da}, journal = {IMA Journal of Numerical Analysis}, keywords = {65d05-computational-geometric-interpolation 65n12-pdes-bvps-stability-and-convergence-of-numerical-methods 65n15-pdes-bvps-error-bounds 65n30-pdes-bvps-finite-elements}, number = {drz062}, timestamp = {2020-11-10T02:43:53.000+0100}, title = {Trace finite element methods for surface vector-Laplace equations }, url = {https://academic.oup.com/imajna/advance-article-abstract/doi/10.1093/imanum/drz062/5829029?}, year = 2020 }