Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Stable discretisations of high-order discontinuous Galerkin methods on equidistant and scattered points (2001.00507v1)

Published 2 Jan 2020 in math.NA and cs.NA

Abstract: In this work, we propose and investigate stable high-order collocation-type discretisations of the discontinuous Galerkin method on equidistant and scattered collocation points. We do so by incorporating the concept of discrete least squares into the discontinuous Galerkin framework. Discrete least squares approximations allow us to construct stable and high-order accurate approximations on arbitrary collocation points, while discrete least squares quadrature rules allow us their stable and exact numerical integration. Both methods are computed efficiently by using bases of discrete orthogonal polynomials. Thus, the proposed discretisation generalises known classes of discretisations of the discontinuous Galerkin method, such as the discontinuous Galerkin collocation spectral element method. We are able to prove conservation and linear $L2$-stability of the proposed discretisations. Finally, numerical tests investigate their accuracy and demonstrate their extension to nonlinear conservation laws, systems, longtime simulations, and a variable coefficient problem in two space dimensions.

Citations (17)

Summary

We haven't generated a summary for this paper yet.