Momentum advection on unstructured staggered quadrilateral meshes

The finite element method, as applied to problems in solid mechanics, typically uses a mesh with the velocities at the nodes and the remaining solution variables, including the density, located at the integration points. The arbitrary Lagrangian–Eulerian formulations used in solid mechanics are therefore faced with the challenge of transporting momentum, which is defined in terms of variables located at separate points in space, in a conservative manner. Two types of momentum transport methods have been developed over the years. The first constructs a dual mesh with the nodes as the integration points, a difficult task on an unstructured finite element mesh. The second uses the original mesh and constructs auxiliary variables for transport from which the final velocity may be recovered. An analysis demonstrates how the two methods are related. Simplified implementations of each type—dual mesh and element centered—are developed in detail and their performance is compared to verify the analysis. Copyright © 2008 John Wiley & Sons, Ltd.     

Delaunay versus max-min solid angle triangulations for three-dimensional mesh generation

The Delaunay triangulation has been used in several methods for generating finite element tetrahedral meshes in three-dimensional polyhedral regions. Other types of three-dimensional triangulations are possible, such as a triangulation satisfying a local max-min solid angle criterion. In this paper, we present experimental results to show that max-min solid angle triangulations are better than Delaunay triangulations for finite element tetrahedral meshes, since the former type of triangulations contains tetrahedra of better shape than the latter type. We also describe how mesh points are generated and triangulated in our tetrahedral mesh generation method.     

Quality improvement methods for hexahedral element meshes adaptively generated using grid‐based algorithm

The quality of finite element meshes is one of the key factors that affects the accuracy and reliability of numerical simulation results of many science and engineering problems. In order to solve the problem wherein the surface elements of the mesh generated by the grid‐based method have poor quality, this paper studied mesh quality improvement methods, including node position smoothing and topological optimization. A curvature‐based Laplacian scheme was used for smoothing of nodes on the C‐edges, which combined the normal component with the tangential component of the Laplacian operator at the curved boundary. A projection‐based Laplacian algorithm for smoothing the remaining boundary nodes was established. The deviation of the newly smoothed node from the practical surface of the solid model was solved. A node‐ and area‐weighted combination method was proposed for smoothing of interior nodes. Five element‐inserting modes, three element‐collapsing modes and three mixed modes for topological optimization were newly established. The rules for harmonious application and conformity problem of each mode, especially the mixed mode, were provided. Finally, several examples were given to demonstrate the practicability and validity of the mesh quality improvement methods presented in this paper. Copyright © 2011 John Wiley & Sons, Ltd.     

A new method for modelling cohesive cracks using finite elements

A model which allows the introduction of displacements jumps to conventional finite elements is developed. The path of the discontinuity is completely independent of the mesh structure. Unlike so‐called ‘embedded discontinuity’ models, which are based on incompatible strain modes, there is no restriction on the type of underlying solid finite element that can be used and displacement jumps are continuous across element boundaries. Using finite element shape functions as partitions of unity, the displacement jump across a crack is represented by extra degrees of freedom at existing nodes. To model fracture in quasi‐brittle heterogeneous materials, a cohesive crack model is used. Numerical simulations illustrate the ability of the method to objectively simulate fracture with unstructured meshes. Copyright © 2001 John Wiley & Sons, Ltd.     

Tetrahedral mesh generation in convex primitives

This paper presents a method for generating tetrahedral meshes in three-dimensional primitives. Given a set of closed and convex polyhedra having non-zero volume and some mesh controlling parameters, the polyhedra are automatically split to tetrahedra satisfying the criteria of standard finite element meshes. The algorithm tries to generate elements close to regular tetrahedra by maximizing locally the minimum solid angles associated to a set of a few neighbouring tetrahedra. The input parameters define the size of the tetrahedra and they can be used to increase or decrease the discretization locally. All the new nodes, which are not needed to describe the geometry, are generated automatically.     

An apporach to automatic three-dimensional finite element mesh generation

Recently developed solid modelling systems for the design of complex physical solids using interactive computer graphics offer the exciting possibility of an integrated design/analysis system. Called geometric modellers, these systems build complex solids from primitive solids (cubes, cylinders, spheres, solid patches, etc.) and macro solids (combination of primitives)^{3, 4, 8, 16, 18, 25, 38}. To provide an effective structural analysis capability for these systems, methods must be devised to ease the burden of discretizing the solid geometry into a user controlled (usually locally graded) finite element mesh. The purpose of this paper is to describe an interactive solid mesh generation system capable of generating valid meshes of well-proportional tetrahedral finite elements for the decomposition of multiply connected solid structures. The system uses a semi-automatic node insertion procedure to locate element node points within and on the surface of a structure. An independent automatic three-dimensional triangulator then accepts these nodes as input and connects them to form a valid finite element mesh oftetrahedral elements. Although this report makes use of a modeller based on a constructive solid geometry representation (a so-called CSG modeller), the mesh generation strategy elaborated herein is completely general and makes no particular use of the CSG representation.     

A finite element reduced-order model based on adaptive mesh refinement and artificial neural networks

In this work, a reduced-order model based on adaptive finite element meshes and a correction term obtained by using an artificial neural network (FAN-ROM) is presented. The idea is to run a high-fidelity simulation by using an adaptively refined finite element mesh and compare the results obtained with those of a coarse mesh finite element model. From this comparison, a correction forcing term can be computed for each training configuration. A model for the correction term is built by using an artificial neural network, and the final reduced-order model is obtained by putting together the coarse mesh finite element model, plus the artificial neural network model for the correction forcing term. The methodology is applied to nonlinear solid mechanics problems, transient quasi-incompressible flows, and a fluid-structure interaction problem. The results of the numerical examples show that the FAN-ROM is capable of improving the simulation results obtained in coarse finite element meshes at a reduced computational cost.     

A piezoelectric 3D hexahedral curvilinear finite element based on the space fiber rotation concept

The paper is focused on a piezoelectric 3D hexahedral finite element formulation on the basis of the space fiber rotation concept. The proposed electromechanical finite element has eight nodes and is animated by the virtual rotation of an elementary spatial fiber that creates an additional mechanical displacement enhancing the classical one generally considered to formulate the standard solid elements. The mechanical strain tensor and the electric field vector are expressed in a curvilinear coordinate system to handle the transverse isotropy behavior of piezoelectric materials. Numerical examples demonstrate that the proposed electromechanical element is less sensitive to mesh distortion than the standard piezoelectric solid elements. Besides, it is shown that the developed element response is better than those of the standard first‐order piezoelectric elements. Copyright © 2011 John Wiley & Sons, Ltd.     

Moving Particles Through a Finite Element Mesh

We present a new numerical technique for modeling the flow around multiple objects moving in a fluid. The method tracks the dynamic interaction between each particle and the fluid. The movements of the fluid and the object are directly coupled. A background mesh is designed to fit the geometry of the overall domain. The mesh is designed independently of the presence of the particles except in terms of how fine it must be to track particles of a given size. Each particle is represented by a geometric figure that describes its boundary. This figure overlies the mesh. Nodes are added to the mesh where the particle boundaries intersect the background mesh, increasing the number of nodes contained in each element whose boundary is intersected. These additional nodes are then used to describe and track the particle in the numerical scheme. Appropriate element shape functions are defined to approximate the solution on the elements with extra nodes. The particles are moved through the mesh by moving only the overlying nodes defining the particles. The regular finite element grid remains unchanged. In this method, the mesh does not distort as the particles move. Instead, only the placement of particle-defining nodes changes as the particles move. Element shape functions are updated as the nodes move through the elements. This method is especially suited for models of moderate numbers of moderate-size particles, where the details of the fluid-particle coupling are important. Both the complications of creating finite element meshes around appreciable numbers of particles, and extensive remeshing upon movement of the particles are simplified in this method.     

Modelling of short wave diffraction problems using approximating systems of plane waves

This paper describes a finite element model for the solution of Helmholtz problems at higher frequencies that offers the possibility of computing many wavelengths in a single finite element. The approach is based on partition of unity isoparametric elements. At each finite element node the potential is expanded in a discrete series of planar waves, each propagating at a specified angle. These angles can be uniformly distributed or may be carefully chosen. They can also be the same for all nodes of the studied mesh or may vary from one node to another. The implemented approach is used to solve a few practical problems such as the diffraction of plane waves by cylinders and spheres. The wave number is increased and the mesh remains unchanged until a single finite element contains many wavelengths in each spatial direction and therefore the dimension of the whole problem is greatly reduced. Issues related to the integration and the conditioning are also discussed. Copyright © 2002 John Wiley & Sons, Ltd.     

A cell-based smoothed radial point interpolation method with virtual nodes for three-dimensional mid-frequency acoustic problems

It is well known that the finite element method (FEM) encounters dispersion errors in coping with mid-frequency acoustic problems due to its “overly stiff” nature. By introducing the generalized gradient smoothing technique and the idea of condensed shape functions with virtual nodes, a cell-based smoothed radial point interpolation method is proposed to solve the Helmholtz equation for the purpose of reducing dispersion errors. With the properly selected virtual nodes, the proposed method can provide a close-to-exact stiffness of continuum, leading to a conspicuous decrease in dispersion errors and a significant improvement in accuracy. Numerical examples are examined using the present method by comparing with both the traditional FEM using four-node tetrahedral elements (FEM-T4) and the FEM model using eight-node hexahedral elements with modified integration rules (MIR-H8). The present cell-based smoothed radial point interpolation method has been demonstrated to possess a number of superiorities, including the automatically generated tetrahedral background mesh, high computational efficiency, and insensitivity to mesh distortion, which make the method a good potential for practical analysis of acoustic problems.     

Automatic three-dimensional finite element mesh generation via modified ray casting

Three-dimensional (3-D) finite element mesh generation has been the target of automation due to the complexities associated with generating and visualizing the mesh. A fully automatic 3-D mesh generation method is developed. The method is capable of meshing CSG solid models. It is based on modifying the classical ray-casting technique to meet the requirements of mesh generation. The modifications include the utilization of the element size in the casting process, the utilization of 3-D space box enclosures, and the casting of ray segments (rays with finite length). The method begins by casting ray segments into the solid. Based on the intersections between the segments and the solid boundary, the solid is discretized into cells arranged in a structure. The cell structure stores neighbourhood relations between its cells. Each cell is meshed with valid finite elements. Mesh continuity between cells is achieved via the neighbourhood relations. The last step is to process the boundary elements to represent closely the boundary. The method has been tested and applied to a number of solid models. Sample examples are presented.     

有限元网格图自动生成算法

本文在有限元网格图拓扑分析的基础上,讨论了单元节点拓扑阵自动生成方法和整体节点拓扑阵自动组集方法,并给出了算法。这种方法实现了2D和3D有限元网格图完全自动生成过程,并为单元及节点的相关性分析提供了依据。     

Centroidal Voronoi tessellation‐based finite element superconvergence

In this article, a finding on finite element superconvergence is reported. The Laplacian operator with Dirichlet boundary condition is considered. The linear finite element solutions have an O(h^2+α)(α≈0.5)‐superconvergence in l₂ norm at nodes on an almost equilateral triangular mesh generated based on centroidal Voronoi tessellation, for an arbitrary 2D bounded domain. Extensive numerical examples are presented to demonstrate the superconvergence property. Copyright © 2008 John Wiley & Sons, Ltd.     

An alternative pseudoperipheral node finder for resequencing schemes

Many resequencing algorithms for reducing the bandwidth, profile and wavefront of sparse symmetric matrices have been published. In finite element applications, the sparsity of a matrix is related to the nodal ordering of the finite element mesh. Some of the most successful algorithms, which are based on graph theory, require a pair of starting pseudoperipheral nodes. These nodes, located at nearly maximal distance apart, are determined using heuristic schemes. This paper presents an alternative pseadoperipheral node finder, which is based on the algorithm developed by Gibbs, Poole and Stockmeyer. This modified scheme is suitable for nodal reordering of finite meshes and provides more consistency in the effective selection of the starting nodes in problems where the selection becomes arbitrary due to the number of candidates for these starting nodes. This case arises, in particular, for square meshes. The modified scheme was implemented in Gibbs-Poole-Stockmeyer, Gibbs-King and Sloan algorithms. Test problems of these modified algorithms include: (1) Everstine's 30 benchmark problems; (2) sets of square, rectangular and annular (cylindrical) finite element meshes with quadrilateral and triangular elements; and (3) additional examples originating from mesh refinement schemes. The results demonstrate that the modifications to the original algorithms contribute to the improvement of the reliability of all the resequencing algorithms tested herein for the nodal reordering of finite element meshes.     

A hybrid multiscale finite element/peridynamics method

A hybrid method is presented that uses a representative volume element-based multiscale finite element technique combined with a peridynamics method for modeling fracture surfaces. The hybrid method dynamically switches from finite element computations to peridynamics based on a damage criterion defined on the peridynamics grid, which is coincident with the nodes of the finite element mesh. Nodal forces are either computed by the finite element method or peridynamics, as appropriate. The multiscale finite element method used here is a representative volume element-based approach so that inhomogeneous local scale material properties can be derived using homogenization. In addition, automatic cohesive zone insertion is used at the local scale to model fracture initiation. Results demonstrate that local scale flaw distributions can alter fracture patterns and initiation times, and the use of cohesive zone insertion can improve accuracy of crack paths.     

Modeling of micro-crack growth during thermal shock based on microstructural images of thermal barrier coatings

Based on digital image processing theory and finite element mesh generation principle, a methodology is proposed to model the micro-crack growth of thermal barrier coatings (TBCs) during thermal shock with the aid of finite element program. Firstly, a microstructural image of plasma sprayed TBCs is transferred to digital image; secondly, a finite element grid model is generated by thresholding segmentation according to the actual microstructure; finally, based on the finite element grid model, the Tuler–Butcher failure criterion is employed to model the micro-crack growth of TBCs during thermal shock. The numerical simulation result agrees well with the experimental result, and the methodology presented in this paper is found to be effective to model the micro-crack growth.     

Efficient ALE mesh management for 3D quasi‐Eulerian problems

In computational solid mechanics, the ALE formalism can be very useful to reduce the size of finite element models of continuous forming operations such as roll forming. The mesh of these ALE models is said to be quasi‐Eulerian because the nodes remain almost fixed—or almost Eulerian—in the main process direction, although they are required to move in the orthogonal plane in order to follow the lateral displacements of the solid. This paper extensively presents a complete node relocation procedure dedicated to such ALE models. The discussion focusses on quadrangular and hexahedral meshes with local refinements. The main concern of this work is the preservation of the geometrical features and the shape of the free boundaries of the mesh. With this aim in view, each type of nodes (corner, edge, surface and volume) is treated sequentially with dedicated algorithms. A special care is given to highly curved 3D surfaces for which a CPU‐efficient smoothing technique is proposed. This new method relies on a spline surface reconstruction, on a very fast weighted Laplacian smoother with original weights and on a robust reprojection algorithm. The overall consistency of this mesh management procedure is finally demonstrated in two numerical applications. The first one is a 2D ALE simulation of a drawbead, which provides similar results to an equivalent Lagrangian model yet is much faster. The second application is a 3D industrial ALE model of a 16‐stand roll forming line. In this case, all attempts to perform the same simulation by using the Lagrangian formalism have been unsuccessful. Copyright © 2012 John Wiley & Sons, Ltd.     

The domain composition method applied to Poisson's equation in two dimensions

Domain composition, a recently described method for formulating continuum field problems, removes certain restrictions on the construction of finite element models such that it is possible to solve a finite element problem without using a global compatible mesh. The domain composition method couples or otherwise constrains meshes in local regions to obtain a solution equivalent to that produced by conventional finite element methods. In particular, the domain composition method enables finite element models to be formulated with overlapping elements. Several advantages come from this, including an ability to automatically generate a finite element model from a solid geometric model, an ability to use a variety of element types in a single finite element model and an ability to exactly match element boundaries to the local geometry. This paper shows in detail a finite element formulation of Poisson's equation using domain composition and presents certain key algorithms that incorporate the domain composition method into well-established finite element procedures.