Lorenz John

Lorenz John, Ulrich Rüde, Barbara Wohlmuth et al.

In this article, we discuss several classes of Uzawa smoothers for the application in multigrid methods in the context of saddle point problems. Beside commonly used variants, such as the inexact and block factorization version, we also introduce a new symmetric method, belonging to the class of Uzawa smoothers. For these variants we unify the analysis of the smoothing properties, which is an important part in the multigrid convergence theory. These methods are applied to the Stokes problem for which all smoothers are implemented as pointwise relaxation methods. Several numerical examples illustrate the theoretical results.

Markus Huber, Lorenz John, Petra Pustejovska et al.

This article proposes modifications to standard low order finite element approximations of the Stokes system with the goal of improving both the approximation quality and the parallel algebraic solution process. Different from standard finite element techniques, we do not modify or enrich the approximation spaces but modify the operator itself to ensure fundamental physical properties such as mass and energy conservation. Special local a~priori correction techniques at re-entrant corners lead to an improved representation of the energy in the discrete system and can suppress the global pollution effect. Local mass conservation can be achieved by an a~posteriori correction to the finite element flux. This avoids artifacts in coupled multi-physics transport problems. Finally, hardware failures in large supercomputers may lead to a loss of data in solution subdomains. Within parallel multigrid, this can be compensated by the accelerated solution of local subproblems. These resilient algorithms will gain importance on future extreme scale computing systems.

Lorenz John, Michael Neilan, Iain Smears

We propose a modified local discontinuous Galerkin (LDG) method for second--order elliptic problems that does not require extrinsic penalization to ensure stability. Stability is instead achieved by showing a discrete Poincaré--Friedrichs inequality for the discrete gradient that employs a lifting of the jumps with one polynomial degree higher than the scalar approximation space. Our analysis covers rather general simplicial meshes with the possibility of hanging nodes.