基于自然元法和精细积分法的功能梯度材料瞬态热传导问题求解

为促进无网格法分析技术在热传导分析中的应用,提出空间离散采用自然单元法、时间离散采用精细积分法求解功能梯度材料瞬态热传导问题的数值计算方法.在计算过程中,取高斯点的材料参数模拟功能梯度材料特性的变化.温度场采用自然邻接点插值形函数进行离散插值.数值算例验证该数值算法的正确性和有效性.     

基于无网格局部Petrov-Galekin法的板结构拓扑优化

为将无网格法的优势集成到结构拓扑优化中,基于无网格局部Petrov-Galerkin(Meshless Local Petrov-Galerkin,MLPG)法进行板结构的拓扑优化.基于带惩罚的各向同性固体微结构(Solid Isotropic Microstructure with Penalization,SIMP)的拓扑优化模型和优化准则法建立设计变量的优化修正方案.位移场和相对密度场均采用自然邻接点插值形函数进行离散插值.几种典型的拓扑优化算例证明该数值算法的正确性和有效性.     

基于结合扩展精度技术的基本解方法的非线性功能梯度材料热传导问题求解

采用基本解方法结合扩展精度技术和Kirchhoff变换求解功能梯度材料的二维热传导问题.在求解瞬态热传导问题时运用Laplace变换处理时间变量,将时域问题转化为频域问题求解;采用基本解方法计算得到高精度的频域数值解,再分别采用Stehfest和Talbot这2种数值Laplace逆变换恢复原瞬态热传导问题的计算结果.通过3个非线性功能梯度材料的稳态和瞬态热传导基准算例,分析结合扩展精度技术的基本解方法的计算精度与扩展精度位数、边界布点数和虚拟边界参数三者之间的关系.比较Stehfest和Talbot这2种数值Laplace逆变换算法的优劣.采用结合扩展精度技术的基本解方法数值研究热传导系数随位置剧烈变化的功能梯度材料热传导行为.数值结果表明该方法具有求解精度高、适用性好等特点,能高效模拟非线性功能梯度材料的二维稳态与瞬态热传导行为.     

硬件加速的渐进式多边形模型布尔运算

多边形模型的布尔运算中包含复杂的求交计算以及多边形重建过程,精度控制和处理效率是其中的关键.为了降低布尔运算复杂度,提出一种适合硬件加速的基于渐进式布尔运算的多层次细节网格模型生成方法.该方法采用分层深度图像来近似表示多边形实体的封闭边界,将多边形的求交计算简化为坐标轴平行的采样点的实体内外部判断;为了免去各层次细节模型的重复采样过程,渐进式地将边界采样点归并到低分辨率下的立方体中;运用特征保持的多边形重建算法将相同立方体内的边界采样点转换成多边形顶点,根据邻接关系生成网格模型.上述算法使用支持图形硬件加速的CUDA编程并行实现.实验结果表明了算法的可行性.     

基于简化多边形类正切空间表示的图形渐变算法

采用多边形简化的方法提取出包含源图形主要特征点的多边形.在简化多边形的类正切空间表示下,利用图形对应边在渐变过程中所掠过面积总和最小这一特征构造相似度量函数,由动态规划算法求解实现初始和目标简化多边形之间的顶点对应,再进一步建立源图形顶点之间的整体对应,最后通过插值边和角的方法实现图形渐变.实验结果表明:该算法简单有效,对应效果自然、合理.     

多边形中的点可见性快速算法

针对点的可见性计算这一计算几何中的基础问题,提出一种支持任意查询点的可见多边形快速计算的基于多边形Voronoi图的点可见性算法.以与Voronoi骨架路径对应的Voronoi通道概念,以及相应的局部最短路径概念为基础,按照深度优先策略对Voronoi图进行遍历,在计算Voronoi骨架路径的同时计算局部最短路径,并基于局部最短路径计算所遍历的多边形边的可见部分.该算法可以处理“带洞”多边形,而且只对多边形进行局部访问;对于“带洞”多边形,由于该算法的数据结构比较简单、剖分空间合理且易于实现,因此仅需O(n)空间和O(nlgn)预处理时间.最后给出了在三维室内虚拟场景设计与漫游系统中的应用实例,结果表明文中算法是实际可行,且运行时间与点的可见多边形的边数和多边形的边数均呈线性关系.     

一种基于多边形剖分的有限元网格生成方法

在两步网格化过程中,待分析区域首先被剖分为具有三条或四条边的简单子区域部分.然后将利用传递模板法或映射法对这些子区域进行网格生成.本文结合计算几何和有限元网格自动生成问题,给出了一种基于简单多边形剖分的全四边形有限元网格自动生成方法.该方法分两步实现有限元网格生成首先通过权函数的引导,对待分析的简单多边形区域先进行子域剖分,得到一组三角形和凸四边形子域(大单元)的集合;然后利用中点剖分方法,将三角形和凸四边形子域单元剖分为全四边形有限元网格.实践证明,本文提出的方法实现简单、使用灵活,结果网格的质量良好.     

一种加权剖分简单多边形为三角形和凸四边形子域的算法

针对计算几何与有限元网格自动剖分中多边形子域剖分问题，给出了一种适用于有限元网格子域单元（即大单元）剖分的标准，并提出了一种通过在可视点对之间引进适当的多边形剖分和根据子域单元的形状质量判定因子来引导剖分的算法。由于建立的权函数和凹角（凸角）本身有关，因此对同属于凹角（凸角）的权函数也可以加以权值上的区分。该算法通过分步进行剖分，即先将简单多边形剖分为凸多边形，然后再将凸多边形剖分为凸六边形和凸五边形，最后将凸六边形和凸五边形剖分为三角形和凸四边形，以得到满足要求的剖分结果。在以上的每个剖分过程中，都引进了权重来引导剖分，使得剖分结果更加优化、合理。     

STL模型的分层邻接排序快速切片算法

为提高STL模型切片效率,节省系统资源,提出STL模型分层邻接排序快速切片算法.采用邻接插入法建立三角形邻接关系,根据三角形各点坐标在切片方向上投影的最大值和最小值反求与此三角形相交的切片平面,并通过分析相邻2个三角形公共边与切片平面的位置关系,按邻接顺序建立交点链表.与已有的基于STL全模型拓扑信息提取的切片算法以及...     

基于网格中心点的点在多边形内的高效判定

提出一种基于均匀网格的点在多边形内的高效判定算法.它首先建立均匀网格,并从左至右依次计算每个网格单元中心点的位置属性.每个单元中心点的位置属性直接依据其左侧邻接单元已知位置属性的中心点快速获得.在判定点的位置时,确定被测点所在单元,并依据该单元中心点的位置属性判定被测点的位置属性.由于预处理和判定时均利用邻近点的已知位置属性来确定未知点位置属性,可以很好地进行局部化的计算.因此,新方法比现有方法快很多,并且其预处理时间复杂度也由同类网格算法的O(N3/2)下降为O(N).同时,新方法可以统一处理含有自相交及重叠边的非流形多边形.实验结果表明,相比于其他基于均匀网格的方法,新方法可将预处理的速度提高几倍,将判断计算的速度提高十几到几十倍.其速度甚至优于具有该问题最低判定计算时间复杂度O(logN)的基于凸剖分的判定算法.     

移动最小二乘法导数近似讨论

在移动最小二乘法（moving least squares method, MLS）构造无网格形函数的数值方法中,通常采用无单元伽辽金法（element-free Galerkin method, EFG）的建议,将系数向量a参与导数运算。为探讨这种导数近似算法在更一般无网格法中的适用性和合理性,针对系数向量a是否应参与运算的问题进行讨论和数值检验。结果表明：单纯从近似意义上讲,这种将系数向量代入导数运算的算法并不具有优势;从数值方法的应用意义上讲,这种导数近似算法对数值求解,特别是强式无网格法,会带来一系列潜在不稳定的问题。建议在MLS导数近似中,系数向量a不应当参与导数运算,并提出采用一种由核基函数代替普通基函数的核近似法。     

Simulating free surface problems using Discrete Least Squares Meshless method

A Discrete Least Squares Meshless (DLSM) method is presented here for the simulation of incompressible free surface flows. The governing equations of the mass and momentum conservations are solved in a Lagrangian form using a pressure projection method. Since there are no particles in the outer region of the free surface, the particle density will drop significantly. Free surfaces are, therefore, resolved by tracking particles with highly reduced density. A fully least squares approach is used in both function approximation and the discretization of the governing differential equations in space. The meshless shape functions are derived using the Moving Least Squares (MLS) method of function approximation. The discretized equations are obtained via a discrete least squares method in which the sum of the squared residuals are minimized with respect to unknown nodal parameters. The method enjoys the advantage of producing symmetric, positive definite matrixes for the cases considered. The method can be viewed as a truly meshless method since it does not need any mesh for both field variable approximation and the construction of system matrices. Two free surface problems namely dam break and evolution of a drop with an initial known velocity are solved to test the accuracy of the proposed method. The results show the ability of the proposed method to solve complex fluid dynamic problems with moving free surface boundaries.     

The discrete collocation method for Fredholm–Hammerstein integral equations based on moving least squares method

The purpose of this paper is to investigate the discrete collocation method based on moving least squares (MLS) approximation for Fredholm–Hammerstein integral equations. The scheme utilizes the shape functions of the MLS approximation constructed on scattered points as a basis in the discrete collocation method. The proposed method is meshless, since it does not require any background mesh or domain elements. Error analysis of this method is also investigated. Some numerical examples are provided to illustrate the accuracy and computational efficiency of the method.     

Moving least squares collocation method for Volterra integral equations with proportional delay

In this work, we apply the moving least squares (MLS) method for numerical solution of Volterra integral equations with proportional delay. The scheme utilizes the shape functions of the MLS approximation constructed on scattered points as a basis in the discrete collocation method. The proposed method is meshless, since it does not require any background mesh or domain elements. An error bound is obtained to ensure the convergence and reliability of the method. Numerical results approve the efficiency and applicability of the proposed method.     

The boundary element-free method for 2D interior and exterior Helmholtz problems

The boundary element-free method (BEFM) is developed in this paper for numerical solutions of 2D interior and exterior Helmholtz problems with mixed boundary conditions of Dirichlet and Neumann types. A unified boundary integral equation is established for both interior and exterior problems. By using the improved interpolating moving least squares method to form meshless shape functions, mixed boundary conditions in the BEFM can be satisfied directly and easily. Detailed computational formulas are derived to compute weakly and strongly singular integrals over linear and higher order integration cells. Three numerical integration procedures are developed for the computation of strongly singular integrals. Numerical examples involving acoustic scattering and radiation problems are presented to show the accuracy and efficiency of the meshless method.     

The element-free Galerkin method for the nonlinear p-Laplacian equation

The element-free Galerkin (EFG) method is developed in this paper for solving the nonlinear p-Laplacian equation. The moving least squares approximation is used to generate meshless shape functions, the penalty approach is adopted to enforce the Dirichlet boundary condition, the Galerkin weak form is employed to obtain the system of discrete equations, and two iterative procedures are developed to deal with the strong nonlinearity. Then, the computational formulas of the EFG method for the p-Laplacian equation are established. Numerical results are finally given to verify the convergence and high computational precision of the method.     

Meshless local numerical procedure based on interpolating moving least squares approximation and exponential time differencing fourth-order Runge–Kutta (ETDRK4) for solving stochastic parabolic interface problems

The main propose of this investigation is to develop an interpolating meshless numerical procedure for solving the stochastic parabolic interface problems. The present numerical algorithm is constructed from the interpolating moving least squares (ISMLS) approximation. At first, the space variable has been discretized by using the ISMLS approximation. Then, the PDE reduces to the system of nonlinear ODEs. In the next, to achieve a high-order numerical formula, we employ a fourth-order time discrete scheme that is well-known as the explicit fourth-order exponential time differencing Runge-Kutta method (ETDRK4). This method is simple and has acceptable accuracy for solving the considered problems. Several examples with adequate intricacy are examined to check the new numerical procedure.

     

移动最小二乘法研究进展与述评

为使移动最小二乘法能更好地应用到无网格方法中,详细阐述移动最小二乘逼近法、移动最小二乘插值法、MUKHERJEE改进的移动最小二乘法以及程玉民等提出的改进的移动最小二乘法和复变量移动最小二乘法等的研究进展,述评各种移动最小二乘法的优缺点,并概述各种移动最小二乘法形成的无网格方法的研究进展.     

移动最小二乘代理模型支持域半径的优化方法

移动最小二乘代理模型描述局部波动的能力优于一般的代理模型,但其精度受支持域半径的影响。在经验公式的基础上提出了一种针对移动最小二乘代理模型支持域半径的优化方法。对支持域内抽样点数寻优获取最佳半径值,提高近似精度进而达到减少抽样点的目的。数值实验结果表明,对于不同基函数阶次和权函数的情况,提出的方法大大提高了移动最小二乘代理模型的近似精度,与基于经验公式的移动最小二乘代理模型相比,其仅需较少的抽样点即可达到相同的近似精度。