最小二乘网格的模型修补

最小二乘网格是在给定连接图和离散控制点集的基础上,通过求解线性系统对网格中的顶点重新定位而形成的网格.本文提出了一种最小二乘网格的模型修补算法,首先根据模型孔洞构造合适的连接图,然后根据网格连接图以及边界几何信息构造一个线性稀疏系统,最后求解连接网格中所有顶点的三维几何坐标.该算法计算速度快,能取得理想的效果.     

瞬动态问题有限元网格单元修正的自适应分析

本文基于一种先进的非结构化网格生成系统和对于有限元离散误差的分析，将网格单元修正的自适应分析方法应用于二维瞬动态问题的研究，由于有限元近似求解的精度很大程度取决于所离散的网格质量，并且动态问题的数值解在不同时段变化较大以及由于波动求解中半离散化方法所引入的离散化的弥散现象，而网格单元修正的自适应分析方法能够在不同时段形成最佳网格来进行计算，使有限元分析的可靠性和近似程度得到提高；文中对地下圆形隧道     

非定常N-S方程的双重网格数值模拟

本文采用全离散双重网格算法（时间变量采用Eular全隐式格式离散,空间变量采用混合有限元离散）,对非定常Navier-Stokes（N-S）方程进行数值模拟.双重网格算法的基本思想是,首先在粗网格有限元空间X^H上求解一个非线性问题,然后在细网格有限元空间Xh（h＜＜H）上求解一个线性问题.数值实验结果表明：在保持几乎相同精度的前提下,双重网格算法比标准有限元算法节省近一半的计算时间,说明了新算法求解非定常N-S方程的可行性和高效性.     

有限元网格修正的自适应分析及其应用

本文在对有限元变量连续条件分析的基础上，将应力误差范数用于计算结果的误差估计，使非结构化网格生成系统与有限元计算有机地结合起来，并将网格单元修正的自适应分析应用于二维应力集中问题的研究，从而实现了有限元最佳化离散，提高了有限元数值求解的可靠性和近似程度。     

组合杂交四边形元的多重网格预处理共轭梯度方法

组合杂交元方法是一种求解弹性力学问题的稳定化有限元方法．为了快速求解组合杂交元离散得到的大型、稀疏、对称正定系统,本文研究了多重网格预处理共轭梯度方法．首先,通过选用合适的网格转移算子和光滑策略,得到了有效的多重网格预处理器．其次,通过分析数值试验结果证明所得到的多重网格预处理共轭梯度方法是有效可行的,利用该预处理方法大大降低了系数矩阵的条件数,提高了计算效率．此外,对于一类高性能的组合杂交元,多重网格预处理共轭梯度方法在网格畸变时依然收敛.     

一种新的无网格方法与有限元耦合法

本文分析了Belytschko和Huerta提出的无网格方法和有限元耦合法各自存在的问题,提出了一种新的无网格方法与有限元耦合法。Belytschko提出的方法的缺点是,无网格方法子域和有限元法子域的界面必须是规则的,交界域内有限元不能随意划分,交界域内无网格方法的节点也不能随意分布。Huerta提出的方法的缺点是对交界域内无网格方法的节点影响域可能无法覆盖交界域。本文提出的无网格方法与有限元耦合法解决了以上两种方法存在的问题,并保留了无网格方法随意配点的优点、交界面可以不规则、提高了无网格子域内的求解精度,从而提高问题的整体求解精度。然后,建立了弹性力学的无网格方法与有限元法的耦合法。最后给出了数值算例。     

三维弹性问题高次有限元离散线性系统的块对角逆预条件PCG法

高次有限元由于对问题具有更好的逼近效果及某些特殊的优点,如能解决弹性问题的闭锁现象(Poisson’s ratio locking),使得它们在实际计算中被广泛使用。但与线性元相比,它具有更高的计算复杂性。该文基于标量椭圆问题高次有限元离散化系统的代数多层网格(AMG)法,针对三维弹性问题高次有限元离散化线性系统的求解,设计了一种以块对角逆为预条件子的共轭梯度法(AMG-BPCG)。数值实验表明,该文设计的AMG-BPCG法较标准的ILU-型PCG法具有更好的计算效率和鲁棒性。     

全局弱式无网格方法求解消声器横向模态

应用全局弱式无网格方法求解消声器的横向模态,使用径向基函数点插值法离散本征方程,使用伽辽金加权残数法进行数值积分。分别应用全局弱式无网格方法计算了圆形截面,不规则截面以及含有穿孔截面的本征值和本征向量,计算结果与解析方法和二维有限元方法计算结果吻合较好,并且与二维有限元方法相比,全局弱式无网格方法比较节省计算时间。进而分析了支持域的尺寸以及径向基函数中形状参数对计算精度的影响。     

六面体网格体积成形有限元分析关键技术

为提高三维体积成形有限元分析软件的计算精度、减少网格数量,基于六面体网格特性研究了六面体网格体积成形有限元分析系统的关键技术,通过对STL文件的索引重构建立了模具实体模型顶点和三角形面片拓扑连接关系,提出了一种局部坐标系建立方法保证触模和对称约束条件的正确施加,给出了相对速度和相对位置两种节点触模判断方法,并提出了调整触模节点位置的最短距离法,与初矢修正法和原长修正法比较,其调整距离短,体积损失小.基于以上技术,开发了基于三维六面体网格的体积成形有限元分析系统,对典型体积成形工艺进行了有限元模拟,并与Deform模拟结果进行对比,二者吻合较好,验证了所建立模型与相应处理技术的可行性.     

网格曲面中孔洞的光滑填充算法研究

三角网格模型是几何描述的一种重要形式，有着广泛的应用。但三角网络模型常常会存在孔洞缺陷。这些孔洞的存在一方面影响视觉效果，另一方面会影响许多后续的操作，如快速原型制造、有限元分析等，因此有必要对这些孔洞进行修补。目前绝大多数孔洞填充算法是将网格模型中的孔洞提取成空间多边形，并对孔洞多边形进行三角化。这种处理方法的主要缺陷是没有考虑网格曲面在孔洞附近的几何形态，因而填充部分不能与整个曲面光滑地融为一体。笔者提出了一种三角网格曲面中孔洞的光滑填充算法。该算法根据孔洞周围网格曲面的几何信息来增加孔洞内部的采样点，然后再对增加的采样点进行三角化，较好地解决了填充部分与整体曲面光滑连接的问题。     

等代数结构面网格剖分下三维弹性问题的代数多重网格法

在一种等代数结构面网格剖分下,建立了求解三维弹性问题有限元方程的代数多重网格法及相应的预处理共轭梯度法,详细描述了代数多重网格方法中网格粗化技术与插值算子的构造,并将所构造的代数多重网格法应用于某些实际问题如非均匀介质、高应力梯度问题的数值求解。结果表明,建立的代数多重网格法对求解三维弹性问题是十分有效的,具有很好的鲁棒性,较直接解法和其它常用迭代方法具有明显的优越性。     

Mesh generation for aerospace applications

In recent years there has been much research activity in the field of compressible flow simulation for aerodynamic applications. In the 1970’s and 1980’s the advances in the numerical solution of the Full Potential and Euler equations made, in principle, the inviscid flow simulation around complex aerodynamic shapes possible. At this stage much attention was focused on methods capable of generating meshes on which such calculations could be performed. In this paper an overview is presented of some techniques which have been developed to generate meshes for aerospace applications. Structured mesh generation techniques are discussed and their application to complicated shapes utilising the multiblock approach is highlighted. Unstructured mesh generation methods are also discussed with particular emphasis given to the Delaunay triangulation method. Finally, the advantages and disadvantages of the structured and unstructured approaches are discussed and new work is presented which attempts to utilise both these approaches in an efficient and flexible manner. An erratum to this article is available at .     

Investigation of Algebraic Multigrid Method for Magnetic Field Analysis of an Electric Machine With a Laminated Core

In this paper, we describe the applicability of Algebraic Multigrid Method (AMG method) as a fast solution for magnetic field analysis of an electric machine with a laminated core. In an experimental analysis, we have found that there are some cases where the calculation speed can be improved by using the AMG method for a fine mesh that models a laminated iron core exactly. Therefore we investigated the convergence characteristic of the standard Incomplete Cholesky Conjugate Gradient method (standard ICCG method) and the Conjugate Gradient method preconditioned with AMG method (AMGCG method) for the simple and actual analysis models. The numerical results show that the AMGCG method provides fast solutions for laminated mesh models for which the standard ICCG method does not work well in many analysis cases.      

An AMG Preconditioner for Solving the Navier-Stokes Equations with a Moving Mesh Finite Element Method

AMG preconditioners are typically designed for partial differential equation solvers and divergence-interpolation in a moving mesh strategy. Here we introduce an AMG preconditioner to solve the unsteady Navier-Stokes equations by a moving mesh finite element method. A $4P1$ − $P1$ element pair is selected based on the data structure of the hierarchy geometry tree and two-layer nested meshes in the velocity and pressure. Numerical experiments show the efficiency of our approach.     

Robust generation of high‐quality unstructured meshes on realistic biomedical geometry

In this paper, we propose efficient and robust unstructured mesh generation methods based on computed tomography (CT) and magnetic resonance imaging (MRI) data, in order to obtain a patient‐specific geometry for high‐fidelity numerical simulations. Surface extraction from medical images is carried out mainly using open source libraries, including the Insight Segmentation and Registration Toolkit and the Visualization Toolkit, into the form of facet surface representation. To create high‐quality surface meshes, we propose two approaches. One is a direct advancing front method, and the other is a modified decimation method. The former emphasizes the controllability of local mesh density, and the latter enables semi‐automated mesh generation from low‐quality discrete surfaces. An advancing‐front‐based volume meshing method is employed. Our approaches are demonstrated with high‐fidelity tetrahedral meshes around medical geometries extracted from CT/MRI data. Copyright © 2005 John Wiley & Sons, Ltd.     

Stress integration and mesh refinement for large deformation in geomechanics

This paper first discusses alternative stress integration schemes in numerical solutions to large‐ deformation problems in hardening materials. Three common numerical methods, i.e. the total‐Lagrangian (TL), the updated‐Lagrangian (UL) and the arbitrary Lagrangian–Eulerian (ALE) methods, are discussed. The UL and the ALE methods are further complicated with three different stress integration schemes. The objectivity of these schemes is discussed. The ALE method presented in this paper is based on the operator‐split technique where the analysis is carried out in two steps; an UL step followed by an Eulerian step. This paper also introduces a new method for mesh refinement in the ALE method. Using the known displacements at domain boundaries and material interfaces as prescribed displacements, the problem is re‐analysed by assuming linear elasticity and the deformed mesh resulting from such an analysis is then used as the new mesh in the second step of the ALE method. It is shown that this repeated elastic analysis is actually more efficient than mesh generation and it can be used for general cases regardless of problem dimension and problem topology. The relative performance of the TL, UL and ALE methods is investigated through the analyses of some classic geotechnical problems. Copyright © 2005 John Wiley & Sons, Ltd.     

Stochastic projection schemes for deterministic linear elliptic partial differential equations on random domains

We present stochastic projection schemes for approximating the solution of a class of deterministic linear elliptic partial differential equations defined on random domains. The key idea is to carry out spatial discretization using a combination of finite element methods and stochastic mesh representations. We prove a result to establish the conditions that the input uncertainty model must satisfy to ensure the validity of the stochastic mesh representation and hence the well posedness of the problem. Finite element spatial discretization of the governing equations using a stochastic mesh representation results in a linear random algebraic system of equations in a polynomial chaos basis whose coefficients of expansion can be non‐intrusively computed either at the element or the global level. The resulting randomly parametrized algebraic equations are solved using stochastic projection schemes to approximate the response statistics. The proposed approach is demonstrated for modeling diffusion in a square domain with a rough wall and heat transfer analysis of a three‐dimensional gas turbine blade model with uncertainty in the cooling core geometry. The numerical results are compared against Monte–Carlo simulations, and it is shown that the proposed approach provides high‐quality approximations for the first two statistical moments at modest computational effort. Copyright © 2010 John Wiley & Sons, Ltd.     

Algebraic Multigrid Methods for Direct Frequency Response Analyses in Solid Mechanics

Algebraic multigrid (AMG) methods have proven to be effective for solving the linear algebraic system of equations that arise from many classes of unstructured discretized elliptic PDEs. Standard AMG methods, however, are not suitable for shifted linear systems from elliptic PDEs, such as discretized Helmholtz operators, due to the indefiniteness of the system and the presence of low energy modes which are difficult for multigrid methods to resolve effectively. This paper investigates simple methods to adapt existing standard AMG methods to these shifted systems from direct frequency response analyses in solid mechanics.     

Algebraic multigrid methods for solving generalized eigenvalue problems

Three algebraic multigrid (AMG) methods for solving generalized eigenvalue problems are presented. The first method combines modern AMG techniques with a non‐linear multigrid approach and nested iteration strategy. The second method is a preconditioned inverse iteration with linear AMG preconditioner. The third method is an enhancement of the previous one, namely the locally optimal block preconditioned conjugate gradient. Efficiency and accuracy of solutions computed by these AMG eigensolvers are validated on standard benchmarks where part of the spectrum is known. In particular, the problem of isospectral drums is addressed. Copyright © 2005 John Wiley & Sons, Ltd.     

A moving superimposed finite element method for structural topology optimization

Level set methods are becoming an attractive design tool in shape and topology optimization for obtaining efficient and lighter structures. In this paper, a dynamic implicit boundary‐based moving superimposed finite element method (s‐version FEM or S‐FEM) is developed for structural topology optimization using the level set methods, in which the variational interior and exterior boundaries are represented by the zero level set. Both a global mesh and an overlaying local mesh are integrated into the moving S‐FEM analysis model. A relatively coarse fixed Eulerian mesh consisting of bilinear rectangular elements is used as a global mesh. The local mesh consisting of flexible linear triangular elements is constructed to match the dynamic implicit boundary captured from nodal values of the implicit level set function. In numerical integration using the Gauss quadrature rule, the practical difficulty due to the discontinuities is overcome by the coincidence of the global and local meshes. A double mapping technique is developed to perform the numerical integration for the global and coupling matrices of the overlapped elements with two different co‐ordinate systems. An element killing strategy is presented to reduce the total number of degrees of freedom to improve the computational efficiency. A simple constraint handling approach is proposed to perform minimum compliance design with a volume constraint. A physically meaningful and numerically efficient velocity extension method is developed to avoid the complicated PDE solving procedure. The proposed moving S‐FEM is applied to structural topology optimization using the level set methods as an effective tool for the numerical analysis of the linear elasticity topology optimization problems. For the classical elasticity problems in the literature, the present S‐FEM can achieve numerical results in good agreement with those from the theoretical solutions and/or numerical results from the standard FEM. For the minimum compliance topology optimization problems in structural optimization, the present approach significantly outperforms the well‐recognized ‘ersatz material’ approach as expected in the accuracy of the strain field, numerical stability, and representation fidelity at the expense of increased computational time. It is also shown that the present approach is able to produce structures near the theoretical optimum. It is suggested that the present S‐FEM can be a promising tool for shape and topology optimization using the level set methods. Copyright © 2005 John Wiley & Sons, Ltd.