Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Tim Warburton (2013) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: