No abstract uploaded!

The main purpose of this paper is to analyze the stability and error estimates of the local discontinuous Galerkin (LDG) methods coupled with implicit-explicit (IMEX) time discretization schemes, for solving multi-dimensional convection-diffusion equations with nonlinear convection. By establishing the important relationship between the gradient and the interface jump of the numerical solution with the independent numerical solution of the gradient in the LDG method, on both rectangular and triangular elements, we can obtain the same stability results as in the one-dimensional case, i.e, the IMEX LDG schemes are unconditionally stable for the multi-dimensional convection-diffusion problems, in the sense that the time-step $\dt$ is only required to be upper-bounded by a positive constant independent of the spatial mesh size $h$. Furthermore, by the aid of the so-called elliptic projection and the adjoint argument, we can also obtain optimal error estimates in both space and time, for the corresponding fully discrete IMEX LDG schemes, under the same condition, i.e, if piecewise polynomial of degree $k$ is adopted on either rectangular or triangular meshes, we can show the convergence accuracy is of order $\Ocal(h^{k+1}+\dt^s)$ for the $s$-th order IMEX LDG scheme ($s=1,2,3$) under consideration. Numerical experiments are also given to verify our main results.

For numerical simulation of detonation, computational cost using uniform meshes is large due to the vast separation in both time and space scales. Adaptive mesh refinement (AMR) is advantageous for problems with vastly different scales. This paper aims to propose an AMR method with high order accuracy for numerical investigation of multi-dimensional detonation. A well-designed AMR method based on finite difference weighted essentially non-oscillatory (WENO) scheme, named as AMR\&WENO is proposed. A new cell-based data structure is used to organize the adaptive meshes. The new data structure makes it possible for cells to communicate with each other quickly and easily. In order to develop an AMR method with high order accuracy, high order prolongations in both space and time are utilized in the data prolongation procedure. Based on the message passing interface (MPI) platform, we have developed a workload balancing parallel AMR\&WENO code using the Hilbert space-filling curve algorithm. Our numerical experiments with detonation simulations indicate that the AMR\&WENO is accurate and have a high resolution. Moreover, we evaluate and compare the performance between the uniform mesh WENO scheme and the parallel AMR\&WENO method. The comparison results provide us further insight into the high performance of the parallel AMR\&WENO method.

We present numerical schemes for the incompressible Navier–Stokes equations based on a primitive variable formulation in which the incompressibility constraint has been replaced by a pressure Poisson equation. The pressure is treated explicitly in time, completely decoupling the computation of the momentum and kinematic equations. The result is a class of extremely efficient Navier–Stokes solvers. Full time accuracy is achieved for all flow variables. The key to the schemes is a Neumann boundary condition for the pressure Poisson equation which enforces the incompressibility condition for the velocity field. Irrespective of explicit or implicit time discretization of the viscous term in the momentum equation the explicit time discretization of the pressure term does not affect the time step constraint. Indeed, we prove unconditional stability of the new formulation for the Stokes equation with explicit treatment of the pressure term and first or second order implicit treatment of the viscous term. Systematic numerical experiments for the full Navier–Stokes equations indicate that a second order implicit time discretization of the viscous term, with the pressure and convective terms treated explicitly, is stable under the standard CFL condition. Additionally, various numerical examples are presented, including both implicit and explicit time discretizations, using spectral and finite difference spatial discretizations, demonstrating the accuracy, flexibility and efficiency of this class of schemes. In particular, a Galerkin formulation is presented requiring only C0 elements to implement.

The main purpose of this paper is to give stability analysis and error estimates of the local discontinuous Galerkin (LDG) methods coupled with three specific implicit-explicit (IMEX) Runge-Kutta time discretization methods up to third order accuracy, for solving one-dimensional time-dependent linear fourth order partial differential equations. In the time discretization, all the lower order derivative terms are treated explicitly and the fourth order derivative term is treated implicitly. By the aid of energy analysis, we show that the IMEX-LDG schemes are unconditionally energy stable, in the sense that the time step $\dt$ is only required to be upper-bounded by a constant which is independent of the mesh size $h$. The optimal error estimate is also derived by the aid of the elliptic projection and the adjoint argument. Numerical experiments are given to verify that the corresponding IMEX-LDG schemes can achieve optimal error accuracy.