Title | ||
---|---|---|
Efficient large scale electromagnetic simulations using dynamically adapted meshes with the discontinuous Galerkin method |
Abstract | ||
---|---|---|
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 from a radar reflector demonstrates the applicability to large scale problems in three-dimensional space. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1016/j.cam.2011.12.005 | J. Computational Applied Mathematics |
Keywords | Field | DocType |
one-dimensional space,hp-adaptive simulation,discontinuous galerkin method,finite element space,local mesh step size,electromagnetic scattering,dynamic mesh adaptation,three-dimensional space,full wave simulation,local degree,electromagnetic energy,efficient large scale electromagnetic,numerical analysis,three dimensional,hp,finite element | Discontinuous Galerkin method,Mathematical optimization,Polygon mesh,Polynomial,Precomputation,Surface integral,Finite element method,Smoothness,Mathematics,Computation | Journal |
Volume | Issue | ISSN |
236 | 18 | Journal of Computational and Applied Mathematics 236 (18) (2012)
4909-4924 |
Citations | PageRank | References |
10 | 0.78 | 8 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sascha M. Schnepp | 1 | 22 | 4.16 |
Thomas Weiland | 2 | 24 | 6.26 |