Authors: Kuzmin, Dmitri
Hajduk, Hennes
Rupp, Andreas
Title: Locally bound-preserving enriched Galerkin methods for the linear advection equation
Language (ISO): en
Abstract: In this work, we introduce algebraic flux correction schemes for enriched (P1 ⊕ P0 and Q1 ⊕ P0) Galerkin discretizations of the linear advection equation. The piecewise-constant component stabilizes the continuous Galerkin approximation without introducing free parameters. However, violations of discrete maximum principles are possible in the neighborhood of discontinuities and steep fronts. To keep the cell averages and the degrees of freedom of the continuous P1/Q1 component in the admissible range, we limit the fluxes and element contributions, the complete removal of which would correspond to first-order upwinding. The first limiting procedure that we consider in this paper is based on the flux-corrected transport (FCT) paradigm. It belongs to the family of predictor-corrector algorithms and requires the use of small time steps. The second limiting strategy is monolithic and produces nonlinear problems with well-defined residuals. This kind of limiting is well suited for stationary and time-dependent problems alike. The need for inverting consistent mass matrices in explicit strong stability preserving Runge-Kutta time integrators is avoided by reconstructing nodal time derivatives from cell averages. Numerical studies are performed for standard 2D test problems.
Subject Headings: linear advection equation
convex limiting
flux-corrected transport
discrete maximum principles
enriched Galerkin method
Subject Headings (RSWK): Galerkin-Methode
FCT-Verfahren
URI: http://hdl.handle.net/2003/38536
http://dx.doi.org/10.17877/DE290R-20455
Issue Date: 2020-01
Appears in Collections:Ergebnisberichte des Instituts für Angewandte Mathematik

Files in This Item:
File Description SizeFormat 
Ergebnisbericht Nr. 624.pdfDNB3.7 MBAdobe PDFView/Open


This item is protected by original copyright



This item is protected by original copyright rightsstatements.org