In this paper we consider a discontinuous Galerkin discretization of the ideal magnetohydrodynamics (MHD) equations on unstructured meshes, and the divergence free constraint ($\nabla \cdot \B = 0$) of its magnetic field $\B$. We first present two approaches for maintaining the divergence free constraint, namely the approach of a locally divergence free projection inspired by locally divergence free elements \cite{Li2005}, and another approach of the divergence cleaning technique given by Dedner et al. \cite{Dedner2002}. By combining these two approaches we obtain a efficient method at the almost same numerical cost. Finally, numerical experiments are performed to show the capacity and efficiency of the scheme.

In this paper, a structure-preserving algorithm is developed for the computation of a semi-stabilizing solution of a Generalized Algebraic Riccati Equation (GARE). The semi-stabilizing solution of GAREs has been used to characterize the solvability of the (J, J ′ )-spectral factorization problem in control theory for general rational matrices which may have poles and zeros on the extended imaginary axis. The main difficulty in solving such a GARE lies in the fact that its associated Hamiltonian/skew-Hamiltonian pencil has eigenvalues on the extended imaginary axis. Consequently, it is not clear which eigenspace of the associated Hamiltonian/skew-Hamiltonian pencil can characterize the desired semi-stabilizing solution. That is, it is not clear which eigenvectors and principal vectors corresponding to the eigenvalues on the extended imaginary axis should be contained in the eigenspace that we wish to compute. Hence, the well-known generalized eigenspace approach for the classical algebraic Riccati equations cannot be employed directly. The proposed algorithm consists of a structure-preserving doubling algorithm (SDA) and a postprocessing procedure to determine the desired eigenvectors and principal vectors corresponding to the purely imaginary and infinite eigenvalues. Under mild assumptions, linear convergence of rate 1/2 for the SDA is proved. Numerical experiments illustrate that the proposed algorithm performs efficiently and reliably.

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.

No abstract uploaded!

In this paper, we consider linear stability issues for one-dimensional hyperbolic conservation laws using a class of conservative high order upwind-biased finite difference schemes, which is a prototype for the weighted essentially non-oscillatory (WENO) schemes, for initial-boundary value problems (IBVP). The inflow boundary is treated by the so-called inverse Lax-Wendroff (ILW) or simplified inverse Lax-Wendroff (SILW) procedure, and the outflow boundary is treated by the classical high order extrapolation. A third order total variation diminishing (TVD) Runge-Kutta time discretization is used in the fully discrete case. Both GKS (Gustafsson, Kreiss and Sundstr\"om) and eigenvalue analysis are performed for both semi-discrete and fully discrete schemes. The two different analysis techniques yield consistent results. Numerical tests are performed to demonstrate the stability results predicted by the analysis.