Abstract:
We present a discontinuous Galerkin (DG) multilevel method with hpadaptivity. The main advantage of this multilevel method is that the number of dimensions of the finite element space is independent on the presence of complicated or tiny features in the domain. In other words, even on a very complicated domain, an approximation of the solution can be computed with only a fistful of degrees of freedom. This is possible because two meshes are used: a fine mesh is used to describe the geometry of the domain with all its features, but the problem is actually solved on a coarse mesh that is, in general, too coarse to describe all the geometrical features of the domain. Unlikely other multilevel methods, this method does not perturb the problem, in the sense that the problem solved on the coarse mesh is always a discretization of the continuous problem, no matter how coarse the mesh is. The method itself is a hpadaptive DG extension of composite finite elements (CFEs), introduced by S. Sauter a few years ago.
Standard CFE methods are based on standard continuous Galerkin elements, which means that there are restrictions on the kind of boundary conditions that can be used. These limitations disappear by extending the method to DG elements.
The hpadaptivity algorithm that we present for this multilevel method is completely automatic and capable of exploiting both local polynomialdegreevariation (prefinement) and local mesh subdivision (hrefinement), thereby offering greater flexibility and efficiency than numerical techniques which only incorporate hrefinement or prefinement alone.
This research has been funded by the EPSRC.

Download:
