In this paper, we focus on error estimates to smooth solutions of semi-discrete discontinuous Galerkin (DG) methods with quadrature rules for scalar conservation laws. The main techniques we use are energy estimate and Taylor expansion first introduced by Zhang and Shu. We show that, with ${P}^k$ (piecewise polynomials of degree $k$) finite elements in 1D problems, if the quadrature over elements is exact for polynomials of degree $(2k)$, error estimates of $O(h^{k+1/2})$ are obtained for general monotone fluxes, and optimal estimates of $O(h^{k+1})$ are obtained for upwind fluxes. For multidimensional problems, if in addition quadrature over edges is exact for polynomials of degree $(2k+1)$, error estimates of $O(h^k)$ are obtained for general monotone fluxes, and $O(h^{k+1/2})$ are obtained for monotone and sufficiently smooth numerical fluxes. Numerical results validate our analysis.

No abstract uploaded!

Abstract In this paper, we investigate numerical approximations of the scalar conservation law with the Caputo derivative, which introduces the memory effect. We construct the first order and the second order explicit upwind schemes for such equations, which are shown to be conditionally $\ell^1$ contracting and TVD. However, the Caputo derivative leads to the modified CFL-type stability condition, $ (\Delta t)^{\alpha} = O(\Delta x)$, where $\alpha \in (0,1]$ is the fractional exponent in the derivative. When $\alpha$ small, such strong constraint makes the numerical implementation extremely impractical. We have then proposed the implicit upwind scheme to overcome this issue, which is proved to be unconditionally $\ell^1$ contracting and TVD. Various numerical tests are presented to validate the properties of the methods and provide more numerical evidence in interpreting the memory effect in conservation laws.

Solutions to conservation laws satisfy the monotonicity property: the number of local extrema is a non-increasing function of time, and local maximum/minimum values decrease/increase monotonically in time. This paper investigates this property from a numerical standpoint. We introduce a class of fully discrete in space and time, high order accurate, difference schemes, called generalized monotone schemes. Convergence toward the entropy solution is proven via a new technique of proof, assuming that the initial data has a finite number of extremum values only, and the flux-function is strictly convex. We define discrete paths of extrema by tracking local extremum values in the approximate solution. In the course of the analysis we establish the pointwise convergence of the trace of the solution along a path of extremum. As a corollary, we obtain a proof of convergence for a MUSCL-type scheme being second order accurate away from sonic points and extrema.

This paper is concerned with an interior penalty discontinuous Galerkin (IPDG) method based on a flexible type of non-polynomial local approximation space for the Helmholtz equation with varying wavenumber. The local approximation space consists of multiple polynomial-modulated phase functions which can be chosen according to the phase information of the solution. We obtain some {approximation} properties for this space and \textit{a prior} $L^2$ error estimates for the \textit{h}-convergence of the IPDG method using duality argument. We also provide ample numerical examples to show that, building phase information into the local spaces often gives more accurate results comparing to using the standard polynomial spaces.