In this talk, a novel discontinuous Galerkin (DG) method is introduced by utilising the principle of discrete least squares. The key idea is to build polynomial approximations by the method of (weighted) discrete least squares instead of usual interpolation or (discrete) $L^2$ projections. The resulting method hence uses more information of the underlying function and provides a more robust alternative to common DG methods. As a result, we are able to construct high-order schemes which are conservative as well as linear stable on any set of collocation points. Several numerical tests highlight the new discontinuous Galerkin discrete least squares (DG-DLS) method to significantly outperform present-day DG methods.
- Numerical Analysis Group Internal Seminar