Turbo post-processing for discontinuous Galerkin methods: one-dimensional linear transport

From MaRDI portal





The paper deals with the postprocessing of a discontinuous piecewise polynomial approximation (degree \(k\ge 0\)) of the one-dimensional transport equation, with periodic boundary conditions. The authors prove that the post-processing is locally conservative and that it provides an approximation of order \(2k + 1\), even for unstructured meshes. The post-processing is obtained recursively in \(k\) iterations, each of which can be carried out in parallel as they only need to perform a single elementwise computation involving information of the upwinding neighboring element. This technique is called turbo post-processing because its computation is extremely fast. The presented numerical experiments validate the predicted theoretical orders of convergence as the meshes are refined.



Cites work









This page was built for publication: Turbo post-processing for discontinuous Galerkin methods: one-dimensional linear transport

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6995708)