$p$-adaptive algorithms in Discontinuous Galerkin solutions to the time-domain Maxwell's equations

Abstract

The Discontinuous Galerkin time-domain method is well suited for adaptive algorithms to solve the time-domain Maxwell's equations and depends on robust and economically computable drivers. Adaptive algorithms utilize local indicators to dynamically identify regions and assign spatial operators of varying accuracy in the computational domain. This work identifies requisite properties of adaptivity drivers and develops two methods, a feature-based method guided by gradients of local field, and another utilizing the divergence error often found in numerical solution to the time-domain Maxwell's equations. Results for canonical testcases of electromagnetic scattering are presented, highlighting key characteristics of both methods, and their computational performance.

References in corpus (3)

• Frequency-explicit a posteriori error estimates for finite element discretizations of Maxwell's equations
• Frequency-explicit a posteriori error estimates for discontinuous Galerkin discretizations of Maxwell's equations
• Divergence error based $p$-adaptive discontinuous Galerkin solution of time-domain Maxwell's equations