High-order RKDG methods for computational electromagnetics

Min-Hung Chen, Bernardo Cockburn, Fernando Reitich

Research output: Contribution to journalArticle

59 Citations (Scopus)

Abstract

In this paper we introduce a new RKDG method for problems of wave propagation that achieves full high-order convergence in time and space. The novelty of the method resides in the way in which it marches in time. It uses an mth-order m-stage, low storage SSP-RK scheme which is an extension to a class of non-autonomous linear systems of a recently designed method for autonomous linear systems. This extension allows for a high-order accurate treatment of the inhomogeneous, time-dependent terms that enter the semi-discrete problem on account of the physical boundary conditions. Thus, if polynomials of degree k are used in the space discretization, the RKDG method is of overall order m = k + 1, for any k > 0. Moreover, we also show that the attainment of high-order space-time accuracy allows for an efficient implementation of post-processing techniques that can double the convergence order. We explore this issue in a one-dimensional setting and show that the superconvergence of fluxes previously observed in full space-time DG formulations is also attained in our new RKDG scheme. This allows for the construction of higher-order solutions via local interpolating polynomials. Indeed, if polynomials of degree k are used in the space discretization together with a time-marching method of order 2k + 1, a post-processed approximation of order 2k + 1 is obtained. Numerical results in one and two space dimensions are presented that confirm the predicted convergence properties.

Original languageEnglish
Pages (from-to)205-226
Number of pages22
JournalJournal of Scientific Computing
Volume22-23
DOIs
Publication statusPublished - 2005 Jan 1

Fingerprint

Computational Electromagnetics
Computational electromagnetics
High-order Methods
Polynomials
Linear systems
Higher Order
Polynomial
Wave propagation
Discretization
Space-time
Linear Systems
Boundary conditions
Convergence Order
Order of Approximation
Nonautonomous Systems
Superconvergence
Fluxes
Local Solution
Autonomous Systems
Efficient Implementation

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Numerical Analysis
  • Engineering(all)
  • Computational Theory and Mathematics
  • Computational Mathematics
  • Applied Mathematics

Cite this

Chen, Min-Hung ; Cockburn, Bernardo ; Reitich, Fernando. / High-order RKDG methods for computational electromagnetics. In: Journal of Scientific Computing. 2005 ; Vol. 22-23. pp. 205-226.
@article{7ba34f7aaed4455db2cca4a073baf014,
title = "High-order RKDG methods for computational electromagnetics",
abstract = "In this paper we introduce a new RKDG method for problems of wave propagation that achieves full high-order convergence in time and space. The novelty of the method resides in the way in which it marches in time. It uses an mth-order m-stage, low storage SSP-RK scheme which is an extension to a class of non-autonomous linear systems of a recently designed method for autonomous linear systems. This extension allows for a high-order accurate treatment of the inhomogeneous, time-dependent terms that enter the semi-discrete problem on account of the physical boundary conditions. Thus, if polynomials of degree k are used in the space discretization, the RKDG method is of overall order m = k + 1, for any k > 0. Moreover, we also show that the attainment of high-order space-time accuracy allows for an efficient implementation of post-processing techniques that can double the convergence order. We explore this issue in a one-dimensional setting and show that the superconvergence of fluxes previously observed in full space-time DG formulations is also attained in our new RKDG scheme. This allows for the construction of higher-order solutions via local interpolating polynomials. Indeed, if polynomials of degree k are used in the space discretization together with a time-marching method of order 2k + 1, a post-processed approximation of order 2k + 1 is obtained. Numerical results in one and two space dimensions are presented that confirm the predicted convergence properties.",
author = "Min-Hung Chen and Bernardo Cockburn and Fernando Reitich",
year = "2005",
month = "1",
day = "1",
doi = "10.1007/s10915-004-4152-6",
language = "English",
volume = "22-23",
pages = "205--226",
journal = "Journal of Scientific Computing",
issn = "0885-7474",
publisher = "Springer New York",

}

High-order RKDG methods for computational electromagnetics. / Chen, Min-Hung; Cockburn, Bernardo; Reitich, Fernando.

In: Journal of Scientific Computing, Vol. 22-23, 01.01.2005, p. 205-226.

Research output: Contribution to journalArticle

TY - JOUR

T1 - High-order RKDG methods for computational electromagnetics

AU - Chen, Min-Hung

AU - Cockburn, Bernardo

AU - Reitich, Fernando

PY - 2005/1/1

Y1 - 2005/1/1

N2 - In this paper we introduce a new RKDG method for problems of wave propagation that achieves full high-order convergence in time and space. The novelty of the method resides in the way in which it marches in time. It uses an mth-order m-stage, low storage SSP-RK scheme which is an extension to a class of non-autonomous linear systems of a recently designed method for autonomous linear systems. This extension allows for a high-order accurate treatment of the inhomogeneous, time-dependent terms that enter the semi-discrete problem on account of the physical boundary conditions. Thus, if polynomials of degree k are used in the space discretization, the RKDG method is of overall order m = k + 1, for any k > 0. Moreover, we also show that the attainment of high-order space-time accuracy allows for an efficient implementation of post-processing techniques that can double the convergence order. We explore this issue in a one-dimensional setting and show that the superconvergence of fluxes previously observed in full space-time DG formulations is also attained in our new RKDG scheme. This allows for the construction of higher-order solutions via local interpolating polynomials. Indeed, if polynomials of degree k are used in the space discretization together with a time-marching method of order 2k + 1, a post-processed approximation of order 2k + 1 is obtained. Numerical results in one and two space dimensions are presented that confirm the predicted convergence properties.

AB - In this paper we introduce a new RKDG method for problems of wave propagation that achieves full high-order convergence in time and space. The novelty of the method resides in the way in which it marches in time. It uses an mth-order m-stage, low storage SSP-RK scheme which is an extension to a class of non-autonomous linear systems of a recently designed method for autonomous linear systems. This extension allows for a high-order accurate treatment of the inhomogeneous, time-dependent terms that enter the semi-discrete problem on account of the physical boundary conditions. Thus, if polynomials of degree k are used in the space discretization, the RKDG method is of overall order m = k + 1, for any k > 0. Moreover, we also show that the attainment of high-order space-time accuracy allows for an efficient implementation of post-processing techniques that can double the convergence order. We explore this issue in a one-dimensional setting and show that the superconvergence of fluxes previously observed in full space-time DG formulations is also attained in our new RKDG scheme. This allows for the construction of higher-order solutions via local interpolating polynomials. Indeed, if polynomials of degree k are used in the space discretization together with a time-marching method of order 2k + 1, a post-processed approximation of order 2k + 1 is obtained. Numerical results in one and two space dimensions are presented that confirm the predicted convergence properties.

UR - http://www.scopus.com/inward/record.url?scp=17444409297&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=17444409297&partnerID=8YFLogxK

U2 - 10.1007/s10915-004-4152-6

DO - 10.1007/s10915-004-4152-6

M3 - Article

AN - SCOPUS:17444409297

VL - 22-23

SP - 205

EP - 226

JO - Journal of Scientific Computing

JF - Journal of Scientific Computing

SN - 0885-7474

ER -