Stable Filtering Procedures for Nodal Discontinuous Galerkin Methods

Jan Nordström, Andrew R. Winters

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

We prove that the most common filtering procedure for nodal discontinuous Galerkin (DG) methods is stable. The proof exploits that the DG approximation is constructed from polynomial basis functions and that integrals are approximated with high-order accurate Legendre–Gauss–Lobatto quadrature. The theoretical discussion re-contextualizes stable filtering results for finite difference methods into the DG setting. Numerical tests verify and validate the underlying theoretical results.

Original languageEnglish
Article number17
JournalJournal of Scientific Computing
Volume87
Issue number1
DOIs
Publication statusPublished - Apr 2021

Keywords

  • Discontinuous Galerkin
  • Filtering
  • Stability
  • Transmission problem

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Numerical Analysis
  • General Engineering
  • Computational Theory and Mathematics
  • Computational Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Stable Filtering Procedures for Nodal Discontinuous Galerkin Methods'. Together they form a unique fingerprint.

Cite this