Global existence and time decay of the non-cutoff Boltzmann equation with hard potential

This paper is concerned with the Cauchy problem on the Boltzmann equation without angular cutoff assumption for hard potential in the whole space. When the initial data is a small perturbation of a global Maxwellian, the global existence of solution to this problem is proved in unweighted Sobolev spaces $H^N\left({\mathbb{R}}_{x,v}^6\right)$ with $N\ge 2$. But if we want to obtain the optimal temporal decay estimates, we need to add the velocity weight function, in this case the global existence and the optimal temporal decay estimate of the Boltzmann equation are all established. Meanwhile, we further gain a more accurate energy estimate, which can guarantee the validity of the assumption in Chen et al. (0000).     

On pointwise decay rates of time‐periodic solutions to the Navier–Stokes equation

We study the existence of a time‐periodic solution with pointwise decay properties to the Navier–Stokes equation in the whole space. We show that if the time‐periodic external force is sufficiently small in an appropriate sense, then there exists a time‐periodic solution $\{u,p\}$ of the Navier–Stokes equation such that $|{?}^j{u(t,x)|=O(|x|}^{1?n?j})$ and $|{?}^j{p(t,x)|=O(|x|}^{?n?j})(j=0,1,\dots )$ uniformly in $t\in \mathbb{R}$ as $|x|\to \infty$. Our solution decays faster than the time‐periodic Stokes fundamental solution and the faster decay of its spatial derivatives of higher order is also described.     

An efficient edge based data structure for the compressible Reynolds-averaged Navier–Stokes equations on hybrid unstructured meshes

An efficient edge based data structure has been developed in order to implement an unstructured vertex based finite volume algorithm for the Reynolds-averaged Navier–Stokes equations on hybrid meshes. In the present approach, the data structure is tailored to meet the requirements of the vertex based algorithm by considering data access patterns and cache efficiency. The required data are packed and allocated in a way that they are close to each other in the physical memory. Therefore, the proposed data structure increases cache performance and improves computation time. As a result, the explicit flow solver indicates a significant speed up compared to other open-source solvers in terms of CPU time. A fully implicit version has also been implemented based on the PETSc library in order to improve the robustness of the algorithm. The resulting algebraic equations due to the compressible Navier–Stokes and the one equation Spalart–Allmaras turbulence equations are solved in a monolithic manner using the restricted additive Schwarz preconditioner combined with the FGMRES Krylov subspace algorithm. In order to further improve the computational accuracy, the multiscale metric based anisotropic mesh refinement library PyAMG is used for mesh adaptation. The numerical algorithm is validated for the classical benchmark problems such as the transonic turbulent flow around a supercritical RAE2822 airfoil and DLR-F6 wing-body-nacelle-pylon configuration. The efficiency of the data structure is demonstrated by achieving up to an order of magnitude speed up in CPU times.     

An analysis of over-relaxation in a kinetic approximation of systems of conservation laws

The over-relaxation approach is an alternative to the Jin–Xin relaxation method in order to apply the equilibrium source term in a more precise way. This is also a key ingredient of the lattice Boltzmann method for achieving second-order accuracy. In this work, we provide an analysis of the over-relaxation kinetic scheme. We compute its equivalent equation, which is particularly useful for devising stable boundary conditions for the hidden kinetic variables.