Automated adaptive 3D forming simulation processes

In this study, an automated adaptive mesh control scheme, based on local mesh modifications, is developed for the finite element simulations of 3D metal-forming processes. Error indicators are used to control the mesh discretization errors, and an h-adaptive procedure is conducted. The mesh size field used in the h-adaptive procedure is processed to control the discretization and geometric approximation errors of the evolving workpiece mesh. Industrial problems are investigated to demonstrate the capabilities of the developed scheme.     

Parallel finite-element computation of 3D flows

The authors describe their work on the massively parallel finite-element computation of compressible and incompressible flows with the CM-200 and CM-5 Connection Machines. Their computations are based on implicit methods, and their parallel implementations are based on the assumption that the mesh is unstructured. Computations for flow problems involving moving boundaries and interfaces are achieved by using the deformable-spatial-domain/stabilized-space-time method. Using special mesh update schemes, the frequency of remeshing is minimized to reduce the projection errors involved and also to make parallelizing the computations easier. This method and its implementation on massively parallel supercomputers provide a capability for solving a large class of practical problems involving free surfaces, two-liquid interfaces, and fluid-structure interactions     

Catmull-Clark细分网格数据点拾取

针对将OpenGL选择拾取机制直接作用于Catmull-Clark细分网格数据点的拾取,可能会因细分网格数据量过大而导致名字堆栈溢出的问题,借鉴细分曲面求交的思想,提出一种新的细分网格数据点拾取方法.该方法通过提取拾取对象的邻域网格并进行局部细分,将对细分任意层次上网格数据点的拾取转化为对初始控制网格以及在达到细分层次要求以前每一次局部细分网格点、边、面的拾取和对最后一次局部细分网格数据点的拾取.采用多个拾取算例进行对比分析实验,当细分网格顶点数量较多时,所给拾取方法的拾取命名对象总量和拾取时间都远小于传统OpenGL选择拾取方法.实验结果表明,所给拾取方法能快速准确实现细分网格数据点的拾取,尤其适用于数据量较大的复杂细分模型,可有效避免因拾取名字堆栈溢出而导致的拾取错误.     

High order compact scheme with multigrid local mesh refinement procedure for convection diffusion problems

We derive a new fourth order compact finite difference scheme which allows different meshsize in different coordinate directions for the two-dimensional convection diffusion equation. A multilevel local mesh refinement strategy is used to deal with the local singularity problem. A corresponding multilevel multigrid method is designed to solve the resulting sparse linear system. Numerical experiments are conducted to show that the local mesh refinement strategy works well with the high order compact discretization scheme to recover high order accuracy for the computed solution. Our solution method is also shown to be effective and robust with respect to the level of mesh refinement and the anisotropy of the problems.     

Adjacency for grid generation and grid adaptation in Delaunay triangulation

One of the characteristics of Delaunay method for mesh generation is its local remeshing ability. The main part of the process is to identify remeshing block out of the whole domain and to execute remeshing on the block. Adjacency, adjacent element array, is introduced with an accompanying algorithm to make the process so simple and versatile that it will be used in generating the initial mesh, in applying mesh adaptation, in mesh revision for moving boundary problems, and in transforming 3-node base mesh to 6-node mesh. These features are demonstrated in the example problems of heat conduction with point sink, crack propagation, and simple upsetting of a circular cylinder. Proposition is made to take utility array ‘adjacency’ as basic element data.     

A local mesh-refinement technique for incompressible flows

As part of a Multi-Grid scheme for the solution of the Navier-Stokes equations in primitive variables, we introduce a local mesh refinement procedure. New cartesian sub-grids are introduced into regions where the estimated truncation errors are too large. Through the Multi-Grid processing, informations is transferred among the grids in a stable and efficient manner. A simple pointer system allows the storage of the dependent variables, without increasing in the required computer memory. Two computed examples of incompressible flow problems are discussed.     

An adaptive multilevel multigrid formulation for Cartesian hierarchical grid methods

A Cartesian grid method with adaptive mesh refinement and multigrid acceleration is presented for the compressible Navier-Stokes equations. Cut cells are used to represent boundaries on the Cartesian grid, while ghost cells are introduced to facilitate the implementation of boundary conditions. A cell-tree data structure is used to organize the grid cells in a hierarchical manner. Cells of all refinement levels are present in this data structure such that grid level changes as they are required in a multigrid context do not have to be carried out explicitly. Adaptive mesh refinement is introduced using phenomenon-based sensors. The application of the multilevel method in conjunction with the Cartesian cut-cell method to problems with curved boundaries is described in detail. A 5-step Runge-Kutta multigrid scheme with local time stepping is used for steady problems and also for the inner integration within a dual time-stepping method for unsteady problems. The inefficiency of customary multigrid methods on Cartesian grids with embedded boundaries requires a new multilevel concept for this application, which is introduced in this paper. This new concept is based on the following novelties: a formulation of a multigrid method for Cartesian hierarchical grid methods, the concept of averaged control volumes, and a mesh adaptation strategy allowing to directly control the number of refined and coarsened cells.     

结合边折叠和局部优化的网格简化算法

针对目前网格简化算法在将三维模型简化到较低分辨率时,网格模型的细节特征丢失、网格质量不佳的问题,提出一种保持特征的高质量网格简化算法。引入顶点近似曲率的概念,并将其与边折叠的误差矩阵结合,使得简化模型的细节特征在最大限度上得到保持。同时分析简化后三角网格的质量,对三角网格作局部优化处理,减少狭长三角形的数量,提高简化模型的网格质量。使用Apple模型和Horse模型进行实验,并与一种经典的基于边折叠的网格简化算法以及其改进算法之一进行对比。实验结果显示,两种对比算法三角网格分布过于均匀,局部细节模糊不清,而所提算法的三角网格在曲率大的区域稠密,在平坦处稀疏,细节特征清晰可辨;简化模型的几何误差的数量值与两种对比算法处于同一数量级;所提算法的简化网格的平均质量远高于两种对比算法。实验结果表明,在不扩大几何误差的情况下,所提算法不仅具有较强的细节特征保持能力,而且简化模型的网格质量较高,视觉效果较好。     

Error analysis and adaptive refinement of boundary elements in elastic problem

The adaptive boundary element mesh generation based on an error analysis scheme called ‘sample point error analysis’ developed previously for the potential problem is extended and applied to the two-dimensional static elastic analysis. The errors on each element are determined as the required modification so aa to enforce the boundary integral equation to hold on the points other than the assumed initial nodes, which are referred to as the sample points. Boundary elements refinement, h-version in this study, is performed with the aid of the extended error indicator defined by the above-mentioned errors multiplied by the corresponding fundamental solutions. Two-dimensional simple problems are analysed to validate the utility of the proposed method.     

Moving Mesh Method with Error-Estimator-Based Monitor and Its Applications to Static Obstacle Problem

The main objective of this work is to demonstrate that sharp a posteriori error estimators can be employed as appropriate monitor functions for moving mesh methods. We illustrate the main ideas by considering elliptic obstacle problems. Some important issues such as how to derive the sharp estimators and how to smooth the monitor functions are addressed. The numerical schemes are applied to a number of test problems in two dimensions. It is shown that the moving mesh methods with the proposed monitor functions can effectively capture the free boundaries of the elliptic obstacle problems and reduce the numerical errors arising from the free boundaries.     

On the accuracy of shape sensitivity

The calculation of sensitivity of the response of a structure modeled by finite elements to shape variation is known to be subject to numerical difficulties. The accuracy of a given method is typically measured against the yard stick of finite-difference sensitivity calculation. The present paper demonstrates with a simple example that this approach may be flawed because of discretization errors associated with the finite element mesh. Seven methods for calculating sensitivity derivatives are compared for a two-material beam problem with a moving interface. It is found that as the mesh is refined, displacement sensitivity derivatives converge more slowly than the displacements. Six of the methods agree fairly well, but the adjoint variational surface method provides substantially different results. However, the difference is found to reflect convergence from another direction to the same answer rather than reduced accuracy. Additionally, it is observed that small derivatives are particularly prone to accuracy problems.     

基于点云几何与形状特征的曲面重构算法

提出一种新的利用点云进行曲面重构的算法,该算法基于点云的几何与形状特征,根据点云的几何分布进行分类和按照点的局部形状特征进行分类,对每类点进行局部网格重构,并进行后续处理以修补拓扑和几何错误。实验结果表明,该算法强健有效,能生成高质量的网格,并能较好地保持模型的几何与形状特征。     

基于中轴表达的三维模型轮廓提取方法

三维网格模型的轮廓信息在网格检索、网格简化、网格重建中有着广泛应用。现有的轮廓提取方法较为复杂,需要分析和过滤网格模型的几何特征,计算量大且有时无法生成完整的轮廓信息。近年来,三维模型的中轴表达研究趋于成熟,在表达模型几何拓扑关系上有独特的优势。因此,提出了一种基于中轴表达的三维模型轮廓提取方法：首先提取三维模型的中轴表达信息,将中轴角点投影到三维模型表面;然后根据每个区域的拓扑关系选择适合的角点连接关系,将投影点连接形成模型区域轮廓;再针对投影过程中产生的误差进行分析和纠正;最后合并区域轮廓得到三维模型的完整轮廓。通过对多个模型数据库中代表性的三维网格模型进行实验和重建误差比较,该方法的平均重建质量较现有方法约有10%的提升,在重建质量和轮廓信息完整度方面优于现有方法。     

Accuracy estimation in the finite element analysis of transverse bending of thin flat plates

As a basic study for the establishment of an accuracy estimation method in the finite element method, this paper deals with the problems of transverse bending of thin, flat plates. From the numerical experiments for uniform mesh division, the following relation was deduced, ε ∝ (h/a)^k, k 1, where ε is the error of the computed value by the finite element method relative to the exact solution and h/a is the dimensionless mesh size. Using this relation, an accuracy estimation method, which was based on the adaptive determination of local mesh sizes from two preceding analyses by uniform mesh division, was presented.

A computer program using this accuracy estimation method was developed and applied to 28 problems with various shapes and loading conditions. The usefulness of this accuracy estimation method was illustrated by these application results.     

Viscous flow solutions with a cubic spline approximation

A cubic spline approximation is used for the solution of several problems in fluid mechanics. This procedure provides a high degree of accuracy even with a non-uniform mesh, and leads to a more accurate treatment of derivative boundary conditions. The truncation errors and stability limitations of several typical integration schemes are presented. For two-dimensional flows a spline-alternating-direction-implicit (SADI) method is evaluated. The spline procedure is assessed and results are presented for the one-dimensional nonlinear Burgers' equation, as well as the two-dimensional diffusion equation and the vorticity-stream function system describing the viscous flow in a driven cavity. Comparisons are made with analytic solutions for the first two problems and with finite-difference calculations for the cavity flow.     

Error estimation and adaptive procedures based on superconvergent patch recovery (SPR) techniques

Summary  The paper discusses error estimation and adaptive finite element procedures for elasto-static and dynamic problems based on superconvergent patch recovery (SPR) techniques. The SPR is a postprocessing procedure to obtain improved finite element solutions by the least squares fitting of superconvergent stresses at certain sampling points in local patches. An enhancement of the original SPR by accounting for the equilibirum equations and boundary conditions is proposed. This enhancement improves the quality of postprocessed solutions considerably and thus provides an even more effective error estimate. The patch configuration of SPR can be either the union of elements surrounding a vertex node, thenode patch, or, the union of elements surrounding an element, theelement patch. It is shown that these two choices give normally comparable quality of postprocessed solutions. The paper is also concerned with the application of SPR techniques to a wide range of problems. The plate bending problem posted in mixed form where force and displacement variables are simultaneously used as unknowns is considered. For eigenvalue problems, a procedure of improving eigenpairs and error estimation of the eigenfrequency is presented. A postprocessed type of error estimate and an adaptive procedure for the semidiscrete finite element method are discussed. It is shown that the procedure is able to update the spatial mesh and the time step size so that both spatial and time discretization errors are controlled within specified tolerances. A discontinuous Galerkin method for solving structural dynamics is also presented.     

Constrained interpolation (remap) of divergence-free fields

A novel constrained interpolation algorithm for remapping of solenoidal face finite element vector fields is presented. The algorithm is based on explicit recovery, postprocessing and interpolation of a potential for the original vector field and a subsequent application of a curl operator to obtain the desired divergence-free finite element field on the new mesh.The use of interpolation instead of advection in the remap process offers valuable computational advantages. Old and new meshes are neither required to have the same connectivity, nor to be close to each other. Slope limiting and upwinding, which can be sensitive to grid structure, are avoided and replaced by local optimization to control energy of the remapped field.The new method is validated using a suite of cyclic remap problems on random and tensor product mesh sequences. A comparison with a local remapper based on a constrained transport advection algorithm is also included.     

High-Order Accurate Adaptive Kernel Compression Time-Stepping Schemes for Fractional Differential Equations

We present a goal-oriented a posteriori error estimator for finite element approximations of a class of homogenization problems. As a rule, homogenization problems are defined through the coupling of a macroscopic solution and the solution of auxiliary problems. In this work we assume that the homogenized problem is known and that it depends on a finite number of auxiliary problems. The accuracy in the goal functional depends therefore on the discretization error of the macroscopic and the auxiliary solutions. We show that it is possible to compute the error contributions of all solution components separately and use this information to balance the different discretization errors. Additionally, we steer a local mesh refinement for both the macroscopic problem and the auxiliary problems. The high efficiency of this approach is shown by numerical examples. These include the upscaling of a periodic diffusion tensor, the case of a Stokes flow over a porous bed, and the homogenization of a fuel cell model which includes the flow in a gas channel over a porous substrate coupled with a multispecies nonlinear transport equation.     

The Superconvergence Phenomenon and Proof of the MAC Scheme for the Stokes Equations on Non-uniform Rectangular Meshes

For decades, the widely used finite difference method on staggered grids, also known as the marker and cell (MAC) method, has been one of the simplest and most effective numerical schemes for solving the Stokes equations and Navier–Stokes equations. Its superconvergence on uniform meshes has been observed by Nicolaides (SIAM J Numer Anal 29(6):1579–1591, 1992), but the rigorous proof is never given. Its behavior on non-uniform grids is not well studied, since most publications only consider uniform grids. In this work, we develop the MAC scheme on non-uniform rectangular meshes, and for the first time we theoretically prove that the superconvergence phenomenon (i.e., second order convergence in the \(L^2\) norm for both velocity and pressure) holds true for the MAC method on non-uniform rectangular meshes. With a careful and accurate analysis of various sources of errors, we observe that even though the local truncation errors are only first order in terms of mesh size, the global errors after summation are second order due to the amazing cancellation of local errors. This observation leads to the elegant superconvergence analysis even with non-uniform meshes. Numerical results are given to verify our theoretical analysis.     

Quasi-isometric parameterization for texture mapping

In this paper, we present a new 3D triangular mesh parameterization method that is computationally efficient and yields minimized distance errors. The method has four steps. Firstly, multidimensional scaling (MDS) is used to flatten each submesh consisting of one vertex and its direct neighbours on the 3D triangular mesh. Secondly, an optimal method is used to compute the linear reconstructing weights of each vertex with respect to its neighbours. Thirdly, a spectral decomposition method is used to obtain initial 2D parameterization coordinates. Fourthly, the initial coordinates are rotated and scaled to minimize the distance errors. It is demonstrated that this method can be used for texture mapping. Analyses and examples show the effectiveness of this parameterization method compared with alternatives.