Remeshing for metal forming simulations—Part II: Three‐dimensional hexahedral mesh generation

In the present study, a hexahedral mesh generator was developed for remeshing in three‐dimensional metal forming simulations. It is based on the master grid approach and octree‐based refinement scheme to generate uniformly sized or locally refined hexahedral mesh system. In particular, for refined hexahedral mesh generation, the modified Laplacian mesh smoothing scheme mentioned in the two‐dimensional study (Part I) was used to improve the mesh quality while also minimizing the loss of element size conditions. In order to investigate the applicability and effectiveness of the developed hexahedral mesh generator, several three‐dimensional metal forming simulations were carried out using uniformly sized hexahedral mesh systems. Also, a comparative study of indentation analyses was conducted to check the computational efficiency of locally refined hexahedral mesh systems. In particular, for specification of refinement conditions, distributions of effective strain‐rate gradient and posteriori error values based on a Z² error estimator were used. From this study, it is construed that the developed hexahedral mesh generator can be effectively used for three‐dimensional metal forming simulations. Copyright © 2002 John Wiley & Sons, Ltd.     

The boundary recovery and sliver elimination algorithms of three‐dimensional constrained Delaunay triangulation

A boundary recovery and sliver elimination algorithm of the three‐dimensional constrained Delaunay triangulation is proposed for finite element mesh generation. The boundary recovery algorithm includes two main procedures: geometrical recovery procedure and topological recovery procedure. Combining the advantages of the edges/faces swappings algorithm and edges/faces splittings algorithm presented respectively by George and Weatherill, the geometrical recovery procedure can recover the missing boundaries and guarantee the geometry conformity by introducing fewer Steiner points. The topological recovery procedure includes two phases: ‘dressing wound’ and smoothing, which will overcome topology inconsistency between 3D domain boundary triangles and the volume mesh. In order to solve the problem of sliver elements in the three‐dimensional Delaunay triangulation, a method named sliver decomposition is proposed. By extending the algorithm proposed by Canvendish, the presented method deals with sliver elements by using local decomposition or mergence operation. In this way, sliver elements could be eliminated thoroughly and the mesh quality could be improved in great deal. Copyright © 2006 John Wiley & Sons, Ltd.     

Adaptive multiresolution refinement with distance fields

This paper describes a multiresolution approach to field modeling that can be used with any meshfree or mesh‐based method for adaptive solution refinement. The refined solution is represented as a superposition of a coarse (unrefined) solution and a sequence of refinements that provide additional degrees of freedom with higher spatial or functional resolution. Each refinement is treated as a solution to a boundary‐value problem within a specified refinement window. The proposed approach is based on the meshfree method with distance fields (Comput. Mech. 2000; 25 :305–316, Eng. Comput. 2002; 18 (4):295–311) and guarantees C^m continuity of the refined solutions with matching or non‐matching grids. The method does not restrict the shape of the refinement window and does not place any constraints on the type of basis functions, or relative position and resolution of the refinement grids. Combining the proposed approach with hierarchical space decompositions and a posteriori error estimators results in an effective tool for automatic solution refinement. Carefully chosen numerical examples illustrate the power and advantages of the proposed approach. Copyright © 2007 John Wiley & Sons, Ltd.     

3D boundary recovery by constrained Delaunay tetrahedralization

Three‐dimensional boundary recovery is a fundamental problem in mesh generation. In this paper, we propose a practical algorithm for solving this problem. Our algorithm is based on the construction of a constrained Delaunay tetrahedralization (CDT) for a set of constraints (segments and facets). The algorithm adds additional points (so‐called Steiner points) on segments only. The Steiner points are chosen in such a way that the resulting subsegments are Delaunay and their lengths are not unnecessarily short. It is theoretically guaranteed that the facets can be recovered without using Steiner points. The complexity of this algorithm is analyzed. The proposed algorithm has been implemented. Its performance is reported through various application examples. Copyright © 2010 John Wiley & Sons, Ltd.     

Localized remeshing techniques for three‐dimensional metal forming simulations with linear tetrahedral elements

The localized remeshing technique for three‐dimensional metal forming simulations is proposed based on a mixed finite element formulation with linear tetrahedral elements in the present study. The numerical algorithm to generate linear tetrahedral elements is developed for finite element analyses using the advancing front technique with local optimization method which keeps the advancing fronts smooth. The surface mesh generation using mesh manipulations of the boundary elements of the old mesh system was made to improve mesh quality of the boundary surface elements, resulting in reduction of volume change in forming simulations. The mesh quality generated was compared with that obtained from the commercial CAD package for the complex geometry like lumbar. The simulation results of backward extrusion and bevel gear and spider forgings indicate that the currently developed simulation technique with the localized remeshing can be used effectively to simulate the three‐dimensional forming processes with a reduced computation time. Copyright © 2006 John Wiley & Sons, Ltd.     

A p‐hierarchical adaptive procedure for the scaled boundary finite element method

This paper describes a p‐hierarchical adaptive procedure based on minimizing the classical energy norm for the scaled boundary finite element method. The reference solution, which is the solution of the fine mesh formed by uniformly refining the current mesh element‐wise one order higher, is used to represent the unknown exact solution. The optimum mesh is assumed to be obtained when each element contributes equally to the global error. The refinement criteria and the energy norm‐based error estimator are described and formulated for the scaled boundary finite element method. The effectivity index is derived and used to examine quality of the proposed error estimator. An algorithm for implementing the proposed p‐hierarchical adaptive procedure is developed. Numerical studies are performed on various bounded domain and unbounded domain problems. The results reflect a number of key points. Higher‐order elements are shown to be highly efficient. The effectivity index indicates that the proposed error estimator based on the classical energy norm works effectively and that the reference solution employed is a high‐quality approximation of the exact solution. The proposed p‐hierarchical adaptive strategy works efficiently. Copyright © 2007 John Wiley & Sons, Ltd.     

Dual boundary‐element method: Simple error estimator and adaptivity

This paper is concerned with the effective numerical implementation of the adaptive dual boundary‐element method (DBEM), for two‐dimensional potential problems. Two boundary integral equations, which are the potential and the flux equations, are applied for collocation along regular and degenerate boundaries, leading always to a single‐region analysis. Taking advantage on the use of non‐conforming parametric boundary‐elements, the method introduces a simple error estimator, based on the discontinuity of the solution across the boundaries between adjacent elements and implements the p, h and mixed versions of the adaptive mesh refinement. Examples of several geometries, which include degenerate boundaries, are analyzed with this new formulation to solve regular and singular problems. The accuracy and efficiency of the implementation described herein make this a reliable formulation of the adaptive DBEM. Copyright © 2011 John Wiley & Sons, Ltd.     

Three‐dimensional superconvergent gradient recovery on tetrahedral meshes

In this paper, finite element superconvergence phenomenon based on centroidal Voronoi Delaunay tessellations (CVDT) in three‐dimensional space is investigated. The Laplacian operator with the Dirichlet boundary condition is considered. A modified superconvergence patch recovery (MSPR) method is established to overcome the influence of slivers on CVDT meshes. With these two key preconditions, a CVDT mesh and the MSPR, the gradients recovered from the linear finite element solutions have superconvergence in the l₂ norm at nodes of a CVDT mesh for an arbitrary three‐dimensional bounded domain. Numerous numerical examples are presented to demonstrate this superconvergence property and good performance of the MSPR method. Copyright © 2016 John Wiley & Sons, Ltd.     

Analysis of three‐dimensional fracture mechanics problems: A two‐scale approach using coarse‐generalized FEM meshes

This paper presents a generalized finite element method (GFEM) based on the solution of interdependent global (structural) and local (crack)‐scale problems. The local problems focus on the resolution of fine‐scale features of the solution in the vicinity of three‐dimensional cracks, while the global problem addresses the macro‐scale structural behavior. The local solutions are embedded into the solution space for the global problem using the partition of unity method. The local problems are accurately solved using an hp‐GFEM and thus the proposed method does not rely on analytical solutions. The proposed methodology enables accurate modeling of three‐dimensional cracks on meshes with elements that are orders of magnitude larger than the process zone along crack fronts. The boundary conditions for the local problems are provided by the coarse global mesh solution and can be of Dirichlet, Neumann or Cauchy type. The effect of the type of local boundary conditions on the performance of the proposed GFEM is analyzed. Several three‐dimensional fracture mechanics problems aimed at investigating the accuracy of the method and its computational performance, both in terms of problem size and CPU time, are presented. Copyright © 2009 John Wiley & Sons, Ltd.     

A parallel implicit/explicit hybrid time domain method for computational electromagnetics

The numerical solution of Maxwell's curl equations in the time domain is achieved by combining an unstructured mesh finite element algorithm with a cartesian finite difference method. The practical problem area selected to illustrate the application of the approach is the simulation of three‐dimensional electromagnetic wave scattering. The scattering obstacle and the free space region immediately adjacent to it are discretized using an unstructured mesh of linear tetrahedral elements. The remainder of the computational domain is filled with a regular cartesian mesh. These two meshes are overlapped to create a hybrid mesh for the numerical solution. On the cartesian mesh, an explicit finite difference method is adopted and an implicit/explicit finite element formulation is employed on the unstructured mesh. This approach ensures that computational efficiency is maintained if, for any reason, the generated unstructured mesh contains elements of a size much smaller than that required for accurate wave propagation. A perfectly matched layer is added at the artificial far field boundary, created by the truncation of the physical domain prior to the numerical solution. The complete solution approach is parallelized, to enable large‐scale simulations to be effectively performed. Examples are included to demonstrate the numerical performance that can be achieved. Copyright © 2009 John Wiley & Sons, Ltd.     

Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations

The centroidal Voronoi tessellation based Delaunay triangulation (CVDT) provides an optimal distribution of generating points with respect to a given density function and accordingly generates a high‐quality mesh. In this paper, we discuss algorithms for the construction of the constrained CVDT from an initial Delaunay tetrahedral mesh of a three‐dimensional domain. By establishing an appropriate relationship between the density function and the specified sizing field and applying the Lloyd's iteration, the constrained CVDT mesh is obtained as a natural global optimization of the initial mesh. Simple local operations such as edges/faces flippings are also used to further improve the CVDT mesh. Several complex meshing examples and their element quality statistics are presented to demonstrate the effectiveness and efficiency of the proposed mesh generation and optimization method. Copyright © 2003 John Wiley & Sons, Ltd.     

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.     

Universal meshes: A method for triangulating planar curved domains immersed in nonconforming meshes

We introduce a new method to triangulate planar, curved domains that transforms a specific collection of triangles in a background mesh to conform to the boundary. In the process, no new vertices are introduced, and connectivities of triangles are left unaltered. The method relies on a novel way of parameterizing an immersed boundary over a collection of nearby edges with its closest point projection. To guarantee its robustness, we require that the domain be C²‐regular, the background mesh be sufficiently refined near the boundary, and that specific angles in triangles near the boundary be strictly acute. The method can render both straight‐edged and curvilinear triangulations for the immersed domain. The latter includes curved triangles that conform exactly to the immersed boundary, and ones constructed with isoparametric mappings to interpolate the boundary at select points. High‐order finite elements constructed over these curved triangles achieve optimal accuracy, which has customarily proven difficult in numerical schemes that adopt nonconforming meshes. Aside from serving as a quick and simple tool for meshing planar curved domains with complex shapes, the method provides significant advantages for simulating problems with moving boundaries and in numerical schemes that require iterating over the geometry of domains. With no conformity requirements, the same background mesh can be adopted to triangulate a large family of domains immersed in it, including ones realized over several updates during the coarse of simulating problems with moving boundaries. We term such a background mesh as a universal mesh for the family of domains it can be used to triangulate. Universal meshes hence facilitate a framework for finite element calculations over evolving domains while using only fixed background meshes. Furthermore, because the evolving geometry can be approximated with any desired order, numerical solutions can be computed with high‐order accuracy. We present demonstrative examples using universal meshes to simulate the interaction of rigid bodies with Stokesian fluids. Copyright © 2014 John Wiley & Sons, Ltd.     

Tetrahedral mesh generation using Delaunay refinement with non‐standard quality measures

This paper studies the practical performance of Delaunay refinement tetrahedral mesh generation algorithms. By using non‐standard quality measures to drive refinement, we show that sliver tetrahedra can be eliminated from constrained Delaunay tetrahedralizations solely by refinement. Despite the fact that quality guarantees cannot be proven, the algorithm can consistently generate meshes with dihedral angles between 18^circ and 154^°. Using a fairer quality measure targeting every type of bad tetrahedron, dihedral angles between 14^° and 154^° can be obtained. The number of vertices inserted to achieve quality meshes is comparable to that needed when driving refinement with the standard circumradius‐to‐shortest‐edge ratio. We also study the use of mesh improvement techniques on Delaunay refined meshes and observe that the minimum dihedral angle can generally be pushed above 20^°, regardless of the quality measure used to drive refinement. The algorithm presented in this paper can accept geometric domains whose boundaries are piecewise smooth. Copyright © 2011 John Wiley & Sons, Ltd.     

The maximum principle violations of the mixed‐hybrid finite‐element method applied to diffusion equations

The abundant literature of finite‐element methods applied to linear parabolic problems, generally, produces numerical procedures with satisfactory properties. However, some initial–boundary value problems may cause large gradients at some points and consequently jumps in the solution that usually needs a certain period of time to become more and more smooth. This intuitive fact of the diffusion process necessitates, when applying numerical methods, varying the mesh size (in time and space) according to the smoothness of the solution. In this work, the numerical behaviour of the time‐dependent solutions for such problems during small time duration obtained by using a non‐conforming mixed‐hybrid finite‐element method (MHFEM) is investigated. Numerical comparisons with the standard Galerkin finite element (FE) as well as the finite‐difference (FD) methods are checked. Owing to the fact that the mixed methods violate the discrete maximum principle, some numerical experiments showed that the MHFEM leads sometimes to non‐physical peaks in the solution. A diffusivity criterion relating the mesh steps for an artificial initial–boundary value problem will be presented. One of the propositions given to avoid any non‐physical oscillations is to use the mass‐lumping techniques. Copyright © 2002 John Wiley & Sons, Ltd.     

Accuracy of Galerkin finite elements for groundwater flow simulations in two and three‐dimensional triangulations

In standard finite element simulations of groundwater flow the correspondence between hydraulic head gradients and groundwater fluxes is represented by the stiffness matrix. In two‐dimensional problems the use of linear triangular elements on Delaunay triangulations guarantees a stiffness matrix of type M. This implies that the local numerical fluxes are physically consistent with Darcy's law. This condition is fundamental to avoid the occurrence of local maxima or minima, and is of crucial importance when the calculated flow field is used in contaminant transport simulations or pathline evaluation. In three spatial dimensions, the linear Galerkin approach on tetrahedra does not lead to M‐matrices even on Delaunay meshes. By interpretation of the Galerkin approach as a subdomain collocation scheme, we develop a new approach (OSC, orthogonal subdomain collocation) that is shown to produce M‐matrices in three‐dimensional Delaunay triangulations. In case of heterogeneous and anisotropic coefficients, extra mesh properties required for M‐stiffness matrices will also be discussed. Copyright © 2001 John Wiley & Sons, Ltd.     

A multi‐level adaptive mesh refinement method for level set simulations of multiphase flow on unstructured meshes

An adaptive mesh refinement (AMR) technique is proposed for level set simulations of incompressible multiphase flows. The present AMR technique is implemented for two‐dimensional/three‐dimensional unstructured meshes and extended to multi‐level refinement. Smooth variation of the element size is guaranteed near the interface region with the use of multi‐level refinement. A Courant–Friedrich–Lewy condition for zone adaption frequency is newly introduced to obtain a mass‐conservative solution of incompressible multiphase flows. Finite elements around the interface are dynamically refined using the classical element subdivision method. Accordingly, finite element method is employed to solve the problems governed by the incompressible Navier–Stokes equations, using the level set method for dynamically updated meshes. The accuracy of the adaptive solutions is found to be comparable with that of non‐adaptive solutions only if a similar mesh resolution near the interface is provided. Because of the substantial reduction in the total number of nodes, the adaptive simulations with two‐level refinement used to solve the incompressible Navier–Stokes equations with a free surface are about four times faster than the non‐adaptive ones. Further, the overhead of the present AMR procedure is found to be very small, as compared with the total CPU time for an adaptive simulation. Copyright © 2016 John Wiley & Sons, Ltd.     

An HR-method of mesh refinement for boundary element method

This paper describes a mesh refinement technique for boundary element method in which the number of elements, the size of elements and the element end location are determined iteratively in order to obtain a user specified accuracy. The method uses L₁ norm as a measure of error in the density function and a grading function that ensures that error over each element is the same. The use of grading function along with L₁ norm makes the mesh refinement technique applicable to Direct and Indirect boundary element method formulation for a variety of boundary element method applications. Numerical problems in elastostatics, fracture mechanics, and bending of plate solved using Direct and Indirect method in which the density functions are approximated by Linear Lagrange, Quadratic Lagrange or Cubic Hermite polynomials validate the effectiveness of the proposed mesh refinement technique. © 1998 John Wiley & Sons, Ltd.     

An adaptive remeshing procedure for discontinuous finite element limit analysis

An adaptive remeshing procedure is proposed for discontinuous finite element limit analysis. The procedure proceeds by iteratively adjusting the element sizes in the mesh to distribute local errors uniformly over the domain. To facilitate the redefinition of element sizes in the new mesh, the interelements discontinuous field of elemental bound gaps is converted into a continuous field, ie, the intensity of bound gap, using a patch‐based approximation technique. An analogous technique is subsequently used for the approximation of element sizes in the old mesh. With these information, an optimized distribution of element sizes in the new mesh is defined and then scaled to match the total number of elements specified for each iteration in the adaptive remeshing process. Finally, a new mesh is generated using the advancing front technique. This adaptive remeshing procedure is repeated several times until an optimal mesh is found. Additionally, for problems involving discontinuous boundary loads, a novel algorithm for the generation of fan‐type meshes around singular points is proposed explicitly and incorporated into the main adaptive remeshing procedure. To demonstrate the feasibility of our proposed method, some classical examples extracted from the existing literary works are studied in detail.     

A unified 3D‐based technique for plate bending analysis using scaled boundary finite element method

This paper presents a unified technique for solving the plate bending problems by extending the scaled boundary finite element method. The formulation is based on the three‐dimensional governing equation without enforcing the kinematics of plate theory. Only the in‐plane dimensions are discretised into finite elements. Any two‐dimensional displacement‐based elements can be employed. The solution along the thickness is expressed analytically by using a matrix function. The proposed technique is consistent with the three‐dimensional theory and applicable to both thick and thin plates without exhibiting the numerical locking phenomenon. Moreover, the use of higher order spectral elements allows the proposed technique to better represent curved boundaries and to achieve high accuracy and fast convergence. Numerical examples of various plate structures with different thickness‐to‐length ratios demonstrate the applicability and accuracy of the proposed technique. Copyright © 2012 John Wiley & Sons, Ltd.