Guido Kanschat

deal.II—A general-purpose object-oriented finite element library

An overview of the software design and data abstraction decisions chosen for deal.II, a general purpose finite element library written in C++, is given. The library uses advanced object-oriented and data encapsulation techniques to break finite element implementations into smaller blocks that can be arranged to fit users requirements. Through this approach, deal.II supports a large number of different applications covering a wide range of scientific areas, programming methodologies, and application-specific algorithms, without imposing a rigid framework into which they have to fit. A judicious use of programming techniques allows us to avoid the computational costs frequently associated with abstract object-oriented class libraries. The paper presents a detailed description of the abstractions chosen for defining geometric information of meshes and the handling of degrees of freedom associated with finite element spaces, as well as of linear algebra, input/output capabilities and of interfaces to other software, such as visualization tools. Finally, some results obtained with applications built atop deal.II are shown to demonstrate the powerful capabilities of this toolbox.

Superconvergence of the Local Discontinuous Galerkin Method for Elliptic Problems on Cartesian Grids

In this paper, we present a superconvergence result for the local discontinuous Galerkin (LDG) method for a model elliptic problem on Cartesian grids. We identify a special numerical flux for which the L2-norm of the gradient and the L2-norm of the potential are of orders k+1/2 and k+1, respectively, when tensor product polynomials of degree at most k are used; for arbitrary meshes, this special LDG method gives only the orders of convergence of k and k+1/2, respectively. We present a series of numerical examples which establish the sharpness of our theoretical results.

Local Discontinuous Galerkin Methods for the Stokes System

In this paper, we introduce and analyze local discontinuous Galerkin methods for the Stokes system. For a class of shape regular meshes with hanging nodes we derive a priori estimates for the L2-norm of the errors in the velocities and the pressure. We show that optimal-order estimates are obtained when polynomials of degree k are used for each component of the velocity and polynomials of degree k-1 for the pressure, for any

A locally conservative LDG method for the incompressible Navier-Stokes equations

k\ge1

A multilevel discontinuous Galerkin method

. We also consider the case in which all the unknowns are approximated with polynomials of degree k and show that, although the orders of convergence remain the same, the method is more efficient. Numerical experiments verifying these facts are displayed.

The deal.II Library, Version 8.4

In this paper a new local discontinuous Galerkin method for the incompressible stationary Navier-Stokes equations is proposed and analyzed. Four important features render this method unique: its stability, its local conservativity, its high-order accuracy, and the exact satisfaction of the incompressibility constraint. Although the method uses completely discontinuous approximations, a globally divergence-free approximate velocity in H(div; Ω) is obtained by simple, element-by-element post-processing. Optimal error estimates are proven and an iterative procedure used to compute the approximate solution is shown to converge. This procedure is nothing but a discrete version of the classical fixed point iteration used to obtain existence and uniqueness of solutions to the incompressible Navier-Stokes equations by solving a sequence of Oseen problems. Numerical results are shown which verify the theoretical rates of convergence. They also confirm the independence of the number of fixed point iterations with respect to the discretization parameters. Finally, they show that the method works well for a wide range of Reynolds numbers.

The local discontinuous Galerkin method for the Oseen equations

A variable V-cycle preconditioner for an interior penalty finite element discretization for elliptic problems is presented. An analysis under a mild regularity assumption shows that the preconditioner is uniform. The interior penalty method is then combined with a discontinuous Galerkin scheme to arrive at a discretization scheme for an advection-diffusion problem, for which an error estimate is proved. A multigrid algorithm for this method is presented, and numerical experiments indicating its robustness with respect to diffusion coefficient are reported.

A strongly conservative finite element method for the coupling of Stokes and Darcy flow

Abstract This paper provides an overview of the new features of the finite element library deal.II version 8.5.

Convergence Analysis of an Adaptive Interior Penalty Discontinuous Galerkin Method

We introduce and analyze the local discontinuous Galerkin method for the Oseen equations of incompressible fluid flow. For a class of shape-regular meshes with hanging nodes, we derive optimal a priori estimates for the errors in the velocity and the pressure in L 2 - and negative-order norms. Numerical experiments are presented which verify these theoretical results and show that the method performs well for a wide range of Reynolds numbers.

Local error analysis of the interior penalty discontinuous Galerkin method for second order elliptic problems

An H(div) conforming finite element method for solving the linear Biot equations is analyzed. Formulations for the standard mixed method are combined with formulation of interior penalty discontinuous Galerkin method to obtain a consistent scheme. Optimal convergence rates are obtained.We consider a model of coupled free and porous media flow governed by Stokes and Darcy equations with the Beavers-Joseph-Saffman interface condition. This model is discretized using divergence-conforming finite elements for the velocities in the whole domain. Discontinuous Galerkin techniques and mixed methods are used in the Stokes and Darcy subdomains, respectively. This discretization is strongly conservative in H^d^i^v(@W) and we show convergence. Numerical results validate our findings and indicate optimal convergence orders.