Stable Filtering Procedures for Nodal Discontinuous Galerkin Methods

Abstract

AbstractWe 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.