JGJörg Grande

Jörg Grande

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Jörg Grande has a total of 3 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Analysis of a high order Trace Finite Element Method for PDEs on level set surfaces

    by Jörg Grande, Christoph Lehrenfeld, Arnold Reusken

    We present a new high order finite element method for the discretization of partial differential equations on stationary smooth surfaces which are implicitly described as the zero level of a level set function. The discretization is based on a trace finite element technique. The higher discretization accuracy is obtained by using an isoparametric mapping of the volume mesh, based on the level set function, as introduced in [C. Lehrenfeld, \emph{High order unfitted finite element methods on level set domains using isoparametric mappings}, Comp. Meth. Appl. Mech. Engrg. 2016]. The resulting trace finite element method is easy to implement. We present an error analysis of this method and derive optimal order $H^1(\Gamma)$-norm error bounds. A second topic of this paper is a unified analysis of several stabilization methods for trace finite element methods. Only a stabilization method which is based on adding an anisotropic diffusion in the volume mesh is able to control the condition number of the stiffness matrix also for the case of higher order discretizations. Results of numerical experiments are included which confirm the theoretical findings on optimal order discretization errors and uniformly bounded condition numbers.

  • An accurate and robust finite element level set redistancing method

    by Patrick Esser, Jörg Grande

    A new redistancing method for piecewise polynomial finite element level set functions is introduced. The method directly computes the distance to the implicitly given discrete level set. Rigorous error bounds and numerical experiments are provided. Both show that, up to constants, the method is as good as the nodal interpolation of the computationally unavailable signed-distance function of the continuous level set.