2019arXiv (Cornell University)Open access

Superconvergent HDG methods for Maxwell's equations via the $M$-decomposition

Gang Chen, Peter Monk, Yangwen Zhang

Open full text 2 citations

Abstract

The concept of the $M$-decomposition was introduced by Cockburn et al.\ in Math. Comp.\ vol.\ 86 (2017), pp.\ 1609-1641 {to provide criteria to guarantee optimal convergence rates for the Hybridizable Discontinuous Galerkin (HDG) method for coercive elliptic problems}. In that paper they systematically constructed superconvergent hybridizable discontinuous Galerkin (HDG) methods to approximate the solutions of elliptic PDEs on unstructured meshes. In this paper, we use the $M$-decomposition to construct HDG methods for the Maxwell's equations on unstructured meshes in two dimension. In particular, we show the any choice of spaces having an $M$-decomposition, together with sufficiently rich auxiliary spaces, has an optimal error estimate and superconvergence even though the problem is not in general coercive. Unlike the elliptic case, we obtain a superconvergent rate for the curl of the solution, not the solution, and this is confirmed by our numerical experiments.

Open-access reader

About this research paper

What this paper is about

The concept of the $M$-decomposition was introduced by Cockburn et al.\ in Math. Comp.\ vol.\ 86 (2017), pp.\ 1609-1641 {to provide criteria to guarantee optimal convergence rates for the Hybridizable Discontinuous Galerkin (HDG) method for coercive elliptic problems}. In that paper they systematically constructed superconvergent hybridizable discontinuous Galerkin (HDG) methods to approximate the solutions of elliptic PDEs on unstructured meshes. In this paper, we use the $M$-decomposition to construct HDG methods for the Maxwell's equations on unstructured meshes in two dimension. In particular, we show the any choice of spaces having an $M$-decomposition, together with sufficiently rich auxiliary spaces, has an optimal error estimate and superconvergence even though the problem is not in general coercive. Unlike the elliptic case, we obtain a superconvergent rate for the curl of the solution, not the solution, and this is confirmed by our numerical experiments.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The concept of the $M$-decomposition was introduced by Cockburn et al.\ in Math. Comp.\ vol.\ 86 (2017), pp.\ 1609-1641 {to provide criteria to guarantee optimal convergence rates for the Hybridizable Discontinuous Galerkin (HDG) method for coercive elliptic problems}. In that paper they systematically constructed superconvergent hybridizable discontinuous Galerkin (HDG) methods to approximate the solutions of elliptic PDEs on unstructured meshes. In this paper, we use the $M$-decomposition to construct HDG methods for the Maxwell's equations on unstructured meshes in two dimension. In particular, we show the any choice of spaces having an $M$-decomposition, together with sufficiently rich auxiliary spaces, has an optimal error estimate and superconvergence even though the problem is not in general coercive. Unlike the elliptic case, we obtain a superconvergent rate for the curl of the solution, not the solution, and this is confirmed by our numerical experiments.

Key concepts: Superconvergence, Discontinuous Galerkin method, Mathematics, Polygon mesh, Rate of convergence, Applied mathematics, Convergence (economics), Maxwell's equations

Related papers

Back to paper searchBrowse research topicsOriginal source
Superconvergent HDG methods for Maxwell's equations via the $M$-decomposition — Research Paper | ScholarLens