We introduce a new troubled-cell indicator for the discontinuous Galerkin (DG) methods for solving hyperbolic conservation laws. This indicator can be defined on unstructured meshes for high order DG methods and depends only on data from the target cell and its immediate neighbors. It is able to identify shocks without PDE sensitive parameters to tune. Extensive one- and two-dimensional simulations on the hyperbolic systems of Euler equations indicate the good performance of this new troubled-cell indicator coupled with a simple minmod-type TVD limiter for the Runge-Kutta DG (RKDG) methods.

In 1975, P. Erd\H os proposed the problem of determining the maximum number $f(n)$ of edges in a graph with $n$ vertices in which any two cycles are of different lengths. The sequence $(c_1,c_2,\cdots,c_n)$ is the cycle length distribution of a graph $G$ of order $n$， where $c_i$ is the number of cycles of length $i$ in $G$. Let $f(a_1,a_2,\cdots,$ $a_n)$ denote the maximum possible number of edges in a graph which satisfies $c_i\leq a_i$ where $a_i$ is a nonnegative integer. In 1991, Shi posed the problem of determining $f(a_1,a_2,\cdots,a_n)，$ which extended the problem due to Erd\H os, it is clear that $f(n)=f(1,1,\cdots,1)$. Let $g(n,m)=f(a_1,a_2,\cdots,a_n),$ $a_i=1$ for all $i/m$ be integer, $a_i=0$ for all $i/m$ be not integer. It is clear that $f(n)=g(n,1)$. We prove that $\liminf\sb {n \to \infty} {f(n)-n \over \sqrt n} \geq \sqrt {2 + \frac{40}{99}},$ which is better than the previous bounds $\sqrt 2$ (Shi, 1988), $\sqrt {2 + \frac{7654}{19071}}$ (Lai, 2017). We show that $\liminf_{n \rightarrow \infty} {g(n,m)-n\over \sqrt \frac{n}{m}} > \sqrt {2.444},$ for all even integers $m$. We make the following conjecture: $\liminf\sb {n \to \infty} {f(n)-n \over \sqrt n} > \sqrt {2.444}.$

Let $K/k$ be a finite Galois extension and $\pi = \fn{Gal}(K/k)$. An algebraic torus $T$ defined over $k$ is called a $\pi$-torus if $T\times_{\fn{Spec}(k)} \fn{Spec}(K)\simeq \bm{G}_{m,K}^n$ for some integer $n$. The set of all algebraic $\pi$-tori defined over $k$ under the stably birational equivalence forms a semigroup, denoted by $T(\pi)$. We will give a complete proof of the following theorem due to Endo and Miyata \cite{EM4}. Theorem. Let $\pi$ be a finite group. Then $T(\pi)\simeq C(\Omega_{\bm{Z}\pi})$ where $\Omega_{\bm{Z}\pi}$ is a maximal $\bm{Z}$-order in $\bm{Q}\pi$ containing $\bm{Z}\pi$ and $C(\Omega_{\bm{Z}\pi})$ is the locally free class group of $\Omega_{\bm{Z}\pi}$, provided that $\pi$ is isomorphic to one of the following four types of groups : $C_n$ ($n$ is any positive integer), $D_m$ ($m$ is any odd integer $\ge 3$), $C_{q^f}\times D_m$ ($m$ is any odd integer $\ge 3$, $q$ is an odd prime number not dividing $m$, $f\ge 1$, and $(\bm{Z}/q^f\bm{Z})^{\times}=\langle \bar{p}\rangle$ for any prime divisor $p$ of $m$), $Q_{4m}$ ($m$ is any odd integer $\ge 3$, $p\equiv 3 \pmod{4}$ for any prime divisor $p$ of $m$).

In this paper, we develop a discontinuous Galerkin (DG) method to solve the ideal special relativistic hydrodynamics (RHD) and design a bound-preserving (BP) limiter for this scheme by extending the idea in (X. Zhang and C.-W. Shu, Journal of Computational Physics, 229 (2010), 8918-8934). For RHD, the density and pressure are positive and the velocity is bounded by the speed of light. One difficulty in numerically solving the RHD in its conservative form is that the failure of preserving these physical bounds will result in ill-posedness of the problem and blowup of the code, especially in extreme relativistic cases. The standard way in dealing with this difficulty is to add extra numerical dissipation, while in doing so there is no guarantee in maintaining the high order of accuracy. Our BP limiter has the following features. It can theoretically guarantee to preserve the physical bounds for the numerical solution and maintain its designed high order accuracy. The limiter is local to the cell and hence is very easy to implement. Moreover, it renders $L^1$-stability to the numerical scheme. Numerical experiments are performed to demonstrate the good performance of this bound-preserving DG scheme. Even though we only discuss the BP limiter for DG schemes, it can be applied to high order finite volume schemes, such as weighted essentially non-oscillatory (WENO) finite volume schemes as well.

For decades, the widely used finite difference method on staggered grids, also known as the marker and cell (MAC) method, has been one of the simplest and most effective numerical schemes for solving the Stokes equations and Navier–Stokes equations. Its superconvergence on uniform meshes has been observed by Nicolaides (SIAM J Numer Anal 29(6):1579–1591, 1992), but the rigorous proof is never given. Its behavior on non-uniform grids is not well studied, since most publications only consider uniform grids. In this work, we develop the MAC scheme on non-uniform rectangular meshes, and for the first time we theoretically prove that the superconvergence phenomenon (i.e., second order convergence in the L2 norm for both velocity and pressure) holds true for the MAC method on non-uniform rectangular meshes. With a careful and accurate analysis of various sources of errors, we observe that even though the local truncation errors are only first order in terms of mesh size, the global errors after summation are second order due to the amazing cancellation of local errors. This observation leads to the elegant superconvergence analysis even with non-uniform meshes. Numerical results are given to verify our theoretical analysis.