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.

Global geometrical optics method is a new semi-classical approach for the high frequency linear waves proposed by the author in [13]. In this paper, we rederive it in a more concise way. It is shown that the right candidate of solution ansatz for the high frequency wave equations is the extended WKB function, other than the WKB function used in the classical geometrical optics approximation. A new and main contribution of this paper is an interface analysis for the Helmholtz equation when the incident wave is of extended WKB-type. We derive asymptotic expressions for the reflected and/or transmitted propagating waves in the general case. These expressions are valid even when the incident rays include caustic points.

We present novel algorithms for compressible flows that\n\nare efficient for all Mach numbers. The approach is based on several\n\ningredients: semi-implicit schemes, the gauge decomposition\n\nof the velocity field and a second order formulation of the density\n\nequation (in the isentropic case) and of the energy equation (in\n\nthe full Navier-Stokes case). Additionally, we show that our approach\n\ncorresponds to a micro-macro decomposition of the model,\n\nwhere the macro field corresponds to the incompressible component\n\nsatisfying a perturbed low Mach number limit equation and\n\nthe micro field is the potential component of the velocity. Finally,\n\nwe also use the conservative variables in order to obtain a proper\n\nconservative formulation of the equations when the Mach number\n\nis order unity. We successively consider the isentropic case, the\n\nfull Navier-Stokes case, and the isentropic Navier-Stokes-Poisson\n\ncase. In this work, we only concentrate on the question of the\n\ntime discretization and show that the proposed method leads to\n\nAsymptotic Preserving schemes for compressible flows in the low\n\nMach number limit.

One of the main challenges in computational simulations of gas detonation propagation is that negative density or negative pressure may emerge during the time evolution, which will cause blow-ups. Therefore, schemes with provable positivity-preserving of density and pressure are desired. First order and second order positivity-preserving schemes were well studied. For high order discontinuous Galerkin (DG) method, even though the characteristicwise TVB limiter can kill oscillations, it is not sufficient to maintain the positivity. A simple solution for arbitrarily high order positivity-preserving schemes solving Euler equations was proposed recently. In this paper, we first discuss an extension of the technique to design arbitrarily high order positivity-preserving DG schemes for reactive Euler equations. We then present a simpler and more robust implementation of the positivity-preserving limiter than the one before. Numerical tests, including very demanding examples in gaseous detonations, indicate that the third order DG scheme with the new positivity-preserving limiter produces satisfying results even without the TVB limiter.

We consider the numerical solution of the time-fractional diffusion-wave equation on two-dimensional and three-dimensional unbounded spatial domains. Introduce an artificial boundary and find the exact and approximate artificial boundary conditions for the given problem, which lead to a bounded computational domain. Using the exact or approximating boundary conditions on the artificial boundary, the original problem is reduced to an initial-boundary-value problem on the bounded computational domain which is respectively equivalent to or approximates the original problem. Finite difference methods are used to solve the reduced problems on the bounded computational domain and the stability of these finite difference methods are proved. The numerical results demonstrate that the method given in this paper is effective and feasible.