An approach to refining three-dimensional tetrahedral meshes based on Delaunay transformations

A technique for refining three-dimensional tetrahedral meshes is proposed in this paper. The proposed technique is capable of treating arbitrary unstructured tetrahedral meshes, convex or non-convex with multiple regions resulting in high quality constrained Delaunay triangulations. The tetrahedra generated are of high quality (nearly equilateral). Sliver tetrahedra, which present a real problem to many algorithms are not produced with the new method. The key to the generation of high quality tetrahedra is the iterative application of a set of topological transformations based on the Voronoi–Delaunay theory and a reposition of nodes technique. The computational requirements of the proposed technique are in linear relationship with the number of nodes and tetrahedra, making it ideal for direct employment in a fully automatic finite element analysis system for 3-D adaptive mesh refinement. Application to some test problems is presented to show the effectiveness and applicability of the new method.     

Hybrid parallel multigrid preconditioner based on automatic mesh coarsening for 3D metal forming simulations

A parallel multigrid (MG) method is developed to reduce the large computational costs involved by the finite element simulation of highly viscous fluid flows, especially those resulting from metal forming applications, which are characterized by using a mixed velocity/pressure implicit formulation, unstructured meshes of tetrahedra, and frequent remeshings. The developed MG method follows a hybrid approach where the different levels of nonnested meshes are geometrically constructed by mesh coarsening, while the linear systems of the intermediate levels result from the Galerkin algebraic approach. A linear O(N) convergence rate is expected (with N being the number of unknowns), while keeping software parallel efficiency. These objectives lead to selecting unusual MG smoothers (iterative solvers) for the upper grid levels and to developing parallel mesh coarsening algorithms along with parallel transfer operators between the different levels of partitioned meshes. Within the utilized PETSc library, the developed MG method is employed as a preconditioner for the usual conjugate residual algorithm because of the symmetric undefinite matrix of the system to solve. It shows a convergence rate close to optimal, an excellent parallel efficiency, and the ability to handle the complex forming problems encountered in 3‐dimensional hot forging, which involve large material deformations and frequent remeshings.     

Filling space with tetrahedra

In the context of 3D finite element meshes various options for filling an indefinite space (such as would be approached within a fine mesh) with tetrahedra are considered. This problem is not trivial as it is in 2‐D since, unlike equilateral triangles, regular tetrahedra cannot be fitted together to fill space. Various groupings, or assemblies, which can be repeated indefinitely to fill space are considered. By altering the shape of the tetrahedra in one of these to minimize a suitable function a unique shape of tetrahedron is obtained which optimizes the conditioning. The mesh thus produced is shown to be better conditioned than alternatives based on assemblies of different shaped tetrahedra. A number of conditioning measures are used to confirm this. Finally, actual meshes which fit boundaries are briefly considered. Copyright © 1999 John Wiley & Sons, Ltd.     

Multigrid solution of the 3-D compressible euler equations on unstructured tetrahedral grids

A low storage, computationally efficient algorithm for the solution of the compressible Euler equations on unstructured tetrahedral meshes is developed. The algorithm takes the form of a centred scheme with the explicit addition of a high accuracy artificial viscosity and the solution is advanced to steady state by means of a multi-stage time stepping method. The side based data structure which is employed enables a clear connection to be established between the proposed algorithm and upwind cell vertex schemes for unstructured meshes. The computational efficiency of the procedure is improved by incorporating an unstructured multigrid acceleration procedure. A number of flows of practical interest are analysed to demonstrate the numerical performance of the proposed approach.     

Tetrahedral mesh generation in polyhedral regions based on convex polyhedron decompositions

A method using techniques of computational geometry for generating tetrahedral finite element meshes in three-dimensional polyhedral regions is presented. The input to the method consists of the boundary faces of the polyhedral region and possibly internal and hole interfaces, plus the desired number of tetrahedra and other scalar parameters. The region is decomposed into convex polyhedra in two stages so that tetrahedra of one length scale can be generated in each subregion. A mesh distribution function, which is either automatically constructed from the first-stage convex polyhedron decomposition or supplied by the user, is used to determine the tetrahedron sizes in the subregions. Then a boundary-constrained triangulation is constructed in each convex polyhedron, with local transformations being used to improve the quality of the tetrahedra. Experimental results from triangulations of three regions are provided.     

Flux‐difference splitting scheme with modified multidimensional dissipation on unstructured meshes

Abstract

A flux‐difference splitting scheme with a modified multidimensional dissipation for high‐speed compressible flow analysis on unstructured meshes is presented. The scheme eliminates unphysical flow behaviors such as a spurious bump of the carbuncle phenomenon that occurs on the bow shock from flow over a blunt body, and the expansion shock generated from flow over a forward facing step. The switching function suggested by Quirk is implemented as a choice to detect the vicinity of strong shock. The proposed scheme is further extended to obtain higher‐order spatial and temporal solution accuracy. The scheme is, in addition, combined with an adaptive meshing technique that generates unstructured triangular meshes to resemble the flow phenomena for reducing computational effort. The entire procedure is evaluated by solving several benchmarks as well as steady‐state and transient high‐speed compressible flow problems.     

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.     

Automatic and efficient hybrid viscous mesh generation based on clipped Voronoi diagrams

The commonly used advancing layers method to generate hybrid meshes suffers from many drawbacks. The generation of isotropic meshes for far-field domains with irregular and complex boundary subdivisions after boundary layers advancing is time consuming and, in some cases, is not robust in 3D. To address these difficulties, this paper presents a novel method to generate hybrid polygonal meshes in 2D and polyhedral meshes in 3D for viscous flow simulations. In the proposed method, first, we generate a full Voronoi diagram for the appropriate distribution of generators that avoids the extra mesh generation required for the remaining holes in the advancing layers method. To recover the inner solid boundaries, we implement a robust boundary cell cutting process. Because the generators are located layer by layer near the boundaries, there is no requirement to consider all of the Voronoi cells. Only the first layer Voronoi cells must be cut, making the calculation very efficient. We have generated hybrid meshes using the present method for many viscous flow cases. The results show close agreement between the computations and the experimental results, thus indicating the reliability and effectiveness of the hybrid mesh generated by our method.     

Assessment of three preconditioning schemes for solution of the two‐dimensional Euler equations at low Mach number flows

Three preconditioners proposed by Eriksson, Choi and Merkel, and Turkel are implemented in a 2D upwind Euler flow solver on unstructured meshes. The mathematical formulations of these preconditioning schemes for different sets of primitive variables are drawn, and their eigenvalues and eigenvectors are compared with each other. For this purpose, these preconditioning schemes are expressed in a unified formulation. A cell‐centered finite volume Roe's method is used for the discretization of the preconditioned Euler equations. The accuracy and performance of these preconditioning schemes are examined by computing steady low Mach number flows over a NACA0012 airfoil and a two‐element NACA4412–4415 airfoil for different conditions. The study shows that these preconditioning schemes greatly enhance the accuracy and convergence rate of the solution of low Mach number flows. The study indicates that the preconditioning methods implemented provide nearly the same results in accuracy; however, they give different performances in convergence rate. It is demonstrated that although the convergence rate of steady solutions is almost independent of the choice of primitive variables and the structure of eigenvectors and their orthogonality, the condition number of the system of equations plays an important role, and it determines the convergence characteristics of solutions. Copyright © 2011 John Wiley & Sons, Ltd.     

A dual-time method for two-dimensional unsteady incompressible flow calculations

A method for computing unsteady incompressible viscous flows on moving or deforming meshes is described. It uses a well-established time-marching finite-volume flow solver, developed for steady compressible flows past rigid bodies. Time-marching methods cannot be applied directly to incompressible flows because the governing equations are not hyperbolic. Such methods can be extended to steady incompressible flows using an artificial compressibility scheme. A time-accurate scheme for unsteady incompressible flows is achieved by using an implicit real-time discretization and a dual-time approach, which uses a technique similar to the artificial compressibility scheme. Results are presented for test cases on both fixed and deforming meshes. Experimental, numerical and theoretical data have been included for comparison where available and reasonable agreement has been achieved. © 1998 John Wiley & Sons, Ltd.     

An implicit–explicit solution method for electro‐osmotic flow through three‐dimensional micro‐channels

This paper presents a comprehensive finite‐element modelling approach to electro‐osmotic flows on unstructured meshes. The non‐linear equation governing the electric potential is solved using an iterative algorithm. The employed algorithm is based on a preconditioned GMRES scheme. The linear Laplace equation governing the external electric potential is solved using a standard pre‐conditioned conjugate gradient solver. The coupled fluid dynamics equations are solved using a fractional step‐based, fully explicit, artificial compressibility scheme. This combination of an implicit approach to the electric potential equations and an explicit discretization to the Navier–Stokes equations is one of the best ways of solving the coupled equations in a memory‐efficient manner. The local time‐stepping approach used in the solution of the fluid flow equations accelerates the solution to a steady state faster than by using a global time‐stepping approach. The fully explicit form and the fractional stages of the fluid dynamics equations make the system memory efficient and free of pressure instability. In addition to these advantages, the proposed method is suitable for use on both structured and unstructured meshes with a highly non‐uniform distribution of element sizes. The accuracy of the proposed procedure is demonstrated by solving a basic micro‐channel flow problem and comparing the results against an analytical solution. The comparisons show excellent agreement between the numerical and analytical data. In addition to the benchmark solution, we have also presented results for flow through a fully three‐dimensional rectangular channel to further demonstrate the application of the presented method. Copyright © 2007 John Wiley & Sons, Ltd.     

Parallelized FVM algorithm for three-dimensional viscoelastic flows

 A parallel implementation for the finite volume method (FVM) for three-dimensional (3D) viscoelastic flows is developed on a distributed computing environment through Parallel Virtual Machine (PVM). The numerical procedure is based on the SIMPLEST algorithm using a staggered FVM discretization in Cartesian coordinates. The final discretized algebraic equations are solved with the TDMA method. The parallelisation of the program is implemented by a domain decomposition strategy, with a master/slave style programming paradigm, and a message passing through PVM. A load balancing strategy is proposed to reduce the communications between processors. The three-dimensional viscoelastic flow in a rectangular duct is computed with this program. The modified Phan-Thien–Tanner (MPTT) constitutive model is employed for the equation system closure. Computing results are validated on the secondary flow problem due to non-zero second normal stress difference N ₂. Three sets of meshes are used, and the effect of domain decomposition strategies on the performance is discussed. It is found that parallel efficiency is strongly dependent on the grid size and the number of processors for a given block number. The convergence rate as well as the total efficiency of domain decomposition depends upon the flow problem and the boundary conditions. The parallel efficiency increases with increasing problem size for given block number. Comparing to two-dimensional flow problems, 3D parallelized algorithm has a lower efficiency owing to largely overlapped block interfaces, but the parallel algorithm is indeed a powerful means for large scale flow simulations. Received: 2 July 2002 / Accepted: 15 November 2002 This research is supported by an A^⋆STAR Grant EMT/00/011.     

Construction of tetrahedral meshes of degree two

There is a need for finite elements of degree two or more to solve various PDE problems. This paper discusses a method to construct such meshes in the case of tetrahedral element of degree two. The first section of this paper returns to Bézier curves, Bézier triangles and then Bézier tetrahedra of degree two. The way in which a Bézier tetrahedron and a P2 finite element tetrahedron are related is introduced. A validity condition is then exhibited. Extension to arbitrary degree and dimension is given. A construction method is then proposed and demonstrated by means of various concrete application examples. Copyright © 2012 John Wiley & Sons, Ltd.     

Variational generation of prismatic boundary‐layer meshes for biomedical computing

Boundary‐layer meshes are important for numerical simulations in computational fluid dynamics, including computational biofluid dynamics of air flow in lungs and blood flow in hearts. Generating boundary‐layer meshes is challenging for complex biological geometries. In this paper, we propose a novel technique for generating prismatic boundary‐layer meshes for such complex geometries. Our method computes a feature size of the geometry, adapts the surface mesh based on the feature size, and then generates the prismatic layers by propagating the triangulated surface using the face‐offsetting method. We derive a new variational method to optimize the prismatic layers to improve the triangle shapes and edge orthogonality of the prismatic elements and also introduce simple and effective measures to guarantee the validity of the mesh. Coupled with a high‐quality tetrahedral mesh generator for the interior of the domain, our method generates high‐quality hybrid meshes for accurate and efficient numerical simulations. We present comparative study to demonstrate the robustness and quality of our method for complex biomedical geometries. Copyright © 2009 John Wiley & Sons, Ltd.     

Mixed finite element approximations based on 3‐D hp‐adaptive curved meshes with two types of H(div)‐conforming spaces

Two stable approximation space configurations are treated for the mixed finite element method for elliptic problems based on curved meshes. Their choices are guided by the property that, in the master element, the image of the flux space by the divergence operator coincides with the potential space. By using static condensation, the sizes of global condensed matrices, which are proportional to the dimension of border fluxes, are the same in both configurations. The meshes are composed of different topologies (tetrahedra, hexahedra, or prisms). Simulations using asymptotically affine uniform meshes, exactly fitting a spherical‐like region, and constant polynomial degree distribution k, show L² errors of order k+1 or k+2 for the potential variable, while keeping order k+1 for the flux in both configurations. The first case corresponds to RT(k) and BDFM(k+1) spaces for hexahedral and tetrahedral meshes, respectively, but holding for prismatic elements as well. The second case, further incrementing the order of approximation of the potential variable, holds for the three element topologies. The case of hp‐adaptive meshes is considered for a problem modelling a porous media flow around a cylindrical horizontal well with elliptical drainage area. The effect of parallelism and static condensation in CPU time reduction is illustrated.     

Efficient load balancing for parallel adaptive finite-element electromagnetics with vector tetrahedra

The potential benefits of employing optimal discretization-based (ODB) refinement criteria for vector tetrahedra to achieve load balancing in three-dimensional parallel adaptive finite-element electromagnetic analysis are considered. Specifically, the ability of this class of adaption refinement criteria to resolve effective domain decompositions based on initial discretizations with only relatively few tetrahedra is examined for generalized vector Helmholtz systems. The effectiveness of the new load balancing method is demonstrated with adaptively refined finite-element meshes for benchmark systems.     

Mesh generation and adaptivity for the solution of compressible viscous high speed flows

An implicit–explicit procedure for the solution of the compressible Navier–Stokes equations on unstructured triangular and tetrahedral meshes is outlined. A procedure for constructing continuous lines, made up of edges in the mesh, is employed and the implicit equation system is solved via line relaxation. The problem of generating, and adapting, unstructured meshes for viscous flow simulations is addressed. A number of examples are included which demonstrate the numerical performance of the proposed procedures.     

Integral transform solution of internal flow problems based on Navier–Stokes equations and primitive variables formulation

The generalized integral transform technique (GITT) is employed in the solution of incompressible laminar channel flows as formulated by the steady‐state Navier–Stokes and continuity equations under the primitive variables mathematical representation. A hybrid numerical–analytical solution is developed based on eigenfunction expansions in one space co‐ordinate and error‐controlled numerical solution of the resulting system of coupled ordinary differential equations in the remaining space direction. The approach is illustrated for developing flow between parallel‐plates with uniform and irrotational inlet flow condition. The conventional Poisson‐type equation for the pressure field with appropriate boundary conditions is also transformed and simultaneously solved with the momentum equation along the longitudinal direction, by considering eigenvalue problems for each of the two potentials, defined in the transversal direction. The transversal velocity component is then explicitly determined from the continuity equation. Numerical results of the longitudinal velocity component and friction factor fields are reported to illustrate the convergence behaviour and user prescribed error control inherent to the proposed hybrid approach. Critical comparisons with previous contributions on the same method that made use of the streamfunction‐only formulation are also provided. Copyright © 2006 John Wiley & Sons, Ltd.     

Adaptive mesh refinement applied to the scalar transported PDF equation in a turbulent jet

This paper describes a novel solution method for the transported probability density function (PDF) equation for scalars (compositions). In contrast to conventional solution methods based on the Monte Carlo approach, we use a finite‐volume method combined with adaptive mesh refinement (AMR) applied in both physical and compositional space. The obvious advantage of this over a uniform grid is that fine meshes are only used where the solution requires high resolution. The efficiency of the method is demonstrated by a number of tests involving a turbulent jet flow with up to two scalars (both reacting and non‐reacting). We find that the AMR calculation can be at a fraction of the computer cost of a uniform grid calculation with the same accuracy. Copyright © 2010 John Wiley & Sons, Ltd.     

Checking the topological consistency of a finite element mest

Algorithms are described for checking the topological consistency of two- or three-dimensional meshes. Two-dimensional meshes may include mixtures of triangles, quadrilaterals and other polygons with optional edge or centre nodes; three-dimensional meshes may include mixtures of cuboids and tetrahedra with optional edge; sie or internal nodes.