The entropy solutions of the compressible Euler equations satisfy a minimum principle for the specific entropy. First order schemes such as Godunov-type and Lax-Friedrichs schemes and the second order kinetic schemes also satisfy a discrete minimum entropy principle. In this paper, we show an extension of the positivity-preserving high order schemes for the compressible Euler equations, to enforce the minimum entropy principle for high order finite volume and discontinuous Galerkin (DG) schemes.

A fourth order finite difference method is presented for the 2D unsteady viscous incompressible Boussinesq equations in vorticity-stream function formulation. The method is especially suitable for moderate to large Reynolds number flows. The momentum equation is discretized by a compact fourth order scheme with the no-slip boundary condition enforced using a local vorticity boundary condition. Fourth order long-stencil discretizations are used for the temperature transport equation with one-sided extrapolation applied near the boundary. The time stepping scheme for both equations is classical fourth order Runge–Kutta. The method is highly efficient. The main computation consists of the solution of two Poisson-like equations at each Runge–Kutta time stage for which standard FFT based fast Poisson solvers are used. An example of Lorenz flow is presented, in which the full fourth order accuracy is checked. The numerical simulation of a strong shear flow induced by a temperature jump, is resolved by two perfectly matching resolutions. Additionally, we present benchmark quality simulations of a differentially-heated cavity problem. This flow was the focus of a special session at the first MIT conference on Computational Fluid and Solid Mechanics in June 2001.

In this paper, we propose a simple bound-preserving sweeping procedure for conservative numerical approximations. Conservative schemes are of importance in many applications, yet for high order methods, the numerical solutions do not necessarily satisfy maximum principle. This paper constructs a simple sweeping algorithm to enforce the bound of the solutions. It has a very general framework acting as a postprocessing step accommodating many point-based or cell average-based discretizations. The method is proven to preserve the bounds of the numerical solution while conserving a prescribed quantity designated as a weighted average of values from all points. The technique is demonstrated to work well with a spectral method, high order finite difference and finite volume methods for scalar conservation laws and incompressible flows. Extensive numerical tests in 1D and 2D are provided to verify the accuracy of the sweeping procedure.

No abstract uploaded!

In this paper, we develop and analyze an arbitrary Lagrangian-Eulerian discontinuous Galerkin (ALE-DG) method with a time-dependent approximation space for one dimensional conservation laws, which satisfies the geometric conservation law. For the semi-discrete ALE-DG method, when applied to nonlinear scalar conservation laws, a cell entropy inequality, L2 stability and error estimates are proven. More precisely, we prove the sub-optimal (k+1/2) convergence for monotone fluxes, and optimal (k+1) convergence for an upwind flux, when a piecewise P^k polynomial approximation space is used. For the fully-discrete ALE-DG method, the geometric conservation law and the local maximum principle are proven. Moreover, we state conditions for slope limiters, which ensure total variation stability of the method. Numerical examples show the capability of the method.