采用Poisson方程生成曲线风俗格时源项P、Q选择的研究

采用Poisson方程进行曲线网格生成时,如何确定合适的调节因子P、Q函数是网格生成技术中的一个重要的研究内容。本文提出一种新的构造P、Q函数的方法,该方法直接利用边界网格节点的分布信息来控制区域内部网格节点的分布,生成的正交曲线网格令人满意。该方法可应用于河道、湖泊等一类复杂边界的二维流速场的数值模拟中。     

直接控制网格节点分布的曲线网格生成技术研究

指出了Thompson与Thomas曲线网格生成方法中控制网格分布的调节函数的问题所在,克服了Thomas曲线网格生成法中边界处局部线性化近似假定的缺陷,经过严格推导得出一组新的调节函数P、Q的表达式,并给出了曲线网格生成实例.实例检验表明,该调节函数能够对复杂边界的单连通域或多连通域生成理想的曲线网格,即边界处网格正交,内部网格分布能够适应物理量场变化的情形.在实际水利工程流场数值模拟中,该方法能够准确地使用边界条件,提高求解的精确度.     

边界处正交的曲线网格生成技术合理调节因子选取的研究

指出了 Thompson的曲线网格生成方法中调节因子的问题所在 ;借助于势流理论中的流线与势线正交的物理机理 ,导出了一种新的调节因子的表达式 ,并给出了曲线网格生成实例。实例检验表明 ,该调节因子能够对复杂边界的单连通域或多连通域的水域生成理想的曲线网格 ,即边界处网格正交 ,内部网格分布能够适应物理量场的变化情形。     

有限元网格自组织神经网络的自动生成

利用多个自组织神经网络的同时训练,可以一次性自动地生成计算区域内与计算区域边界上所有网格节点,尔后按FGT法的基本思想将节点连接成所需的三角形或四边形单元。由于在自组织神经网络中采用了改善的目标函数,节点的分布可以实现自适应调节以反映网格疏密分布的要求。文末几个算例验收证明本算法具有自适应性,适用于凸域、凹域、多连通域等多种情况。     

任意平面区域的变尺寸有限元网格划分

利用任意平面域边界表述中的拓年要素定义网格的控制信息,通过引入节点间距函数来控制区域内网格尺寸变化,并将结合前沿生成法和Ｄｅｌａｕｎａｙ三角化方法的优点,优先处理前沿的最长边,尽可能在局部生成边长逐渐减小的Ｄｅｌａｕｎａｙ三角形,最终实验区域内网格的疏密过渡。     

正交数值网格的生成及平面二维流场的数值模拟

提出了一种边界正交曲线网格的生成方法。在内域,求解拉普拉斯方程组生成二维正交曲线网格;在计算域边界,提出了正交曲线网格边界正交化处理的分段拉格朗日插值边界滑动法,并对控制方程N-S方程进行曲线坐标变换,使用SIMPLEC算法求解曲线坐标下的k-ε双方程湍流模型。文中以长江重庆九龙坡弯道河段正态模型为资料进行验证,计算了流场,数值模拟结果与实测结果吻合较好。     

基于图像四叉树的改进型比例边界有限元法研究

为提高数值计算的精度, 断裂力学问题的数值模拟需要在裂纹扩展的局部区域采用较密的网格, 而远离裂纹扩展的区域可采用较疏的网格, 且对于裂纹扩展问题的数值模拟, 大多数数值方法又存在局部网格重剖分的问题. 论文提出了一种基于图像四叉树的改进型比例边界有限元法用于模拟裂纹扩展问题, 该方法可根据结构域几何外边界的图像全自动进行四叉树网格剖分, 无需任何人工干预, 网格剖分效率极高, 由于比例边界有限元法本身的优势, 四叉树网格的悬挂节点可以直接地视为新的节点, 无需任何特殊处理. 通过引入虚节点的思想, 将裂纹与四叉树单元边界交叉点作为虚节点, 虚节点的自由度作为附加自由度处理, 并采用水平集函数表征材料内部的裂纹面, 含不连续裂纹面的子域可通过节点水平集函数识别, 使得裂纹扩展时无需进行网格重剖分, 界面的几何特征通过比例边界有限元子域的附加自由度表征. 最后, 通过若干算例验证了该方法的性能, 建议的改进型比例边界有限元法在求解复合型应力强度因子和模拟材料内部裂纹扩展路径时均具有较高的精度.      

高质量点集的快速局部网格生成算法

高效及高质量的局部网格生成算法是基于节点有限元并行方法设计的关键。泡泡布点算法能够在复杂区域上不经过人工干预生成高质量的节点集,本文提出了基于该方法所生成的节点集的快速局部网格生成算法。该算法充分利用泡泡布点方法提供的节点集及节点邻接链表信息,避免了桶数据结构的建立以及节点的局部搜索过程,只需应用Delaunay三角剖分的外接圆准则从中心节点的邻接链表中去除极少数的非卫星点,可快速地生成局部网格,比现有的局部网格生成算法更为快捷。算例结果表明,该算法高效可靠,生成网格与Delaunay三角剖分网格一致。     

黏弹性人工边界等效荷载计算的改进方法

黏弹性人工边界在场地地震反应和结构-地基动力相互作用等问题的计算中已得到了广泛的应用.地震波在黏弹性人工边界中的输入是通过将地震波转化为作用于人工边界处的等效载荷来实现的.计算等效节点载荷的常规方法默认边界节点对应区域内的应力为均布力,但实际上该节点对应区域内的应力分布通常是不均匀的.本文在有限元方法结合黏弹性局部人工边界的显式时域波动方法的基础上,建立了无限域散射问题地震波等效载荷计算的一种改进方法.该方法采用细化网格与应力积分相结合的方法计算人工边界等效节点力,有效地降低了人工边界上等效节点力的计算误差.以不同角度入射地震波的二维算例为例,算例给出的波场位移云图和节点位移时程曲线验证了本文方法的有效性,其计算精度与网格尺寸和地震波入射角度密切相关,且网格越小、入射角度越小,计算精度越高.对于相同的网格尺寸,本文采用方法的计算精度明显高于常规方法,尤其是对于斜入射问题优势更为明显.     

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

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

A grid‐free upwind relaxation scheme for inviscid compressible flows

A new grid‐free upwind relaxation scheme for simulating inviscid compressible flows is presented in this paper. The non‐linear conservation equations are converted to linear convection equations with non‐linear source terms by using a relaxation system and its interpretation as a discrete Boltzmann equation. A splitting method is used to separate the convection and relaxation parts. Least squares upwinding is used for discretizing the convection equations, thus developing a grid‐free scheme which can operate on any arbitrary distribution of points. The scheme is grid free in the sense that it works on any arbitrary distribution of points and it does not require any topological information like elements, faces, edges, etc. This method is tested on some standard test cases. To explore the power of the grid‐free scheme, solution‐based adaptation of points is done and the results are presented, which demonstrate the efficiency of the new grid‐free scheme. Copyright © 2005 John Wiley & Sons, Ltd.     

Enhancing control of grid distribution in algebraic grid generation

Three techniques are presented to enhance the control of grid-point distribution for a class of algebraic grid generation methods known as the two-, four- and six-boundary methods. First, multidimensional stretching functions are presented, and a technique is devised to construct them based on the desired distribution of grid points along certain boundaries. Second, a normalization procedure is proposed which allows more effective control over orthogonality of grid lines at boundaries and curvature of grid lines near boundaries. And third, interpolating functions based on tension splines are introduced to control curvature of grid lines in the interior of the spatial domain. In addition to these three techniques, consistency conditions are derived which must be satisfied by all user-specified data employed in the grid generation process to control grid-point distribution. The usefulness of the techniques developed in this study was demonstrated by using them in conjunction with the two- and four-boundary methods to generate several grid systems, including a three-dimensional grid system in the coolant passage of a radial turbine blade with serpentine channels and pin fins.     

一种新的准结构网格生成方法

在有限元分析中，高质量的结构网格可以有效地提高有限元分析的精度，但结构网格的几何适应性差，针对复杂边界的二维计算模型，现有的方法很难自动生成高质量的结构网格；而非结构网格几何适应性很好，但存在计算效率低和精度差等问题。提出了一种新的准结构网格生成方法，能够实现复杂区域的网格自动生成并且具有高网格质量。该方法首先对计算区域运用Delaunay三角剖分技术生成粗背景网格；然后利用背景网格，使用优化的Voronoi图生成过渡的蜂巢网格；最后，通过中心圆方法对蜂巢网格单元进行结构网格剖分。分析NACA0012翼型数值模拟结果表明，提出的新准结构网格生成方法能够对边界复杂的模型自动生成高质量的网格，并且通过三种不同拓扑类型网格计算结果相互对比及与实验结果对比，证明准结构网格具有高计算精度。     

An adaptive Cartesian grid generation method for ‘Dirty’ geometry

Traditional structured and unstructured grid generation methods need a ‘water‐tight’ boundary surface grid to start. Therefore, these methods are named boundary to interior (B2I) approaches. Although these methods have achieved great success in fluid flow simulations, the grid generation process can still be very time consuming if ‘non‐water‐tight’ geometries are given. Significant user time can be taken to repair or clean a ‘dirty’ geometry with cracks, overlaps or invalid manifolds before grid generation can take place. In this paper, we advocate a different approach in grid generation, namely the interior to boundary (I2B) approach. With an I2B approach, the computational grid is first generated inside the computational domain. Then this grid is intelligently ‘connected’ to the boundary, and the boundary grid is a result of this ‘connection’. A significant advantage of the I2B approach is that ‘dirty’ geometries can be handled without cleaning or repairing, dramatically reducing grid generation time. An I2B adaptive Cartesian grid generation method is developed in this paper to handle ‘dirty’ geometries without geometry repair. Comparing with a B2I approach, the grid generation time with the I2B approach for a complex automotive engine can be reduced by three orders of magnitude. Copyright © 2002 John Wiley & Sons, Ltd.     

A one-dimensional moving grid solution for the coupled non-linear equations governing multiphase flow in porous media. 1: Model development

A straightforward moving grid finite element method is developed to solve the one-dimensional coupled system of non-linear partial differential equations (PDEs) governing two- and three-phase flow in porous media. The method combines features from a number of self-adaptive grid techniques. These techniques are the equidistribution, the moving grid finite element and the local grid refinement/coarsening methods. Two equidistribution criteria, based on solution gradient and curvature, are employed and nodal distributions are computed iterativcly. Using the developed approach, an intermingle-free nodal distribution is guaranteed. The method involves examination of a single representative gradient to facilitate the application of moving grid algorithms to solve a non-linear coupled set of PDEs and includes a feature to limit mass balance error during nodal redistribution. The finite element part of the developed algorithm is verified against an existing finite difference model. A numerical simulation example involving a single-front two-phase flow problem is presented to illustrate model performance. Additional simulation examples are given in Part 2 of this paper. These examples include single and double moving fronts in two- and three-phase flow systems incorporating source/sink terms. Simulation sensitivity to the moving grid parameters is also explored in Part 2.     

Numerical solution of solidification in a square prism using an algebraic grid generation technique

The solidification of an infinitely long square prism was analyzed numerically. A front fixing technique along with an algebraic grid generation scheme was used, where the finite difference form of the energy equation is solved for the temperature distribution in the solid phase and the solid–liquid interface energy balance is integrated for the new position of the moving solidification front. Results are given for the moving solidification boundary with a circular phase change interface. An algebraic grid generation scheme was developed for two-dimensional domains, which generates grid points separated by equal distances in the physical domain. The current scheme also allows the implementation of a finer grid structure at desired locations in the domain. The method is based on fitting a constant arc length mesh in the two computational directions in the physical domain. The resulting simultaneous, nonlinear algebraic equations for the grid locations are solved using the Newton-Raphson method for a system of equations. The approach is used in a two-dimensional solidification problem, in which the liquid phase is initially at the melting temperature, solved by using a front-fixing approach. The difference of the current study lies in the fact that front fixing is applied to problems, where the solid–liquid interface is curved such that the position of the interface, when expressed in terms of one of the coordinates is a double valued function. This requires a coordinate transformation in both coordinate directions to transform the complex physical solidification domain to a Cartesian, square computational domain. Due to the motion of the solid–liquid interface in time, the computational grid structure is regenerated at every time step.     

A scheme for automatic generation of boundary-fitted depth- and depth-gradient- dependent grids in arbitrary two-dimensional regions

In this paper we present a scheme for the numerical generation of boundary-fitted grids that adapt to both water depth and depth gradient. The scheme can be used in arbitrary two-dimensional regions and is based on the application of the well-known control function approach to generate adaptive grids. The method includes the evaluation of water depths at the grid points from a known distribution of depth points and their associated depths plus a procedure for the numerical evaluation of depth gradients. It is demonstrated that the smoothness of the grid can be enhanced by introducing a suitable filtering technique.     

Generation of Voronoi Grid Based on Vorticity for Coarse-Scale Modeling of Flow in Heterogeneous Formations

We present a novel unstructured coarse grid generation technique based on vorticity for upscaling two-phase flow in permeable media. In the technique, the fineness of the gridblocks throughout the domain is determined by vorticity distribution such that where the larger is the vorticity at a region, the finer are the gridblocks at that region. Vorticity is obtained from single-phase flow on original fine grid, and is utilized to generate a background grid which stores spacing parameter, and is used to steer generation of triangular and finally Voronoi grids. This technique is applied to two channelized and heterogeneous models and two-phase flow simulations are performed on the generated coarse grids and, the results are compared with the ones of fine scale grid and uniformly gridded coarse models. The results show a close match of unstructured coarse grid flow results with those of fine grid, and substantial accuracy compared to uniformly gridded coarse grid model.     

二维自适应网格生成的改进AFT与背景网格法

在基于重生成的自适应有限元网格生成算法研究中,将推进波前法（AFT）与背景网格法结合并提出改进方法,有效地解决了网格生成和单元尺寸计算这两个关键问题。改进的AFT方法,将前沿区分为活跃前沿和非活跃前沿两类,在选取目标前沿时既考虑前沿尺寸又考虑前沿分类。改进的背景网格法,利用结构化栅格对背景网格进行管理,在栅格中直接存放背景网格中的单元,既提高了新单元尺寸的计算速度,又从数值上保证了新生成网格中单元之间尺寸合理过渡。     

CFD多块网格生成新进展

网格生成是计算流体力学的重要组成部分,多块网格在CFD实践中获得了广泛的应用．结合对网格生成技术规范和网格生成系统的讨论,综述了多块网格近年来的新进展,重点评述了网格拓扑和网格拼接技术（包括所谓的连续拼接、非结构拼接和广义拼接）,完整飞机外形多块网格生成策略,自动分块技术以及相应的块合井技术,CAD和CFD之间的数据交换技术和基于NURBS的曲面网格生成技术,网格质量分析和控制技术,若干网格生成新方法,以及多块网格在航空气动力数值模拟中的应用．