并行重叠/变形混合网格生成技术及其应用

为了适用于柔性变形、相对运动等复杂动边界问题,建立了并行环境下重叠和变形相结合的动态混合网格生成技术.通过计算区域分解以及分布式并行实现了重叠和变形技术的结合,其中重叠网格采用了并行化的隐式装配方法,并发展了两种并行化查询策略.变形网格则采用了并行化的径向基函数（RBF）插值方法.并行化动态网格生成方法大幅提高了动态网格生成效率,有利于处理大规模的动边界问题.在此基础上,发展了基于变形/重叠动态混合网格的流动/运动/控制一体化数值模拟方法,进一步改进了耦合模拟软件平台——HyperFLOW.典型应用算例证明了该动态混合网格技术及一体化算法的实用性.      

一类基于RBF插值的守恒重映算法

为保证重映过程的高守恒精度和单调性,并且在间断处具有极高的分辨率,基于径向基函数(RBF)插值方法构造了一类适用于任意网格的RBF守恒重映算法,通过计算守恒误差测试重映算法的守恒精度。将该方法用于光滑函数和含有间断的函数,并与其它守恒重映方法比较,表明该方法数值结果较好。     

振动桥梁CFD数值模拟的网格运动算法

针对非流线型桥梁断面模型,采用Delaunay背景网格方法、棱边弹簧及线性弹簧网格方法,研究非结构网格与结构网格条件下,计算域网格运动的特点及算法优劣.研究表明,在正常的桥梁断面振动振幅内,三种网格运动方法均能保持网格变形时不会失效,其中Delaunay背景网格方法耗时最少,线性弹簧网格方法获得网格质量最高;在大振幅状态下,结构化网格容易失效,线性弹簧网格方法可最大限度保证网格有效.     

基于无网格点插值法的旋转悬臂梁的动力学分析

将基于多项式点插值的无网格方法用于旋转悬臂梁的动力学分析. 利用无网格点插值方法对柔性梁的变形场进行离散, 考虑梁的纵向拉伸变形和横向弯曲变形, 并计入横向弯曲变形引起的纵向缩短, 即非线性耦合项, 运用第二类Lagrange方程推导得到系统刚柔耦合动力学方程. 与有限元法相比, 该方法只需节点信息, 无需定义单元, 具有前处理简单的优势; 构造的形函数采用更多的节点插值, 具有高阶连续性. 将无网格点插值方法的仿真结果与有限元和假设模态法进行比较分析, 验证了该方法的正确性, 并表明其作为一种柔性体离散方法在刚柔耦合多体系统动力学的研究中具有可推广性.     

ENO守恒插值(重映)方法及其在流体计算中的应用

在ENO(Essentially Non-oscillatory)守恒插值方法的基础上,分析和研究现今流体力学计算中涉及的几类网格技术:重叠网格技术、自适应加密技术和运动网格技术.基于ENO插值多项式构造的重映方法具有良好的守恒性,可以有效保证数据传递中物理量的总体守恒.提出该类守恒插值方法在以上几种网格技术中的一些应用前景,并给出一些数值算例.     

利用N-S方程模拟机翼气动弹性的一种计算方法

利用一种双时间方法求解三维非定常N-S方程,得到与任意非定常运动对应的气动力,在求解非定常气动力的同时,在时间域内用二阶龙格 库塔方法求解机翼弹性运动方程,从而模拟粘性流动中的气动弹性全过程.为保证网格生成效率,采用无限插值理论生成O-H型代数网格,考虑了机翼变形时的网格生成问题,并得到计算结果.     

耦合径向基函数与多项式基函数的无网格方法

耦合径向基函数和多项式基函数,形成一种新的近似函数.该近似函数对散乱分布的离散数据点进行逼近时,只需节点信息,不需要划分网格.详细描述了耦合近似函数的建立、属性、插值行为及其形函数和形函数导数的性质.最后引入修正变分原理和单位分解积分技术求解边值问题,并给出了计算实例,表明耦合径向基函数和多项式基函数是一种非常有效的方法.     

势问题的径向基函数——局部边界积分方程方法

将基于径向基函数构造的具有插值特性的近似函数和局部边界积分方程方法相结合，建立了求解势问题的径向基函数——局部边界积分方程方法，推导了相应离散方程.与其他边界积分方程的无网格方法相比，本文方法具有数值实现过程简单、计算量小、精度高的优点，并可直接施加边界条件.最后通过算例说明了该方法的有效性. 关键词： 径向基函数 无网格方法 局部边界积分方程 势问题     

径向基函数及其耦合方法在电磁场数值计算中的应用

针对带电导体附近急剧变化的位函数和场函数这一难于处理的边界条件,将小波函数的紧支撑特性和全域径向基函数(RBF)的高精度逼近能力相结合,提出电磁场边值问题求解的耦合方法并应用于接地金属槽/箱的数值计算中;将径向基函数无网格方法引入波导本征值的计算中,给出其求解本征问题的思路,建立相应的离散方程,分析矩形、圆形和脊形波导的本征值并与有限元方法进行比较.数值仿真实验表明,径向基函数及其耦合方法在分析电磁场边值和本征值问题时是有效的且具有实现简单、节点少和精度高的优势.     

基于改进RBF神经网络的变形场插值算法研究

传统的物体表面力学变形场计算方法存在计算量大,无法计算边缘点变形等问题;提出一种改进的萤火虫算法优化RBF神经网络的变形插值方法,利用阈值约束RBF神经网络隐含层结点数,运用可变步长萤火虫算法优化RBF神经网络隐含层节点的中心和宽度,采用递推最小二乘法计算隐含层到输出层之间的权值,建立物体表面位移神经网络插值模型;为提高位移插值精度,在训练和测试的输入中增加坐标组合数据;应用于混凝土梁三点弯实验,仿真结果表明,该算法比常用的神经网络算法有更快的仿真速度和更高的预测精度,可用于土工材料表面变形场的快速、准确的计算。     

强爆炸火球辐射流体自适应网格高精度数值模拟

提出一种自适应网格方法,应用于基于Euler方法的强爆炸辐射流体高精度数值求解。通过与Zinn数值结果对比,验证该方法的正确性。研究自适应网格对冲击波和光辐射输出模拟精度的影响,对比不同网格尺度下的计算耗时。在相同的条件下,使用自适应网格与均匀网格加密3倍得到的冲击波超压分布、光辐射输出演化接近,计算效率提升约8.5倍。由此可知,提出的自适应网格方法可用于强爆炸问题的高精度数值模拟,显著地提升模拟精度和模拟效率。     

An Efficient Dynamic Mesh Generation Method for Complex Multi-Block Structured Grid

Aiming at a complex multi-block structured grid, an efficient dynamic mesh generation method is presented in this paper, which is based on radial basis functions (RBFs) and transfinite interpolation (TFI). When the object is moving, the multi-block structured grid would be changed. The fast mesh deformation is critical for numerical simulation. In this work, the dynamic mesh deformation is completed in two steps. At first, we select all block vertexes with known deformation as center points, and apply RBFs interpolation to get the grid deformation on block edges. Then, an arc-lengthbased TFI is employed to efficiently calculate the grid deformation on block faces and inside each block. The present approach can be well applied to both two-dimensional (2D) and three-dimensional (3D) problems. Numerical results show that the dynamic meshes for all test cases can be generated in an accurate and efficient manner.     

Reduced surface point selection options for efficient mesh deformation using radial basis functions

Previous work by the authors has developed an efficient method for using radial basis functions (RBFs) to achieve high quality mesh deformation for large meshes. For volume mesh deformation driven by surface motion, the RBF system can become impractical for large meshes due to the large number of surface (control) points, and so a particularly effective data reduction scheme has been developed to vastly reduce the number of surface points used. The method uses a chosen error function on the surface mesh to select a reduced subset of the surface points; this subset contains a sufficiently small number of points so as to make the volume deformation fast, and a correction function is used to correct those surface points not included. Hence, the scheme is split such that both parts are working on appropriate problems. RBFs are an excellent way of finding smooth orthogonality preserving global deformations, but are less suitable for enforcing an exact geometry for a large number of points, while a simpler approach is ideal for diffusing small changes evenly but has quality (and possibly expense) drawbacks if used for the entire volume. However, alternatives exist for the error function used to select the reduced data set, so here a comparison is made between three different options: the surface error function, the unit function and the power function. Tests run on structured and unstructured meshes show that the surface error function gives the lowest errors, but this also requires a deformed surface shape to be known in advance of the simulation. The unit and power functions both avoid the need for a deformed surface, and the unit function is shown to be superior.     

CAD and mesh repair with Radial Basis Functions

In this paper we present a process that includes both model/mesh repair and mesh generation. The repair algorithm is based on an initial mesh that may be either an initial mesh of a dirty CAD model or STL triangulation with many errors such as gaps, overlaps and T-junctions. This initial mesh is then remeshed by computing a discrete parametrization with Radial Basis Functions (RBF’s).We showed in [1] that a discrete parametrization can be computed by solving Partial Differential Equations (PDE’s) on an initial correct mesh using finite elements. Paradoxically, the meshless character of the RBF’s makes it an attractive numerical method for solving the PDE’s for the parametrization in the case where the initial mesh contains errors or holes. In this work, we implement the Orthogonal Gradients method to be described in [2], as a RBF solution method for solving PDE’s on arbitrary surfaces.Different examples show that the presented method is able to deal with errors such as gaps, overlaps, T-junctions and that the resulting meshes are of high quality. Moreover, the presented algorithm can be used as a hole-filling algorithm to repair meshes with undesirable holes. The overall procedure is implemented in the open-source mesh generator Gmsh [3].     

多重网格法在非结构网格中的应用

将多重网格法运用于非结构网格.网格是通过聚合法得到的,网格之间是相互关联的.方程的求解采用Jamson的有限体积法.给出了二维、三维情况的数值算例.     

An improved penalty immersed boundary method for fluid–flexible body interaction

An improved penalty immersed boundary (pIB) method has been proposed for simulation of fluid–flexible body interaction problems. In the proposed method, the fluid motion is defined on the Eulerian domain, while the solid motion is described by the Lagrangian variables. To account for the interaction, the flexible body is assumed to be composed of two parts: massive material points and massless material points, which are assumed to be linked closely by a stiff spring with damping. The massive material points are subjected to the elastic force of solid deformation but do not interact with the fluid directly, while the massless material points interact with the fluid by moving with the local fluid velocity. The flow solver and the solid solver are coupled in this framework and are developed separately by different methods. The fractional step method is adopted to solve the incompressible fluid motion on a staggered Cartesian grid, while the finite element method is developed to simulate the solid motion using an unstructured triangular mesh. The interaction force is just the restoring force of the stiff spring with damping, and is spread from the Lagrangian coordinates to the Eulerian grids by a smoothed approximation of the Dirac delta function. In the numerical simulations, we first validate the solid solver by using a vibrating circular ring in vacuum, and a second-order spatial accuracy is observed. Then both two- and three-dimensional simulations of fluid–flexible body interaction are carried out, including a circular disk in a linear shear flow, an elastic circular disk moving through a constricted channel, a spherical capsule in a linear shear flow, and a windsock in a uniform flow. The spatial accuracy is shown to be between first-order and second-order for both the fluid velocities and the solid positions. Comparisons between the numerical results and the theoretical solutions are also presented.     

A Hybrid Method for Dynamic Mesh Generation Based on Radial Basis Functions and Delaunay Graph Mapping

Aiming at complex configuration and large deformation, an efficient hybrid method for dynamic mesh generation is presented in this paper, which is based on Radial Basis Functions (RBFs) and Delaunay graph mapping. Based on the computational mesh, a set of very coarse grid named as background grid is generated firstly, and then the computational mesh can be located at the background grid by Delaunay graph mapping technique. After that, the RBFs method is applied to deform the background grid by choosing partial mesh points on the boundary as the control points. Finally, Delaunay graph mapping method is used to relocate the computational mesh by employing area or volume weight coefficients. By applying different dynamic mesh methods to a moving NACA0012 airfoil, it can be found that the RBFs-Delaunay graph mapping hybrid method is as accurate as RBFs and is as efficient as Delaunay graph mapping technique. Numerical results show that the dynamic meshes for all test cases including one two-dimensional (2D) and two three-dimensional (3D) problems with different complexities, can be generated in an accurate and efficient manner by using the present hybrid method.     

Efficient mesh motion using radial basis functions with data reduction algorithms

Mesh motion using radial basis functions has been demonstrated previously by the authors to produce high quality meshes suitable for use within unsteady and aeroelastic CFD codes. In the aeroelastic case the structural mesh may be used as the set of control points governing the deformation, which is efficient since the structural mesh is usually small. However, as a stand alone mesh motion tool, where the surface mesh points control the motion, radial basis functions may be restricted by the size of the surface mesh, as an update of a single volume point depends on all surface points. In this paper a method is presented that allows an arbitrary deformation to be represented to within a desired tolerance by using a significantly reduced set of surface points intelligently identified in a fashion that minimises the error in the interpolated surface. This method may be used on much larger cases and is successfully demonstrated here for a 10⁶ cell mesh, where the initial solve phase cost reduces by a factor of eight with the new scheme and the mesh update by a factor of 55. It has also been shown that the number of surface points required to represent the surface is only geometry dependent (i.e. grid size independent), and so this reduction factor actually increases for larger meshes.