Abstract
The low-storage curvilinear discontinuous Galerkin (LSC-DG) method reduces the storage requirements for solving symmetric and linear linear symmetric conservation laws in curvilinear domains when compared to the standard discontinuous Galerkin method. We perform a semidiscrete, a priori convergence analysis of LSC-DG and determine sufficient conditions on sequences of meshes to guarantee the same rate of convergence as the original upwind DG method on curvilinear domains. Computational results confirm the optimal order convergence on sample mesh sequences that satisfy the sufficiency conditions. Additional results show that the sufficient conditions for optimal order convergence of LSC-DG may also be necessary conditions.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
