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.     

一类压缩型映射的不动点定理

在完备的度量空间中,讨论了一类新型的非线性压缩映射ρ(Tx,Ty)≤a(ρ(x,y))ρ(x,Tx)+b(ρ(x,y))ρ(y,Ty)+c(ρ(x,y))ρ(x,y)通过构造迭代序列,指出该映射的不动点的存在性和唯一性,并给出相应的误差估计式,拓展和改进了有关文献的范围.     

Versatile anisotropic mesh adaptation methodology applied to pure quantity of interest error estimator. Steady,laminar incompressible flow

We introduce a new flexible mesh adaptation approach to efficiently compute a quantity of interest by the finite element method. Efficiently, we mean that the method provides an evaluation of that quantity up to a predetermined accuracy at a lower computational cost than other classical methods. The central pillar of the method is our scalar error estimator based on sensitivities of the quantity of interest to the residuals. These sensitivities result from the computation of a continuous adjoint problem. The mesh adaptation strategy can drive anisotropic mesh adaptation from a general scalar error contribution of each element. The full potential of our error estimator is then reached. The proposed method is validated by evaluating the lift, the drag, and the hydraulic losses on a 2D benchmark case: the flow around a cylinder at a Reynolds number of 20.     

A control volume finite element method for three-dimensional three-phase flows

A novel control volume finite element method with adaptive anisotropic unstructured meshes is presented for three-dimensional three-phase flows with interfacial tension. The numerical framework consists of a mixed control volume and finite element formulation with a new P₁DG-P₂ elements (linear discontinuous velocity between elements and quadratic continuous pressure between elements). A “volume of fluid” type method is used for the interface capturing, which is based on compressive control volume advection and second-order finite element methods. A force-balanced continuum surface force model is employed for the interfacial tension on unstructured meshes. The interfacial tension coefficient decomposition method is also used to deal with interfacial tension pairings between different phases. Numerical examples of benchmark tests and the dynamics of three-dimensional three-phase rising bubble, and droplet impact are presented. The results are compared with the analytical solutions and previously published experimental data, demonstrating the capability of the present method.     

A framework to perform high-order deconvolution for finite-volume method on simplicial meshes

In this article, a new framework to design high-order approximations in the context of node-centered finite volumes on simplicial meshes is proposed. The major novelty of this method is that it relies on very simple and compact differential operators, which is a critical point to achieve good performances in the High-performance computing context. This method is based on deconvolution between nodal and volume-average values, which can be conducted to any order. The interest of the new method is illustrated through three different applications: mesh-to-mesh interpolation, levelset curvature computation, and numerical scheme for convection. Higher order can also be achieved within the present framework by introducing high-rank tensors. Although these tensors feature much symmetries, their manipulation can quickly become an overwhelming task. For this reason and without loss of generality, the present articles are limited to third-order expansion. This method, although tightly connected to the k-exact schemes theory, does not rely on successive corrections: the high-order property is obtained in a single operation, which makes them more attractive in terms of performances.     

Topological entropy of continuous self-maps on closed surfaces

The objective of this work is to present sufficient conditions for having positive topological entropy for continuous self-maps defined on a closed surface by using the action of this map on the homological groups of the closed surface.     

An approach of dynamic mesh adaptation for simulating 3‐dimensional unsteady moving‐immersed‐boundary flows

In this paper, we present an approach of dynamic mesh adaptation for simulating complex 3‐dimensional incompressible moving‐boundary flows by immersed boundary methods. Tetrahedral meshes are adapted by a hierarchical refining/coarsening algorithm. Regular refinement is accomplished by dividing 1 tetrahedron into 8 subcells, and irregular refinement is only for eliminating the hanging points. Merging the 8 subcells obtained by regular refinement, the mesh is coarsened. With hierarchical refining/coarsening, mesh adaptivity can be achieved by adjusting the mesh only 1 time for each adaptation period. The level difference between 2 neighboring cells never exceeds 1, and the geometrical quality of mesh does not degrade as the level of adaptive mesh increases. A predictor‐corrector scheme is introduced to eliminate the phase lag between adapted mesh and unsteady solution. The error caused by each solution transferring from the old mesh to the new adapted one is small because most of the nodes on the 2 meshes are coincident. An immersed boundary method named local domain‐free discretization is employed to solve the flow equations. Several numerical experiments have been conducted for 3‐dimensional incompressible moving‐boundary flows. By using the present approach, the number of mesh nodes is reduced greatly while the accuracy of solution can be preserved.