Evaluation of adaptive mesh refinement and coarsening for the computation of compressible flows on unstructured meshes

The compressible gas flows of interest to aerospace applications often involve situations where shock and expansion waves are present. Decreasing the characteristic dimension of the computational cells in the vicinity of shock waves improves the quality of the computed flows. This reduction in size may be accomplished by the use of mesh adaption procedures. In this paper an analysis is presented of an adaptive mesh scheme developed for an unstructured mesh finite volume upwind computer code. This scheme is tailored to refine or coarsen the computational mesh where gradients of the flow properties are respectively high or low. The refinement and coarsening procedures are applied to the classical gas dynamic problems of the stabilization of shock waves by solid bodies. In particular, situations where oblique shock waves interact with an expansion fan and where bow shocks arise around solid bodies are considered. The effectiveness of the scheme in reducing the computational time, while increasing the solution accuracy, is assessed. It is shown that the refinement procedure alone leads to a number of computational cells which is 20% larger than when alternate passes of refinement and coarsening are used. Accordingly, a reduction of computational time of the same order of magnitude is obtained. Copyright © 2005 John Wiley & Sons, Ltd.     

含泥质夹层油藏蒸汽注采过程的自适应网格算法研究

根据泥质夹层的低渗特性及空间分布，本文提出了一种含泥质夹层油藏网格渗透率的粗化计算方法，并在此基础上，将自适应网格算法应用于含泥质夹层油藏的数值模拟，提升其计算效率．在计算过程中，网格的动态划分仅依据流体物理量的变化，泥质夹层区域不全部采用细网格，仅针对流动锋面处的泥质夹层采用细网格，其余泥质夹层处采用不同程度的粗网格．相较于传统算法，网格数大幅下降．数值算例表明，自适应网格算法的计算结果精度与全精细网格一致，能够准确模拟出泥质夹层对于流体的阻碍作用，同时计算效率得到大幅提升，约为全精细网格算法的3~7 倍．     

A parallel adaptive numerical method with generalized curvilinear coordinate transformation for compressible Navier–Stokes equations

A fourth‐order finite‐volume method for solving the Navier–Stokes equations on a mapped grid with adaptive mesh refinement is proposed, implemented, and demonstrated for the prediction of unsteady compressible viscous flows. The method employs fourth‐order quadrature rules for evaluating face‐averaged fluxes. Our approach is freestream preserving, guaranteed by the way of computing the averages of the metric terms on the faces of cells. The standard Runge–Kutta marching method is used for time discretization. Solutions of a smooth flow are obtained in order to verify that the method is formally fourth‐order accurate when applying the nonlinear viscous operators on mapped grids. Solutions of a shock tube problem are obtained to demonstrate the effectiveness of adaptive mesh refinement in resolving discontinuities. A Mach reflection problem is solved to demonstrate the mapped algorithm on a non‐rectangular physical domain. The simulation is compared against experimental results. Future work will consider mapped multiblock grids for practical engineering geometries. Copyright © 2016 John Wiley & Sons, Ltd.     

A large-scale parallel hybrid grid generation technique for realistic complex geometry

High-Performance Computing (HPC) systems and Computational Fluid Dynamics (CFD) have made significant progress in recent years; however, as the basis of the large-scale parallel computing, the massive grid generation of billions of cells has become a bottleneck problem. In this study, a parallel grid generation technique is proposed to generate large-scale mixed grids with arbitrary cell types and scales. The basic idea of our method is analogous to the global mesh refinement technique. An initial coarse grid with arbitrary cell types is regarded as a background mesh which is partitioned into subzones, and subzones are assigned onto different CPU cores. After the cells and faces in each subzone are split, the inserted new points of the solid wall are projected onto the original CAD entities to preserve the geometry accurately. Finally, the tangled cells caused by the projection in the boundary layer are untangled by a local Radial Basis Function mesh deformation technique. Furthermore, a parallel partition approach and an efficient wall distance computing technique for massive grids are developed also to shorten the preprocessing time. The tests show that the preprocessing efficiency has been increased by two or three orders compared with traditional methods. Billions of grids are generated for the AIAA JSM high-lift model and the Chinese CHN-T1 transport model to test the ability of the parallel grid generation technique. The maximum scale up to 19 billion mixed elements is generated using 16 384 CPU cores in parallel, and the mesh quality is acceptable for CFD simulations.     

Block-based adaptive mesh refinement scheme using numerical density of entropy production for three-dimensional two-fluid flows

In this work, we present a fast and parallel finite volume scheme on unstructured meshes applied to complex fluid flow. The mathematical model is based on a three-dimensional compressible low Mach two-phase flows model, combined with a linearised ‘artificial pressure’ law. This hyperbolic system of conservation laws allows an explicit scheme, improved by a block-based adaptive mesh refinement scheme. Following a previous one-dimensional work, the useful numerical density of entropy production is used as mesh refinement criterion. Moreover, the computational time is preserved using a local time-stepping method. Finally, we show through several test cases the efficiency of the present scheme on two- and three-dimensional dam-break problems over an obstacle.     

A local grid refinement method for three‐dimensional turbulent recirculating flows

A local grid refinement method is presented and applied to a three‐dimensional turbulent recirculating flow. It is based on the staggered grid arrangement. The computational domain is covered by block‐structured subgrids of different refinement levels. The exchange of information between the subgrids is fully conservative and all grids are treated implicitly. This allows for a simultaneous solution of one variable in all grids. All variables are stored in one‐dimensional arrays. The solver selected for the solution of the discretised finite difference equations is the preconditioned bi‐conjugate gradient (Bi‐CG) method. For the case examined (turbulent flow around a surface‐mounted cube), it was found that the latter method converges faster than the line solver. The locally refined mesh improved the accuracy of the pressure distribution on cube faces compared with a coarse mesh and yielded the same results as a fine single mesh, with a 62% gain in computer time. Copyright © 1999 John Wiley & Sons, Ltd.     

热传导问题的比例边界等几何分析

提出比例边界等几何分析SBIGA(Scaled Boundary IsoGeometric Analysis)方法来求解热传导问题。SBIGA兼具比例边界有限元和等几何分析的优势,特别适用于求解包含无限域和奇异物理场的问题。该方法造型十分方便,在径向具有半解析性质,仅需在计算域边界上用NURBS基函数自然离散,为实现CAD/CAE无缝融合提供了新的途径,大大节约前处理和计算耗时。此外,SBIGA无需进一步与CAD系统数据交换就可以保型细分。三个基准算例证明了其在热传导分析中的有效性。与传统比例边界有限元相比,SBIGA模型消除了几何模型误差,并显示出更高的计算精度和收敛速度。     

基于等几何分析的边界元法求解二维Laplace方程

针对二维Laplace问题,提出了基于非均匀有理B样条的等几何边界单元法(IGABEM),并利用径向积分法来处理奇异积分。该方法实现了几何与求解域的无缝融合,不仅实现了求解域与几何的完美匹配,而且节约了前处理时间。该方法可以很容易地实现模型的细分,并且在仅增加少量自由度的情况下获得更高的精度。数值算例表明,该方法能够有效地求解二维Laplace方程,且具有非常好的计算精度。     

基于T样条的变网格等几何薄板动力学分析

具有大位移、大变形的薄板在接触碰撞等工况下, 其局部应变会产生剧烈变化. 为了保证对其进行动力学分析的精度和计算效率, 本文整合计算机辅助设计(CAD)与计算机辅助工程(CAE)系统, 提出了一种基于T样条曲面的变网格柔性系统等几何分析方法. 首先, 建立基于T样条曲面单元的基尔霍夫薄板运动学模型, 并根据非线性格林?拉格朗日应变建立由T样条曲面单元离散的薄板弹性模型. 其次, 通过在T网格中的局部区域插入节点的方式, 达到T样条曲面网格局部更新的目的. 利用T样条混合函数细化算法得到计算新广义变量的转换矩阵, 并结合广义α法创建了变自由度系统动力学方程的求解算法, 形成了系统的T样条单元局部细化算法. 最后, 静力学算例与柔性单摆模型分别验证了T样条薄板弹性模型的正确性, 以及T样条薄板单元在动力学分析上的精度和收敛性. 通过对受冲击柔性薄板的动力学分析表明, 本文所提出T样条单元及局部细化算法可以只在接触碰撞等应变剧烈变化的区域实现局部网格细化, 从而控制系统自由度数, 提高计算效率.      

Simplex space-time meshes in compressible flow simulations

Employing simplex space-time meshes enlarges the scope of compressible flow simulations. The simultaneous discretization of space and time with simplex elements extends the flexibility of unstructured meshes from space to time. In this work, we adapt a finite element formulation for compressible flows to simplex space-time meshes. The method obtained allows, for example, flow simulation on spatial domains that change topology with time. We demonstrate this with the two-dimensional simulation of compressible flow in a valve that fully closes and opens again. Furthermore, simplex space-time meshes facilitate local temporal refinement. A three-dimensional transient simulation of blow-by past piston rings is run in parallel on 120 cores. The timings point out savings of computation time gained from local temporal refinement in four-dimensional space-time meshes.     

A new immersed boundary method for compressible Navier–Stokes equations

This paper presents an immersed boundary method for compressible Navier–Stokes equations in irregular domains, based on a local radial basis function approximation. This approach allows one to define a reconstruction of the radial basis functions on each irregular interface cell to treat both the Dirichlet and Neumann boundary conditions accurately on the immersed interfaces. Several numerical examples, including problems with available analytical solutions and the well-documented flow past an airfoil, are presented to test the proposed method. The numerical results demonstrate that the proposed method provides accurate solutions for viscous compressible flows.     

A sharp‐interface immersed boundary framework for simulations of high‐speed inviscid compressible flows

A new finite‐volume flow solver based on the hybrid Cartesian immersed boundary (IB) framework is developed for the solution of high‐speed inviscid compressible flows. The IB method adopts a sharp‐interface approach, wherein the boundary conditions are enforced on the body geometry itself. A key component of the present solver is a novel reconstruction approach, in conjunction with inverse distance weighting, to compute the solutions in the vicinity of the solid‐fluid interface. We show that proposed reconstruction leads to second‐order spatial accuracy while also ensuring that the discrete conservation errors diminish linearly with grid refinement. Investigations of supersonic and hypersonic inviscid flows over different geometries are carried out for an extensive validation of the proposed flow solver. Studies on cylinder lift‐off and shape optimisation in supersonic flows further demonstrate the efficacy of the flow solver for computations with moving and shape‐changing geometries. These studies conclusively highlight the capability of the proposed IB methodology as a promising alternative for robust and accurate computations of compressible fluid flows on nonconformal Cartesian meshes.     

基于XFEM与自适应网格的非均质材料裂纹扩展模拟

针对含有间断的非均匀材料的断裂问题,本文将虚节点多边形单元的形函数引入到扩展有限元（XFEM）中,提出了一种基于四叉树结构的动态网格细化方法,该方法可对间断面附近单元实现可调控的多层级细化,特别是对于裂纹扩展问题,可实现裂尖附近单元的动态网格细化与粗化。基于以上网格细化方法,本文提出了针对非均匀材质裂纹扩展问题的计算方法VP-XFEM。为验证算法的准确性与计算效率,针对含有孔洞及材料界面的断裂问题,本文给出了相应的算例。结果显示,与传统的一致性网格的XFEM相比,VP-XFEM能够明显改善计算精度与计算效率。     

Solution of free-boundary problems using finite-element/Newton methods and locally refined grids: Application to analysis of solidification microstructure

A new method is presented for the solution of free-boundary problems using Lagrangian finite element approximations defined on locally refined grids. The formulation allows for direct transition from coarse to fine grids without introducing non-conforming basis functions. The calculation of elemental stiffness matrices and residual vectors are unaffected by changes in the refinement level, which are accounted for in the loading of elemental data to the global stiffness matrix and residual vector. This technique for local mesh refinement is combined with recently developed mapping methods and Newton's method to form an efficient algorithm for the solution of free-boundary problems, as demonstrated here by sample calculations of cellular interfacial microstructure during directional solidification of a binary alloy.     

多特征几何体的全六面体网格自动生成方法

有限元分析的精度和效率与网格划分的质量有直接关系.目前尚缺乏一种普适性的自动网格划分方法,尤其是对于具有多种几何特征的复杂模型,现有的六面体网格自动划分算法存在不同几何特征间的网格兼容性较差以及孔状特征周围网格质量不高的问题.对此本文提出一种基于映射法的六面体网格自动生成方法,在映射法的基本框架下,将物理空间中的复杂几何体映射为计算空间中的规则几何体,引入边界顶点分类,将复杂几何体边界进行简化,将子域约束进行连接,寻找贯穿边界,以使映射网格在约束特征间兼容;对圆弧特征进行等效转化,降低曲率过大对于网格过渡的影响.实例验证表明,本方法稳定可靠,生成的六面体网格质量较高,能够解决多特征复杂几何体六面体网格自动划分问题.     

Multiphase computational method for thermal interactions between compressible fluid and arbitrarily shaped solids

A numerical method was investigated for multiphase fields consisting of compressible gas and arbitrarily shaped solids. Since the proposed model is based on a one‐fluid model in which variables are averaged according to the phase fractions in the computational cells; it enables us to estimate gas‐solid momentum and thermal interactions without setting up adapting grids even if the solids have extremely complicated shapes. The governing equations are derived with the characteristics of an ideal gas assuming the specific heat to be uniform in the multiphase field. The derived equations in conservative form are discretized with a finite volume method. In addition, the pressure is calculated implicitly in a similar way to incompressible flow solvers. Because of these improvements, the proposed method allows us to calculate low Mach number compressible flows free from the Courant‐Friedrichs‐Lewy condition based on the speed of sound and to conserve the mass more accurately. To confirm the validity of the proposed method, it was applied to natural convection around an isothermal cylinder and a heat‐conducting pipe. In comparison with previous studies, it was confirmed that the gas flows and temperature distributions are predicted reasonably. In addition, a numerical experiment was conducted under more complicated conditions, namely, gas leaking from a container including heat sources. As a result, it was demonstrated that the proposed method enables us to predict unsteady variations of pressure and temperature distributions in the container due to the leakage while still conserving mass accurately.     

自适应一致性高阶无单元伽辽金法

近来提出的一致性高阶无单元伽辽金法通过导数修正技术大幅度减少了所需积分点数目,并能够精确地通过线性和二次分片试验,显著改善标准无单元伽辽金法的计算效率、精度和收敛性.本文在此基础之上,充分利用无单元法易于在局部区域添加节点的优势,发展了一致性高阶无单元伽辽金法的h型自适应分析方法.根据应变能密度梯度该方法自适应地确定需节点加密的区域,基于背景积分网格的局部多层细化要求生成新的计算节点,同时考虑了节点分布由密到疏渐进过渡的情形.采用相邻两次计算的应变能的相对误差作为自适应过程的停止准则,将所发展自适应无网格法应用于由几何外形、边界外载和体力等因素造成的应力集中问题的计算分析.数值结果表明,所发展方法能够自适应地对高应力梯度区域进行节点加密,自动给出合理的计算节点分布.与已有的标准无网格法的自适应分析相比,所发展方法在计算效率、精度和应力场光滑性等方面均展现出显著优势.与采用节点均匀分布的一致性高阶无单元伽辽金法相比,它大幅度地减少了计算节点数目,有效提高了一致性高阶无单元伽辽金法在分析应力集中等存在局部高梯度问题时的计算效率和求解精度.     

Continuous adjoint-based error estimation and its application to adaptive discontinuous Galerkin method

An adaptive mesh refinement algorithm based on a continuous adjoint approach is developed. Both the primal equation and the adjoint equation are approximated with the discontinuous Galerkin (DG) method. The proposed adaptive algorithm is used in compressible Euler equations. Numerical tests are made to show the superiority of the proposed adaptive algorithm.     

Modeling of Two-Phase Flow in Fractured Porous Media on Unstructured Non-Uniformly Coarsened Grids

In this article, we investigate two strategies for coarsening fractured geological models. The first approach, which generates grids that resolve the fractures, is referred to as explicit fracture-matrix separation (EFMS). The second approach is based on a non-uniform coarsening strategy introduced in Aarnes et al. (Adv Water Resour 30(11):2177–2193, 2007a). A series of two-phase flow simulations where the saturation is modeled on the respective coarse grids are performed. The accuracy of the resulting solutions is examined, and the robustness of the two strategies is assessed with respect to number of fractures, degree of coarsening, well locations, phase viscosities, and fracture permeability. The numerical results show that saturation solutions obtained on the non-uniform coarse grids are consistently more accurate than the corresponding saturation solutions obtained on the EFMS grids. The numerical results also reveal that it is much easier to tune the upscaling factor with the non-uniform coarsening approach.     

A method for generating irregular computational grids in multiply connected planar domains

A method for generating irregular triangular computational grids in two-dimensional multiply connected domains is described. A set of points around each body is defined using a simple grid generation technique appropriate to the geometry of each body. The Voronoi regions associated with the resulting global point distribution are constructed from which the Delaunay triangulation of the set of points is thus obtained. The definition of Voronoi regions ensures that the triangulation produces triangles of reasonable aspect ratios given a grid point distribution. The approach readily accommodates local clustering of grid points to facilitate variable resolution of the domain. The technique is generally applicable and has been used with success in computing triangular grids in multiply connected planar domains. The suitability of such grids for flow calculations is demonstrated using a finite element method for solution of the inviscid transonic flow over two- dimensional high-lift aerofoil configurations.