基于点球弹簧修匀法的混合网格变形并行算法A parallel algorithm for hybrid mesh deformation based on Vertex-Ball Spring Smoothing

针对二维/三维混合网格,提出基于点球弹簧修匀法的并行网格变形算法。按特定模板将混合网格中的非三角形/四面体单元分解成三角形/四面体单元。针对每个内部节点及其相邻节点建立相应的子弹簧系统,并通过增加Ball-Vertex弹簧避免弹簧系统的塌陷问题。由于点球弹簧法在计算中逐点对网格内部节点进行计算,在计算过程中具有良好的弱耦合性质,因此有利于算法并行化。在并行化时仅需对网格进行虚拟分区操作,不必进行复杂的几何分区操作,同时避免了混合网格不同单元之间的兼容性问题。该方法适用于具有复杂外形的大规模混合网格的变形问题,能够显著提高网格变形的效率,同时具有良好的适应性。     

适应复杂外形的三维粘性混合网格生成算法

提出一类适应复杂外形的粘性混合网格生成算法。表面网格由前沿推进三角形曲面网格程序获得,边界层布置各向异性的三棱柱体网格,远物面区域采用Delaunay方法生成四面体网格。针对模型的复杂几何特征,综合采用了各种网格处理技术,以保证边界层网格的质量,并避免算法失效问题。网格实例及计算结果表明了本文算法的实用性及和效性。     

前沿推进曲面四边形网格生成算法

将一类前沿推进三角形曲面网格生成算法拓展到曲面四边形网格生成。新算法逐个单元推进前沿,避免了铺路法（Paving）逐排推进方式的鲁棒性问题,针对四边形算法在理想点计算、候选点列表构建和新单元生成等环节存在的特殊技术问题给出了系统的解决方案。数值实验表明,本文算法能针对复杂的组合参数曲面自动生成全四边形网格,网格质量优于...     

基于背景网格变形的动态网格移动方法

基于Delaunay背景网格插值技术的动态网格生成方法无需迭代计算,效率较高。但对复杂构形大幅运动的动边界问题,尤其当边界大幅转动时,背景网格极易交叉重叠。重新生成背景网格和重新定位网格节点信息不仅费时而且会导致网格质量的严重下降。本文提出改进的基于背景网格的动态网格变形方法,通过在初始Delaunay背景网格中添加辅助点,生成一层新的背景网格和新的映射关系;采用ball-vertex弹簧法驱动新背景网格的变形,进而牵动目标网格的变形。算例表明,本文提出的动态网格变形方法对所关心区域的网格具有良好保形性,边界可转动更大角度而不会出现网格交叉重叠问题,总体上提高了动态网格更新的效率和质量。     

基于二重网格的动网格松弛法改进

相比传统的弹簧法等方法,基于球松弛算法的动网格松弛法在复杂边界大变形条件下可以得到质量更高的边界网格以及更大的极限变形量,但该方法在时间效率上还有提升的空间.引入二重网格,采用动网格松弛法进行稀疏网格的网格变形,将边界位移传递到整个网格计算域;再利用二重网格映射,将稀疏网格位移映射到原有计算网格的节点上.算例表明,改进...     

基于AFT-Delaunay的二维解耦并行网格生成算法

面向平面任意几何区域网格生成,提出了一种将波前法AFT(Advancing Front Technique)与Delaunay法相结合的解耦并行网格生成算法。算法主要思想是沿着求解几何区域惯性轴,采用扩展的AFT-Delaunay算法生成高质量三角形网格墙,递归地将几何区域动态划分成多个彼此解耦的子区域;采用OpenMP多线程并行技术,将子区域分配给多个CPU并行生成子区域网格;子区域内部的网格生成复用AFT-Delaunay算法,保证了生成网格的质量、效率和一致性要求。本算法优先生成几何边界与交界面网格,有利于提高有限元计算精度;各个子区域的网格生成彼此完全解耦,因此并行网格生成过程无需通信。该方法克服了并行交界面网格质量恶化难题,且具有良好的并行加速比,能够全自动、高效率地并行生成高质量的三角网格。     

面向复杂几何模型的并行四面体网格生成方法

面向大规模工程计算等数值模拟领域，提出了一种支持复杂几何模型的大规模四面体网格并行生成方法。该方法以复杂几何模型作为输入，首先采用串行网格生成方法生成初始四面体网格，然后通过两级区域分解方法将初始网格分解为多个子网格并分配到相应的进程中，进程间并行地提取出子网格的表面网格，并基于几何模型对面网格进行贴体加密，最后对加密后的面网格采用Delaunay方法重新生成四面体网格，该方法可以更好地适应高性能计算机体系结构，较好地克服了并行方法中并行性能和网格质量不能兼顾的问题。对三峡大坝模型进行测试和验证，证明该方法具有良好的并行效率和可扩展性，可以在数万处理器核上并行生成数十亿高质量四面体网格。     

有限元计算中疏密网格过渡方法研究

工程计算中出于节省计算量的目的,往往需要在一个有限元模型中布置粗细不同的网格。为保证计算结果的准确性,必须保证网格突变情况下的位移协调问题。本文工作之一是在强天驰界面过渡单元的基础上,引入虚拟节点和子单元,在子单元中应用节理元思想,提出了基于最小势能原理的弹簧节理单元法。简化了积分运算,避免了精度要求极高的坐标转换,从而提高了方法的精度和实用性;二是提出了基于位移约束的主从自由度法,简便实用,只需简单的矩阵运算即可实现。两种方法均实现了不同尺寸网格间位移的协调性和刚度的匹配,从而使之满足有限元收敛准则,且生成的刚度阵具有对称性及带状性。算例证明两种方法精度良好,并可方便地应用于求解大规模工程问题。     

用于正交各向异性织物仿真的弹簧质点模型

针对正交各向异性织物,本文提出了一种含附加节点的三角形弹簧质点模型.通过冗余自由度的引入和缩聚,能够实现有限元模型和弹簧质点模型三角形单元刚度矩阵的精确相等;据此,针对一般正交各向异性材料常数和单元形状,推导出弹簧质点模型中弹簧刚度系数及附加节点位置的解析表达式,有效解决了传统弹簧质点模型在正交各向异性织物仿真中存在的计算精度不高、弹簧参数选取随意等缺陷;并进一步完善了基于弹簧质点模型的柔性织物空间变形算法.数值模拟表明本文提出的弹簧质点模型和变形算法在进行织物仿真计算时,具有精度好、通用性强等优点.     

基于有限元弹性变形运算的全六面体网格生成方法研究

以映射法为基础并结合网格划分经验,提出了原理简单的六面体网格生成新办法.该方法根据物体轮廓选择初始网格,设定表面结点强制变形到目的曲面,经由有限元弹性计算确定内部节点的位置.在检查全体单元质量以后,调整畸形单元从而生成目的网格.通过为一个复杂的马头门模型构建全六面体网格,最后证明了本文所述方法的可行性.     

基于转换模板的三维实体全六面体网格生成方法

以四面体一六面体基本转换模板为基础，提出一系列具有伸缩性的扩展转换模板．可根据需要选择不同模板及其组合，将四面体分解为不同数量、不同密度过渡形式的六面体单元。这样，初始四面体网格不需要划分得很细，生成的六面体单元数量也可以通过采用不同规格的扩展转换模板而得到控制。提出了基于CAD几何造型的边界节点坐标修正方法．从而使边界网格更好地拟合几何模型边界。     

Hybrid mesh generation with embedded surfaces using a multiple marching direction approach

This paper proposes a method for the creation of hybrid meshes with embedded surfaces for viscous flow simulations as an extension of the multiple marching direction approach (AIAA J. 2007; 45 (1):162–167). The multiple marching direction approach enables to place semi‐structured elements around singular points, where valid semi‐structured elements cannot be placed using conventional hybrid mesh generation methods. This feature is discussed first with a couple of examples. Elements sometimes need to be clustered inside a computational domain to obtain more accurate results. For example, solution features, such as shocks, vortex cores and wake regions, can be extracted during the process of adaptive mesh generation. These features can be represented as surface meshes embedded in a computational domain. Semi‐structured elements can be placed around the embedded surface meshes using the multiple marching direction approach with a pretreatment method. Tetrahedral elements can be placed easily instead. A couple of results are presented to demonstrate the capability of the mesh generation method. Copyright © 2008 John Wiley & Sons, Ltd.     

Adaptive non‐conformal mesh refinement and extended finite element method for viscous flow inside complex moving geometries

Two different techniques to analyze non‐Newtonian viscous flow in complex geometries with internal moving parts and narrow gaps are compared. The first technique is a non‐conforming mesh refinement approach based on the fictitious domain method (FDM), and the second one is the extended finite element method (XFEM). The refinement technique uses one fixed reference mesh, and to impose continuity across non‐conforming regions, constraints using Lagrangian multipliers are used. The size of elements locally in the high shear rate regions is reduced to increase accuracy. FDM is shown to have limitations; therefore, XFEM is applied to decouple the fluid from the internal moving rigid bodies. In XFEM, the discontinuous field variables are captured by using virtual degrees of freedom that serve as enrichment and by applying special integration over the intersected elements. The accuracy of the two methods is demonstrated by direct comparison with results of a boundary‐fitted mesh applied to a two‐dimensional cross section of a twin‐screw extruder. Compared with non‐conforming FDM, XFEM shows a considerable improvement in accuracy around the rigid body, especially in the narrow gap regions. Copyright © 2011 John Wiley & Sons, Ltd.     

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.     

A Voronoi‐based ALE solver for the calculation of incompressible flow on deforming unstructured meshes

An Arbitrary Lagrangian–Eulerian method for the calculation of incompressible Navier–Stokes equations in deforming geometries is described. The mesh node connectivity is defined by a Delaunay triangulation of the nodes, whereas the discretized equations are solved using finite volumes defined by the Voronoi dual of the triangulation. For prescribed boundary motion, an automatic node motion algorithm provides smooth motion of the interior nodes. Changes in the connectivity of the nodes are made through the use of local transformations to maintain the mesh as Delaunay. This allows the nodes and their associated Voronoi finite volumes to migrate through the domain in a free manner, without compromising the quality of the mesh. An MAC finite volume solver is applied on the Voronoi dual using a cell‐centred non‐staggered formulation, with cell‐face velocities being calculated by the Rhie–Chow momentum interpolation. Advective fluxes are approximated with the third‐order QUICK differencing scheme. The solver is demonstrated via its application to a driven cavity flow, and the flow about flapping aerofoil geometries. Copyright © 2010 John Wiley & Sons, Ltd.     

六面体网格再划分过程中畸变和模具干涉单元的处理方法

针对金属体积成形过程中有限元网格畸变和再划分问题,研究了工件网格畸变单元中表面四边形面片分解为三角形面片时的重叠问题,提出了将工件与模具接触区域的工件三角形面片用模具表面三角形面片代替的算法,并给出了接触区域判断、相交点计算、相交三角形环的二次剖分以及融合拼接等关键技术,算法能够很好地描述工件与模具接触区域的形状特征,...     

A high‐order element based adaptive mesh refinement strategy for three‐dimensional unstructured grid

Adaptive mesh refinement (AMR) shows attractive properties in automatically refining the flow region of interest, and with AMR, better prediction can be obtained with much less labor work and cost compared to manually remeshing or the global mesh refinement. Cartesian AMR is well established; however, AMR on hybrid unstructured mesh, which is heavily used in the high‐Reynolds number flow simulation, is less matured and existing methods may result in degraded mesh quality, which mostly happens in the boundary layer or near the sharp geometric features. User intervention or additional constraints, such as freezing all boundary layer elements or refining the whole boundary layer, are required to assist the refinement process. In this work, a novel AMR strategy is developed to handle existing difficulties. In the new method, high‐order unstructured elements are first generated based on the baseline mesh; then the refinement is conducted in the parametric space; at last, the mesh suitable for the solver is output. Generating refined elements in the parametric space with high‐order elements is the key of this method and this helps to guarantee both the accuracy and robustness. With the current method, 3‐dimensional hybrid unstructured mesh of huge size and complex geometry can be automatically refined, without user intervention nor additional constraints. With test cases including the 2‐dimensional airfoil and 3‐dimensional full aircraft, the current AMR method proves to be accurate, simple, and robust.     

脆性材料破坏模拟的网格生成算法

脆性材料的破坏过程具有随机性,当前的网格生成算法没有充分考虑脆性材料破坏时裂纹扩展和碎块生成的随机性。在Persson网格生成算法与Delaunay随机网格剖分理论基础上,提出了一种可根据模拟需要动态控制网格品质的网格生成算法。通过对随机分布点的Delauna三角化,生成初始网格,然后将网格体系比拟为桁架结构,网格节点即为桁架节点。桁架节点在虚拟力作用下可动态调整位置,并最终达到整个体系受力平衡。对Persson 算法中的尺寸分布函数和收敛条件进行了修正,从而提高了收敛速度,并适用于任意形状对象的网格剖分。 基于VC++平台开发了算法程序。通过实例对算法进行了验证,表明算法能够满足脆性材料破碎模拟的需要。     

Compressive advection and multi‐component methods for interface‐capturing

This paper develops methods for interface‐capturing in multiphase flows. The main novelties of these methods are as follows: (a) multi‐component modelling that embeds interface structures into the continuity equation; (b) a new family of triangle/tetrahedron finite elements, in particular, the P₁DG‐P₂(linear discontinuous between elements velocity and quadratic continuous pressure); (c) an interface‐capturing scheme based on compressive control volume advection methods and high‐order finite element interpolation methods; (d) a time stepping method that allows use of relatively large time step sizes; and (e) application of anisotropic mesh adaptivity to focus the numerical resolution around the interfaces and other areas of important dynamics. This modelling approach is applied to a series of pure advection problems with interfaces as well as to the simulation of the standard computational fluid dynamics benchmark test cases of a collapsing water column under gravitational forces (in two and three dimensions) and sloshing water in a tank. Two more test cases are undertaken in order to demonstrate the many‐material and compressibility modelling capabilities of the approach. Numerical simulations are performed on coarse unstructured meshes to demonstrate the potential of the methods described here to capture complex dynamics in multiphase flows. Copyright © 2015 John Wiley & Sons, Ltd.