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

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

基于2D网格的轴对称浸没边界法

浸没边界法是处理颗粒两相流中运动边界问题的一种常用数值模拟方法. 当研究的物理问题的无量纲参数满足一定要求时, 该流场结构呈现轴对称状态. 为此本文提出了一种基于2D笛卡尔网格和柱坐标系的轴对称浸没边界法. 该算法采用有限体积法(FVM)对动量方程进行空间离散, 并通过阶梯状锐利界面替代真实的固体浸没边界来封闭控制方程. 为了提高计算效率, 本文采用自适应网格加密技术提高浸没边界附近网格分辨率. 由于柱坐标系的使用, 使得动量方程中的黏性项产生多余的源项, 我们对其作隐式处理. 此外, 在对小球匀速近壁运动进行直接数值模拟时, 由于球壁间隙很小, 间隙内的压力变化比较剧烈. 因此想要精确地解析流场需要很高的网格分辨率. 此时, 需要在一个时间步内多次实施投影步来保证计算的稳定性. 而在小球自由碰壁运动中, 我们通过引入一个润滑力模型使得低网格分辨率下也能模拟小球近壁处的运动. 最后通过小球和圆盘绕流、Stokes流小球近壁运动以及小球自由下落碰壁弹跳算例验证本算法对于轴对称流的静边界和动边界问题均是适用和准确的.      

Adaptive mesh refinement and load balancing based on multi-level block-structured Cartesian mesh

We developed a framework for a distributed-memory parallel computer that enables dynamic data management for adaptive mesh refinement and load balancing. We employed simple data structure of the building cube method (BCM) where a computational domain is divided into multi-level cubic domains and each cube has the same number of grid points inside, realising a multi-level block-structured Cartesian mesh. Solution adaptive mesh refinement, which works efficiently with the help of the dynamic load balancing, was implemented by dividing cubes based on mesh refinement criteria. The framework was investigated with the Laplace equation in terms of adaptive mesh refinement, load balancing and the parallel efficiency. It was then applied to the incompressible Navier–Stokes equations to simulate a turbulent flow around a sphere. We considered wall-adaptive cube refinement where a non-dimensional wall distance y⁺ near the sphere is used for a criterion of mesh refinement. The result showed the load imbalance due to y⁺ adaptive mesh refinement was corrected by the present approach. To utilise the BCM framework more effectively, we also tested a cube-wise algorithm switching where an explicit and implicit time integration schemes are switched depending on the local Courant-Friedrichs-Lewy (CFL) condition in each cube.     

A new method of quality improvement for quadrilateral mesh based on small polygon reconnection

In this paper, a new method of topological cleanup for quadrilateral mesh is presented. The method first selects a patch of mesh around an irregular node. It then seeks the best connection of the selected patch according to its irregular valence using a new topological operation: small polygon reconnection (SPR). By replacing the original patch with an optimal one that has less irregular valence, mesh quality can be improved. Three applications based on the proposed approach are enumerated: (1) improving the quality of a quadrilateral mesh, (2) converting a triangular mesh to a quadrilateral one, and (3) adapting a triangle generator to a quadrilateral one. The presented method is highly effective in all three applications.     

局部网格生成中初始探索圆半径的搜索算法

无网格不一致性的基于节点的局部网格生成(NLMG)算法是基于节点的局部有限元方法(NLFEM)实现无缝连接的核心算法之一,而快速合理的确定中心节点的初始探索圆半径是降低NLMG算法计算量和确保其可靠性的关键一步。本文提出了基于均匀桶的快速局部搜索算法(UBFLSM),并将其成功应用于NLMG算法,解决了初始探索圆半径和探索圆半径优化后候选卫星点集的确定这两个难点,确保NLMG算法无网格不一致性。并/串行数值试验(实现从网格生成到总刚度矩阵生成之间的无缝连接)均表明,该算法是快速及可靠的。     

基于节点的局部网格生成算法

讨论了基于节点的有限元方法的网格生成算法及其产生的不一致性问题,提出了基于D e launay三角剖分的唯一性来克服网格不一致性现象的思想,并建议使用局部区域分割方法合理地确定探索圆半径,使中心节点的探索圆包含它的所有卫星点,进而确保算法无不一致性。理论分析和算例表明了该方法的可靠性及有效性。     

A hybrid vortex method for the simulation of three‐dimensional flows

This paper presents an integral vorticity method for solving three‐dimensional Navier–Stokes equations. A finite volume scheme is implemented to solve the vorticity transport equation, which is discretized on a structured hexahedral mesh. A vortex sheet algorithm is used to enforce the no‐slip boundary condition through a vorticity flux at the boundary. The Biot–Savart integral is evaluated to compute the velocity field, in conjunction with a fast algorithm based on multipole expansion. This method is applied to the simulation of uniform flow past a sphere. Copyright © 2007 John Wiley & Sons, Ltd.     

The use of dynamic grid adaptation algorithms for the modelling of flow around a circular cylinder in sub‐critical flow regime

In the present study a dynamic grid adaptation (DGA) algorithm is utilized for predicting flow around a circular cylinder in sub‐critical flow regime at a Reynolds number of 1.4×10⁵. The reason for adopting a DGA algorithm is the unsteadiness of the flow field which makes a conventional mesh inefficient. The concept being adopted is to concentrate mesh refinement in regions with high gradients and high turbulent viscosity, while in the region further downstream where the flow is fully developed a coarser mesh will develop and turbulence is modelled with the large eddy simulation (LES) turbulence model. The aim of the study is to present an appropriate variable for mesh refinement, which accomplishes a high rate of mesh refinement in the region with high gradients. The new variable is a product of the local mesh cell size and the rate of strain and includes two additional variables to allow control over the refinement behaviour. The results are compared with experimental data at the corresponding Reynolds number and also with numerical results obtained with conventional mesh. It is demonstrated that DGA algorithms can give results of a very high quality for a mesh that is significantly smaller than for a conventional mesh. Copyright © 2003 John Wiley & Sons, Ltd.     

Three-dimensional mesh embedding for the Navier–Stokes equations using upwind control volumes

A numerical model for the compressible Navier–Stokes equations using local mesh embedding is presented. The model solves for three-dimensional turbulent flow using an algebraic mixing length model of turbulence. The technique of control volume upwinding is used to produce a novel treatment, whereby the hanging nodes on the mesh interfaces are left with null control volumes. This yields an efficient discretization scheme which ensures second-order accuracy, flux conservation and stability at the mesh interfaces, whilst retaining a simple interpolative treatment for the hanging nodes. The discrete flow equations are solved using the semi-implicit pressure correction method. The accuracy of the embedded mesh solver is demonstrated by modelling the three-dimensional flow through a cascade of turbine vanes at design and off-design conditions. Mesh embedding gives a saving of 48% in the number of nodes. The embedded mesh solutions compare well with fine structured mesh solutions and experimental measurements. The capability of the embedded mesh solver to perform solution adaptive calculations is demonstrated using a two-dimensional mid-height section of the cascade at the off-design flow conditions.     

三维各向异性叉树网格流场自适应算法研究

建立了三维叉树形网格的数据结构,并将结构网格的有限体积法引入到叉树网格中,建立了相应的NS方程求解方法。在此基础上完善了包括各向异性自适应判别、合并/分裂、网格优化等步骤的算法,并提出了对流场结构进行“保护”性加密的优化加密方式。基于自适应叉树网格对高超声速横向喷流流场进行了数值模拟,捕捉到细致的流场结构,并将壁面压力系数计算值与文献试验值比较,得到了很好的模拟效果,具有较高的流场分辨精度。     

用逐点插入法生成Delaunay四面体自适应网格

介绍一种基于Delaunay算法的四面体自适应网格的自动划分方法。该方法用单元尺度场控制生成网格的疏密分布,在不满足尺度场要求的单元面形心处插入新节点,同时计算新节点单元尺寸参数,实现三维实体的Delaunay四面体自动划分。此方法具有几个特点:一是表面网格与体内网格同步划分,无需区分两者;二是结点与单元同时生成;三是生成网格自适应性好,疏密分布任意。另外,还介绍了三维网格划分中两个相关算法:一个是约束面恢复算法,该算法基于约束面不允许有单元边与之相交的性质而提出的;另一个是将二维射线法推广至三维空间,判断一个点是否在一多面体内,实现了凹多面体的划分。最后通过算例对单元质量进行了评价。本文所述方法是一种有效的四面体自适应单元生成算法。     

三维约束Delaunay三角化的边界恢复和薄元消除方法

提出一种有效的三维约束Delaunay三角剖分的边界恢复算法，该算法综合了P．L．George算法和N．P．Weatherill算法的优点，通过将约束边和约束面加以恢复，保持了实体边界的完整性，解决了经典Delaunay算法不能剖分凹域的问题，从而实现了复杂三维实体的网格剖分。提出了一种简易而有效的消除薄元方法——薄元分解法，彻底解决了三维Delaunay三角剖分过程中所产生的薄元问题。实践证明，本文提出的边界恢复算法和薄元消除算法健壮有效，生成网格的质量高，并且易于实现。     

Improved algorithm of light scattering by a coated sphere

An efficient numerical algorithm for computing the light scattering by a coated sphere is proposed. The calculation of relevant functions by different recurrence algorithms is discussed. The new algorithm avoids the numerical difficulties, which give rise to significant errors encountered in practice by prior methods. Exemplifying results such as extinction efficiency, scattering efficiency, light scattering intensity as well as calculation speed are provided. The results show that this algorithm is efficient, fast, numerically stable and accurate.     

Improved ALE mesh velocities for complex flows

A key choice in the development of arbitrary Lagrangian‐Eulerian solution algorithms is how to move the computational mesh. The most common approaches are smoothing and relaxation techniques, or to compute a mesh velocity field that produces smooth mesh displacements. We present a method in which the mesh velocity is specified by the irrotational component of the fluid velocity as computed from a Helmholtz decomposition, and excess compression of mesh cells is treated through a noniterative, local spring‐force model. This approach allows distinct and separate control over rotational and translational modes. The utility of the new mesh motion algorithm is demonstrated on a number of 3D test problems, including problems that involve both shocks and significant amounts of vorticity.     

An Adaptive Mesh Rezoning for FSI Problems

In the problems of fluid-structure interaction (FSI) the mesh updating scheme plays a key role. We have developed an adaptive mesh rezoning technique which is applicable to the three-dimensional FSI problems. In order to prevent the inversion of elements in the mesh and to maintain a well-conditioned shape for successive time-step calculations, we introduce constrained conditions of dilatational strain in the least-square form as well as the gradient of displacement vectors, in relatively small elements. By the present mesh rezoning technique, even under the large deformation of boundaries concerned, we can reduce the use of the process of mesh generation and switching of nodal values at the interboundary of time slabs. These steps require rather significant CPU time and induced projection errors of nodal values from the previous mesh to the current one. The case of collapsing tube problems shows the remarkable potential of our method. The present method is entirely general in that it can be applied to structured and unstructured meshes, effectively.     

An adaptive Lagrangian boundary element approach for three‐dimensional transient free‐surface Stokes flow as applied to extrusion,thermoforming, and rheometry

An adaptive (Lagrangian) boundary element approach is proposed for the general three‐dimensional simulation of confined free‐surface Stokes flow. The method is stable as it includes remeshing capabilities of the deforming free surface and thus can handle large deformations. A simple algorithm is developed for mesh refinement of the deforming free‐surface mesh. Smooth transition between large and small elements is achieved without significant degradation of the aspect ratio of the elements in the mesh. Several flow problems are presented to illustrate the utility of the approach, particularly as encountered in polymer processing and rheology. These problems illustrate the transient nature of the flow during the processes of extrusion and thermoforming, the elongation of a fluid sample in an extensional rheometer, and the coating of a sphere. Surface tension effects are also explored. Copyright © 2001 John Wiley & Sons, Ltd.     

A collocation method for convection dominated flows

A collocation method based on multiple regions with moving boundaries placed in a flow field in which convection effects dominate, is proposed. By making the moving boundaries of the regions coincide with moving sharp fronts present in the solution of convection dominated problems, and thereby allowing higher concentration of meshes to be placed about the fronts, the proposed method is able to achieve very high accuracy. By having a moving mesh, the Peclet number characterizing the flow field depends upon velocity relative to a moving mesh in a region. Consequently by choosing proper velocities of the moving boundaries, the value of this Peclet number can be made as small as desired. The traditional collocation method based on centred discretization, when applied to each region in the field, produces oscillation free solutions even when the values of Peclet number based on absolute velocity are extremely large. In view of these characteristics the method appears to be an excellent candidate for the solution of any two-phase flow problem containing sharp fronts.     

Consistency,stability and convergence of the finite-difference equations for flow about a rotating sphere in an axial stream

The finite-difference equations which have previously been developed to solve the problem of laminar boundary layer flow about a rotating sphere in an axial stream are analysed according to the available numerical stability theories. This analysis is necessary to determine the restrictions on velocities and mesh sizes required to obtain a convergent numerical solution. Convergence can be achieved if both consistency and stability of the finite-difference equations are fulfilled. The analysis reported in the present paper shows that the developed finite-difference equations are consistent with their original partial differential equations. Also, the analysis proves that the developed finite-difference procedure is numerically stable for all mesh sizes as long as the downstream meridional velocity is non-negative, i.e.as long as no flow reversals occur within the domain of solution.     

A mesh stability study of FEM explicit algorithms for structural large-scale deformation impact responses

To FEM explicit algorithms for structural large-scale deformation impact responses, algorithm stability is discussed in the present paper. Algorithm stability is thought to include two aspects: One is called difference pattern stability and the other is called mesh stability. A self-adaptive adjusting method is proposed to ensure mesh stability with little amount of computation increased.     

Numerical solution of the steady incompressible Navier—Stokes equations for the flow past a sphere by a multigrid defect correction technique

A nested non-linear multigrid algorithm is developed to solve the Navier–Stokes equations which describe the steady incompressible flow past a sphere. The vorticity–streamfunction formulation of the Navier–Stokes equations is chosen. The continuous operators are discretized by an upwind finite difference scheme. Several algorithms are tested as smoothing steps. The multigrid method itself provides only a first-order-accurate solution. To obtain at least second-order accuracy, a defect correction iteration is used as outer iteration. Results are reported for Re = 50, 100, 400 and 1000.