Dispersion and dissipation error in high-order Runge-Kutta discontinuous Galerkin discretisations of the Maxwell equations

Different time-stepping methods for a nodal high-order discontinuous Galerkin discretisation of the Maxwell equations are discussed. A comparison between the most popular choices of Runge-Kutta (RK) methods is made from the point of view of accuracy and computational work. By choosing the strong-stability-preserving Runge-Kutta (SSP-RK) time-integration method of order consistent with the polynomial order of the spatial discretisation, better accuracy can be attained compared with fixed-order schemes. Moreover, this comes without a significant increase in the computational work. A numerical Fourier analysis is performed for this Runge-Kutta discontinuous Galerkin (RKDG) discretisation to gain insight into the dispersion and dissipation properties of the fully discrete scheme. The analysis is carried out on both the one-dimensional and the two-dimensional fully discrete schemes and, in the latter case, on uniform as well as on non-uniform meshes. It also provides practical information on the convergence of the dissipation and dispersion error up to polynomial order 10 for the one-dimensional fully discrete scheme

A Space-Time Discontinuous Galerkin Trefftz Method for time dependent Maxwell's equations

We consider the discretization of electromagnetic wave propagation problems by a discontinuous Galerkin Method based on Trefftz polynomials. This method fits into an abstract framework for space-time discontinuous Galerkin methods for which we can prove consistency, stability, and energy dissipation without the need to completely specify the approximation spaces in detail. Any method of such a general form results in an implicit time-stepping scheme with some basic stability properties. For the local approximation on each space-time element, we then consider Trefftz polynomials, i.e., the subspace of polynomials that satisfy Maxwell's equations exactly on the respective element. We present an explicit construction of a basis for the local Trefftz spaces in two and three dimensions and summarize some of their basic properties. Using local properties of the Trefftz polynomials, we can establish the well-posedness of the resulting discontinuous Galerkin Trefftz method. Consistency, stability, and energy dissipation then follow immediately from the results about the abstract framework. The method proposed in this paper therefore shares many of the advantages of more standard discontinuous Galerkin methods, while at the same time, it yields a substantial reduction in the number of degrees of freedom and the cost for assembling. These benefits and the spectral convergence of the scheme are demonstrated in numerical tests

Efficient Large Scale Electromagnetics Simulations Using Dynamically Adapted Meshes with the Discontinuous Galerkin Method

A framework for performing dynamic mesh adaptation with the discontinuous Galerkin method (DGM) is presented. Adaptations include modifications of the local mesh step size (h-adaptation) and the local degree of the approximating polynomials (p-adaptation) as well as their combination. The computation of the approximation within locally adapted elements is based on projections between finite element spaces (FES), which are shown to preserve an upper limit of the electromagnetic energy. The formulation supports high level hanging nodes and applies precomputation of surface integrals for increasing computational efficiency. Error and smoothness estimates based on interface jumps are presented and applied to the fully hp-adaptive simulation of two examples in one-dimensional space. A full wave simulation of electromagnetic scattering form a radar reflector demonstrates the applicability to large scale problems in three-dimensional space.Comment: 33 pages, 8 figures, submitted to Journal of Computational and Applied Mathematic