基于结构化网格自动划分的汽车发动机强度分析

使用三维设计软件CATIA设计了汽车发动机的复杂结构,然后在网格划分软件HARPOON中将设计的发动机零件自动划分为以结构化六面体网格为主的有限元网格,最后在大型非线性有限元软件ABAQUS中,分析了发动机在静力和动力作用下的应力分布.计算结果表明,采用结构化六面体网格,单元数量少,计算速度快,结果可靠;而采用四面体网格,单元数量大,对于同样配置的计算机,无法进行四面体网格的模型的计算.网格尺寸增加后,单元数量减少,计算机可以计算四面体网格模型,但计算结果与六面体网格偏差比较大.     

基于几何造型的有限元前处理技术

本文在综述了有限元网格生成技术的基础上,着重介绍一个基于几何造型系统的有限元分析的前处理系统。这个系统作为几何造型系统与有限元分析程序之间的接口,主要功能是对几何造型系统的二维任意形体进行有限元网格的划分,并能够进行局部加密,自动节点编号,交互划分定义单元组,定义单元节点信息、载荷信息、边界条件等,最终生成有限元分析程序所需的输入文件。同时,还能够处理平移扫描体和旋转扫描体等二维半形体。本文主要算法可以推广到三维形体的网格生成,实现对更广泛的三维结构的有限元网格生成。     

基于过渡边的细化算法及其在舱口角隅处的应用

为了获得更精确的分析结果,在集装箱船舱口角隅应力集中的区域,采用添加过渡单元的方法对原有的粗网格进行细化,然后对局部模型再次进行有限元分析.以此提出一种自动的有限元精细划分的算法.介绍构造过渡单元的方法,并根据计算出的迭代次数,得到细网格后进行分析.最后的结果表明,细化网格后生成的新单元与母单元属性保持一致,对于应力变化剧烈的区域,分析结果好于整体分析的结果.     

一种网格和节点同步生成的二维Delaunay网格划分算法

应用Lawson算法对网格的Delaunay性质进行维护,利用单元尺度场控制生成网格的疏密分布;找到任一不满足尺度场要求的单元,在其可插度最大的边上按一定法则插入新节点,加密网格,实现内节点的生成与网格划分同步进行.该算法避免了搜寻包含三角形的过程,提高了效率.通过多次划分实验表明,该算法的时间复杂度约为O(N1.2).同时,由于在不满足单元尺寸要求的单元边上插入新节点,直接对单元的边长进行控制,使得网格的质量和自适性更加良好.     

基于片分割的六面体网格生成方法

为了发展一种保证边界质量、考虑全局信息、具有较高计算效率的六面体网格生成技术,提出了基于片分割的六面体网格生成方法.首先在标架场的指引下由实体表面的环扩展出一层六面体单元,然后用该六面体单元层将原实体分割为2个更小规模的子实体,最后采用同样的方式递归处理子实体直至子实体为空.该方法采用分而治之的策略,适宜于并行化.数值实验结果表明,文中方法生成的网格与当前领先的网格生成方法生成的网格质量相当.     

三维实体有限元自适应网格规划生成

为实现三维实体有限元网格自适应生成,设计了中心点、沿指定曲线和基于实体表面等网格加密生成方式;并根据分析对象几何特征和物理特性经验估计,以规划的方式构造自适应网格单元尺寸信息场．在此基础上,提出基于Delaunay剖分的动态节点单元一体化算法,生成几何特征和物理特性整体自适应的有限元网格．     

hp自适应有限元计算中一种新的自适应策略

本文对hp自适应策略进行了研究,在前人提出的几种基于误差下降预测的hp自适应策略的基础上给出了一个新的hp自适应加密策略.该策略适用于二维三角形、四边形和三维四面体、六面体等不同类型的单元,适用于正则加密、二分加密等不同自适应加密方式.数值实验表明,该策略可以达到最优的误差指数下降阶,并在数值解的精度和计算效率上优于文献中的一些策略.该部分工作已集成到自适应有限元计算框架PHG的hp自适应模块.     

飞机蒙皮拉形模拟中上压模具网格的生成技术

为了解决飞机蒙皮拉形有限元仿真中上压模具(简称上模)与下模具(简称下模)型面网格间的协调问题,提出了以切割下模网格、调整不良网格、生成圆角和侧壁、单元与节点重新编号、网格厚向偏移等为主要步骤的上模网格生成过程.在切割下模网格时,根据被切型面网格的节点及其所在单元相对于切割平面的位置来判断该单元是否属于上模网格,并对单元与节点进行相应处理;对切割后的不良网格进行了形状与法向的调整,并在网格切割线位置按照给定宽度生成圆角单元,按给定的最大高度及高度方向上的单元数量生成侧壁单元;采用图论法对节点及单元重新编号,再按照零件厚度沿网格的法向进行网格偏移.对复杂的S形蒙皮、进气道蒙皮和翼身融合蒙皮的上模网格模型的生成进行验证的结果表明,采用文中提出的生成过程与方法能够顺利地生成与下模网格面相协调的上模网格.     

用局部阻尼波形法的自连贯网格生成法

介绍将生成或已有的有限元规则六面体单元改变成形状复杂且光滑的六面体单元的一种新技术——波形法．简单建立了波形法的数学模型并编程进行了网格生成．实验结果表明,只要把复杂外部形状按波的形式传输给指定的规则六面体单元模型,就可以得到具有复杂外部形状的六面体单元网格模型,且网格生成速度快、不出现单元或节点漏洞、欠缺等问题,同时不受单元类型的限制。     

基于投影法三维模型全六面体网格的划分方法

针对六面体网格自动划分的难度远高于四面体网格的问题,用投影法对简单形状的初始网格进行投影变换得到每个块体的实际网格,用节点合并算法和再分割技术实现不同块体之间的不同密度网格的过渡,从而生成复杂三维几何形体的全六面体网格.算例表明：该方法生成的网格质量很好,易于实施,适用性广.     

HP90: A general and flexible Fortran 90 hp-FE code

A general 2D-hp-adaptive Finite Element (FE) implementation in Fortran 90 is described. The implementation is based on an abstract data structure, which allows to incorporate the full hp-adaptivity of triangular and quadrilateral finite elements. The h-refinement strategies are based on h2-refinement of quadrilaterals and h4-refinement of triangles. For p-refinement we allow the approximation order to vary within any element. The mesh refinement algorithms are restricted to 1-irregular meshes. Anisotropic and geometric refinement of quadrilateral meshes is made possible by additionally allowing double constrained nodes in rectangles. The capabilities of this hp-adaptive FE package are demonstrated on various test problems. Received: 18 December 1997 / Accepted: 17 April 1998     

Adaptive multiple-levelh-refinement in automated finite element analyses

This paper discusses an automatic, adaptive finite element modeling system consisting of mesh generation, finite element analysis, and error estimation. The individual components interact with one another and efficiently reduce the finite element error to within an acceptable value and perform only a minimum number of finite element analyses.One of the necessary components in the automated system is a multiple-level local remeshing algorithm. Givenh-refinement information provided by an a posteriori error estimator, and adjacency information available in the mesh data structures, the local remeshing algorithm grades the refinement toward areas requesting refinement. It is shown that the optimal asymptotic convergence rate is achieved, demonstrating the effectiveness of the intelligent multiple-level localh-refinement.     

A template-based approach for parallel hexahedral two-refinement

We provide a template-based approach for generating locally refined all-hex meshes. We focus specifically on refinement of initially structured grids utilizing a 2-refinement approach where uniformly refined hexes are subdivided into eight child elements. The refinement algorithm consists of identifying marked nodes that are used as the basis for a set of four simple refinement templates. The target application for 2-refinement is a parallel grid-based all-hex meshing tool for high performance computing in a distributed environment. The result is a parallel consistent locally refined mesh requiring minimal communication and where minimum mesh quality is greater than scaled Jacobian 0.3 prior to smoothing.     

基于几何造型的有限元网格的自适应生成

介绍一个基于几何造型系统的有限元分析的前处理系统。该系统可对几何造型的二维任意形体进行快速可靠的Ｄｅｌａｕｎａｙ三角剖分，提出网格自动生成的网格密度的控制和基于误差估计的自适应有限元网格生成算法，并给出了应用实例。     

HexBox: Interactive Box Modeling of Hexahedral Meshes

We introduce HexBox, an intuitive modeling method and interactive tool for creating and editing hexahedral meshes. Hexbox brings the major and widely validated surface modeling paradigm of surface box modeling into the world of hex meshing. The main idea is to allow the user to box-model a volumetric mesh by primarily modifying its surface through a set of topological and geometric operations. We support, in particular, local and global subdivision, various instantiations of extrusion, removal, and cloning of elements, the creation of non-conformal or conformal grids, as well as shape modifications through vertex positioning, including manual editing, automatic smoothing, or, eventually, projection on an externally-provided target surface. At the core of the efficient implementation of the method is the coherent maintenance, at all steps, of two parallel data structures: a hexahedral mesh representing the topology and geometry of the currently modeled shape, and a directed acyclic graph that connects operation nodes to the affected mesh hexahedra. Operations are realized by exploiting recent advancements in grid-based meshing, such as mixing of 3-refinement, 2-refinement, and face-refinement, and using templated topological bridges to enforce on-the-fly mesh conformity across pairs of adjacent elements. A direct manipulation user interface lets users control all operations. The effectiveness of our tool, released as open source to the community, is demonstrated by modeling several complex shapes hard to realize with competing tools and techniques.     

Mesh refinement strategies for solving singularly perturbed reaction-diffusion problems

We consider the numerical approximation of a singularly perturbed reaction-diffusion problem over a square. Two different approaches are compared namely: adaptive isotropic mesh refinement and anisotropic mesh refinement. Thus, we compare the h-refinement and the Shishkin mesh approaches numerically with PLTMG software [1]. It is shown how isotropic elements lead to over-refinement and how anisotropic mesh refinement is much more efficient in thin boundary layers.     

Eulerian shape design sensitivity analysis and optimization with a fixed grid

Conventional shape optimization based on the finite element method uses Lagrangian representation in which the finite element mesh moves according to shape change, while modern topology optimization uses Eulerian representation. In this paper, an approach to shape optimization using Eulerian representation such that the mesh distortion problem in the conventional approach can be resolved is proposed. A continuum geometric model is defined on the fixed grid of finite elements. An active set of finite elements that defines the discrete domain is determined using a procedure similar to topology optimization, in which each element has a unique shape density. The shape design parameter that is defined on the geometric model is transformed into the corresponding shape density variation of the boundary elements. Using this transformation, it has been shown that the shape design problem can be treated as a parameter design problem, which is a much easier method than the former. A detailed derivation of how the shape design velocity field can be converted into the shape density variation is presented along with sensitivity calculation. Very efficient sensitivity coefficients are calculated by integrating only those elements that belong to the structural boundary. The accuracy of the sensitivity information is compared with that derived by the finite difference method with excellent agreement. Two design optimization problems are presented to show the feasibility of the proposed design approach.     

一种快速的三维有限元网格生成方法

针对三维有限元网格的生成的速度较慢并且网格质量不高的问题,提出了一种基于约束波前法的三维有限元网格生成算法。算法的主要思想是用背景网格提高网格单元的可控性,避免网格单元生成时验证有效性的计算量,从而快速生成高质量的三维有限元网格。算法首先借助八叉树方法生成背景网格,其次利用背景网格的密度对模型表面进行三角剖分得到初始波前,然后依据背景网格的特征生成实体网格单元,最后对得到的结果进行优化。实验证明结合了八叉树和推进波前法的三维网格生成算法降低了波前法的时间复杂度,将其效率提高了20%,而且能得到更高质量的网格。     

Polygonal multiresolution topology optimization (PolyMTOP) for structural dynamics

We use versatile polygonal elements along with a multiresolution scheme for topology optimization to achieve computationally efficient and high resolution designs for structural dynamics problems. The multiresolution scheme uses a coarse finite element mesh to perform the analysis, a fine design variable mesh for the optimization and a fine density variable mesh to represent the material distribution. The finite element discretization employs a conforming finite element mesh. The design variable and density discretizations employ either matching or non-matching grids to provide a finer discretization for the density and design variables. Examples are shown for the optimization of structural eigenfrequencies and forced vibration problems.     

An approach to automated decomposition of volumetric mesh

Mesh decomposition is critical for analyzing, understanding, editing and reusing of mesh models. Although there are many methods for mesh decomposition, most utilize only triangular meshes. In this paper, we present an automated method for decomposing a volumetric mesh into semantic components. Our method consists of three parts. First, the outer surface mesh of the volumetric mesh is decomposed into semantic features by applying existing surface mesh segmentation and feature recognition techniques. Then, for each recognized feature, its outer boundary lines are identified, and the corresponding splitter element groups are setup accordingly. The inner volumetric elements of the feature are then obtained based on the established splitter element groups. Finally, each splitter element group is decomposed into two parts using the graph cut algorithm; each group completely belongs to one feature adjacent to the splitter element group. In our graph cut algorithm, the weights of the edges in the dual graph are calculated based on the electric field, which is generated using the vertices of the boundary lines of the features. Experiments on both tetrahedral and hexahedral meshes demonstrate the effectiveness of our method.