Abstract
SUMMARYIn this paper, we introduce and test the enhanced stability recovery (ESR) scheme. It is a robust and compact approach to the computation of diffusive fluxes in the framework of discontinuous Galerkin methods. The scheme is characterized by a new recovery basis and a new procedure for the weak imposition of Dirichlet boundary conditions. These features make the method flexible and robust, even in the presence of highly distorted meshes. The implementation is simplified with respect to the original recovery scheme (RDG1x). Furthermore, thanks to the proposed approach, a robust implementation of p‐adaptive algorithms is possible. Numerical tests on unstructured grids show a convergence rate equal to p + 1, where p is the reconstruction order. Comparisons are shown with the original recovery scheme RDG1x and the widely used BR2 method. Results show a significantly larger stability region for the proposed discretization when explicit Runge–Kutta time integration is employed. Interestingly, this advantage grows quickly when the reconstruction order is increased. The proposed procedure for the weak imposition of Dirichlet boundary conditions does not need the introduction of ghost cells, and it is truly local because it does not require data exchange with other elements. It can be easily used with curvilinear wall elements. Several test cases are considered. They include some benchmark tests with the heat equation and compressible Navier–Stokes equations, with test cases designed also to evaluate the behaviour of the scheme with very stretched elements and separated flows. Copyright © 2014 John Wiley & Sons, Ltd.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal for Numerical Methods in Fluids
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.