Abstract

AbstractDiscontinuities usually appear in solutions of nonlinear conservation laws even though the initial condition is smooth, which leads to great difficulty in computing these solutions numerically. The Runge-Kutta discontinuous Galerkin (RKDG) methods are efficient methods for solving nonlinear conservation laws, which are high-order accurate and highly parallelizable, and can be easily used to handle complicated geometries and boundary conditions. An important component of RKDG methods for solving nonlinear conservation laws with strong discontinuities in the solution is a nonlinear limiter, which is applied to detect discontinuities and control spurious oscillations near such discontinuities. Many such limiters have been used in the literature on RKDG methods. A limiter contains two parts, first to identify the “troubled cells”, namely, those cells which might need the limiting procedure, then to replace the solution polynomials in those troubled cells by reconstructed polynomials which maintain the original cell averages (conservation). [SIAM J. Sci. Comput., 26 (2005), pp. 995–1013.] focused on discussing the first part of limiters. In this paper, focused on the second part, we will systematically investigate and compare a few different reconstruction strategies with an objective of obtaining the most efficient and reliable reconstruction strategy. This work can help with the choosing of right limiters so one can resolve sharper discontinuities, get better numerical solutions and save the computational cost.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.