Adaptive modification of time evolving meshes

The accuracy of a finite element computation depends on the mesh size and the distribution of mesh points. Adapting the mesh to capture the salient features in the finite element computation can provide a much more accurate solution without imposing an excessive increase in mesh size and computational cost. When the shape of the meshed domain is evolving in time mesh adaptation is essential in order to maintain conformity of the mesh with the domain boundaries. Mesh adaptation for time evolving domains can be accomplished through a combination of mesh movement with mesh modification by selective coarsening and enrichment of various regions in the mesh. Large deformations of the computational domain and boundary can be accommodated if overall mesh quality is maintained after each adaptation cycle.     

Moving mesh methods for solving parabolic partial differential equations

A new adaptive method is described for solving nonlinear parabolic partial differential equations with moving boundaries, using a moving mesh with continuous finite elements. The evolution of the mesh within the interior of the spatial domain is based upon conserving the distribution of a chosen monitor function across the domain throughout time, where the initial distribution is selected based upon the given initial data. The mesh movement at the boundary is governed by a second monitor function, which may or may not be the same as that used to drive the interior mesh movement. The method is described in detail and a selection of computational examples are presented using different monitor functions applied to the porous medium equation (PME) in one and two space dimensions.     

An in-core grid index for transferring finite element data across dissimilar meshes

The simulation of a manufacturing process chain with the finite element method requires the selection of an appropriate finite element solver, element type and mesh density for each process of the chain. When the simulation results of one step are needed in a subsequent one, they have to be interpolated and transferred to another model. This paper presents an in-core grid index that can be created on a mesh represented by a list of nodes/elements. Finite element data can thus be transferred across different models in a process chain by mapping nodes or elements in indexed meshes. For each nodal or integration point of the target mesh, the index on the source mesh is searched for a specific node or element satisfying certain conditions, based on the mapping method. The underlying space of an indexed mesh is decomposed into a grid of variable-sized cells. The index allows local searches to be performed in a small subset of the cells, instead of linear searches in the entire mesh which are computationally expensive. This work focuses on the implementation and computational efficiency of indexing, searching and mapping. An experimental evaluation on medium-sized meshes suggests that the combination of index creation and mapping using the index is much faster than mapping through sequential searches.     

Intelligent finite element mesh generation

A knowledge-based and automatic finite element mesh generator (INTELMESH) for two-dimensional linear elasticity problems is presented. Unlike other approaches, the proposed technique incorporates the information about the object geometry as well as the boundary and loading conditions to generate an a priori finite element mesh which is more refined around the critical regions of the problem domain. INTELMESH uses a blackboard architecture expert system and the new concept of substracting to locate the critical regions in the domain and to assign priority and mesh size to them. This involves the decomposition of the original structure into substructures (or primitives) for which an initial and approximate analysis can be performed by using analytical solutions and heuristics. It then uses the concept of wave propagation to generate graded nodes in the whole domain with proper density distribution. INTELMESH is fully automatic and allows the user to define the problem domain with minimum amount of input such as object geometry and boundary and loading conditions. Once nodes have been generated for the entire domain, they are automatically connected to form well-shaped triangular elements ensuring the Delaunay property. Several examples are presented and discussed. When incorporated into and compared with the traditional approach to the adaptive finite element analysis, it is expected that the proposed approach, which starts the process with near optimal initial meshes, will be more accurate and efficient.     

Adaptive Multilevel Correction Method for Finite Element Approximations of Elliptic Optimal Control Problems

In this paper we propose an adaptive multilevel correction scheme to solve optimal control problems discretized with finite element method. Different from the classical adaptive finite element method (AFEM for short) applied to optimal control which requires the solution of the optimization problem on new finite element space after each mesh refinement, with our approach we only need to solve two linear boundary value problems on current refined mesh and an optimization problem on a very low dimensional space. The linear boundary value problems can be solved with well-established multigrid method designed for elliptic equation and the optimization problems are of small scale corresponding to the space built with the coarsest space plus two enriched bases. Our approach can achieve the similar accuracy with standard AFEM but greatly reduces the computational cost. Numerical experiments demonstrate the efficiency of our proposed algorithm.     

A general purpose adaptivity driver for FE software

This paper describes a tool that serves as an automatic mesh adaptivity driver program for general purpose finite element (FE) software packages. Many commercially available FE programs lack a feature to control the numerical solution's accuracy properly. Our tool implements a mesh adaptive method that, in conjunction with separate finite element software, allows one to fully automatically improve the quality of the numerical solution up to a user specified accuracy. We demonstrate the use of the package with selected computational examples performed with a commercial FE package, ANSYS, and with our FE program FEMEngine. Copyright © 2003 John Wiley & Sons, Ltd.     

Development of an object-oriented finite element program with adaptive mesh refinement for multi-physics applications

In this paper, an object-oriented framework for numerical analysis of multi-physics applications is presented. The framework is divided into several basic sets of classes that enable the code segments to be built according to the type of problem to be solved. Fortran 2003 was used in the development of this finite element program due to its advantages for scientific and engineering programming and its new object-oriented features. The program was developed with h-type adaptive mesh refinement, and it was tested for several classical cases involving heat transfer, fluid mechanics and structural mechanics. The test cases show that the adaptive mesh is refined only in the localization region where the feature gradient is relatively high. The overall mesh refinement and the h-adaptive mesh refinement were justified with respect to the computational accuracy and the CPU time cost. Both methods can improve the computational accuracy with the refinement of mesh. The overall mesh refinement causes the CPU time cost to greatly increase as the mesh is refined. However, the CPU time cost does not increase very much with the increase of the level of h-adaptive mesh refinement. The CPU time cost can be saved by up to 90%, especially for the simulated system with a large number of elements and nodes.     

Subdivision templates for converting a non-conformal hex-dominant mesh to a conformal hex-dominant mesh without pyramid elements

This paper presents a computational method for converting a non-conformal hex-dominant mesh to a conformal hex-dominant mesh without help of pyramid elements. During the conversion, the proposed method subdivides a non-conformal element by applying a subdivision template and conformal elements by a conventional subdivision scheme. Although many finite element solvers accept mixed elements, some of them require a mesh to be conformal without a pyramid element. None of the published automated methods could create a conformal hex-dominant mesh without help of pyramid elements, and therefore the applicability of the hex-dominant mesh has been significantly limited. The proposed method takes a non-conformal hex-dominant mesh as an input and converts it to a conformal hex-dominant mesh that consists only of hex, tet, and prism elements. No pyramid element will be introduced. The conversion thus considerably increases the applicability of the hex-dominant mesh in many finite element solvers.     

Construction of near optimal meshes for 3D curved domains with thin sections and singularities for p-version method

The adaptive variable p- and hp-version finite element method can achieve exponential convergence rate when a near optimal finite element mesh is provided. For general 3D domains, near optimal p-version meshes require large curved elements over the smooth portions of the domain, geometrically graded curved elements to the singular edges and vertices, and a controlled layer of curved prismatic elements in the thin sections. This paper presents a procedure that accepts a CAD solid model as input and creates a curved mesh with the desired characteristics. One key component of the procedure is the automatic identification of thin sections of the model through a set of discrete medial surface points computed from an Octree-based tracing algorithm and the generation of prismatic elements in the thin directions in those sections. The second key component is the identification of geometric singular edges and the generation of geometrically graded meshes in the appropriate directions from the edges. Curved local mesh modification operations are applied to ensure the mesh can be curved to the geometry to the required level of geometric approximation.     

Moving curved mesh adaptation for higher-order finite element simulations

Higher-order finite element method requires valid curved meshes in three-dimensional domains to achieve the solution accuracy. When applying adaptive higher-order finite elements in large-scale simulations, complexities that arise include moving the curved mesh adaptation along with the critical domains to achieve computational efficiency. This paper presents a procedure that combines Bézier mesh curving and size-driven mesh adaptation technologies to address those requirements. A moving mesh size field drives a curved mesh modification procedure to generate valid curved meshes that have been successfully analyzed by SLAC National Accelerator Laboratory researchers to simulate the short-range wakefields in particle accelerators. The analysis results for a 8-cavity cryomodule wakefield demonstrate that valid curvilinear meshes not only make the time-domain simulations more reliable, but also improve the computational efficiency up to 30%. The application of moving curved mesh adaptation to an accelerator cavity coupler shows a tenfold reduction in execution time and memory usage without loss in accuracy as compared to uniformly refined meshes.     

Neural classification of finite elements

The work deals with a comparative performance of finite elements, making use of their formulation as vectors (or patterns) in a multi-dimensional space of proper attributes. Since the attributes control the performance, elements defined by similar patterns and related to the same class should show similar behavior. The pattern classification may be carried out with the help a self-organizing feature map of Kohonen with the patterns corresponding to the input space. These networks learn both the distribution and topology of a set of input space. At the end of the learning process, the neurons become selectively tuned to classes of input patterns, thus specifying “family relationships” among the elements. The work makes use of the four attributes: the element dimensionality, its number of nodes, maximum degree of interpolation polynomials and number of degrees of freedom per node, though a more general characterization is also possible.     

Quasi-automatic 3D finite element model generation for individual single-rooted teeth and periodontal ligament

The paper demonstrates how to generate an individual 3D volume model of a human single-rooted tooth using an automatic workflow. It can be implemented into finite element simulation. In several computational steps, computed tomography data of patients are used to obtain the global coordinates of the tooth's surface. First, the large number of geometric data is processed with several self-developed algorithms for a significant reduction. The most important task is to keep geometrical information of the real tooth. The second main part includes the creation of the volume model for tooth and periodontal ligament (PDL). This is realized with a continuous free form surface of the tooth based on the remaining points. Generating such irregular objects for numerical use in biomechanical research normally requires enormous manual effort and time. The finite element mesh of the tooth, consisting of hexahedral elements, is composed of different materials: dentin, PDL and surrounding alveolar bone. It is capable of simulating tooth movement in a finite element analysis and may give valuable information for a clinical approach without the restrictions of tetrahedral elements. The mesh generator of FE software ANSYS executed the mesh process for hexahedral elements successfully.     

Fictitious domain finite element methods using cut elements: I. A stabilized Lagrange multiplier method

We propose a fictitious domain method where the mesh is cut by the boundary. The primal solution is computed only up to the boundary; the solution itself is defined also by nodes outside the domain, but the weak finite element form only involves those parts of the elements that are located inside the domain. The multipliers are defined as being element-wise constant on the whole (including the extension) of the cut elements in the mesh defining the primal variable. Inf–sup stability is obtained by penalizing the jump of the multiplier over element faces. We consider the case of a polygonal domain with possibly curved boundaries. The method has optimal convergence properties.     

A hybrid ant colony optimization approach for finite element mesh decomposition

This paper examines the application of the ant colony optimization algorithm to the partitioning of unstructured adaptive meshes for parallel explicit time-stepping finite element analysis. The concept of the ant colony optimization technique for finding approximate solutions to combinatorial optimization problems is described.The application of ant colony optimization for partitioning finite element meshes based on triangular elements is described.A recursive greedy algorithm optimization method is also presented as a local optimization technique to improve the quality of the solutions given by the ant colony optimization algorithm. The partitioning is based on the recursive bisection approach.The mesh decomposition is carried out using normal and predictive modes for which the predictive mode uses a trained multilayered feed-forward neural network which estimates the number of triangular elements that will be generated after finite elements mesh generation is carried out.The performance of the proposed hybrid approach for the recursive bisection of finite element meshes is examined by decomposing two mesh examples.     

Application of mortar elements to diffuse-interface methods

An adaptive 2D mesh refinement technique based on mortar spectral elements applied to diffuse-interface methods is presented. The refinement algorithm tracks the movement of the 2D diffuse-interface and subsequently refines the mesh locally at that interface, while coarsening the mesh in the rest of the computational domain, based on error estimators. Convergence of the method is validated using a Gaussian distribution problem and results are presented for a Cahn–Hilliard diffuse-interface model applied to capture the transient dynamics of polymer blends.     

Numerical Studies of Adaptive Finite Element Methods for Two Dimensional Convection-Dominated Problems

In this paper, we study the stability and accuracy of adaptive finite element methods for the convection-dominated convection-diffusion-reaction problem in the two-dimension space. Through various numerical examples on a type of layer-adapted grids (Shishkin grids), we show that the mesh adaptivity driven by accuracy alone cannot stabilize the scheme in all cases. Furthermore the numerical approximation is sensitive to the symmetry of the grid in the region where the solution is smooth. On the basis of these two observations, we develop a multilevel-homotopic-adaptive finite element method (MHAFEM) by combining streamline diffusion finite element method, anisotropic mesh adaptation, and the homotopy of the diffusion coefficient. We use numerical experiments to demonstrate that MHAFEM can efficiently capture boundary or interior layers and produce accurate solutions.     

A Moving Grid Finite Element Method for the Simulation of Pattern Generation by Turing Models on Growing Domains

Numerical techniques for moving meshes are many and varied. In this paper we present a novel application of a moving grid finite element method applied to biological problems related to pattern formation where the mesh movement is prescribed through a specific definition to mimic the growth that is observed in nature. Through the use of a moving grid finite element technique, we present numerical computational results illustrating how period doubling behaviour occurs as the domain doubles in size.     

A generalized finite difference method using Coatmèlec lattices

Generalized finite difference methods require that a properly posed set of nodes exists around each node in the mesh, so that the solution for the corresponding multivariate interpolation problem be unique. In this paper we first show that the construction of these meshes can be computerized using a relatively simple algorithm based on the concept of a Coatmèlec lattice. Then, we present a generalized finite difference method which provides a numerical solution of a partial differential equation over an arbitrary domain, using the generated meshes. The accuracy and mesh adaptivity of the method is evaluated using elliptical equations in several domains.     

Parallel adaptive mesh generation

Unstructured meshes have proved to be a powerful tool for adaptive remeshing of finite element idealizations. This paper presents a transputer-based parallel algorithm for two dimensional unstructured mesh generation. A conventional mesh generation algorithm for unstructured meshes is reviewed by the authors, and some program modules of sequential C source code are given. The concept of adaptivity in the finite element method is discussed to establish the connection between unstructured mesh generation and adaptive remeshing.After these primary concepts of unstructured mesh generation and adaptivity have been presented, the scope of the paper is widened to include parallel processing for un-structured mesh generation. The hardware and software used is described and the parallel algorithms are discussed. The Parallel C environment for processor farming is described with reference to the mesh generation problem. The existence of inherent parallelism within the sequential algorithm is identified and a parallel scheme for unstructured mesh generation is formulated. The key parts of the source code for the parallel mesh generation algorithm are given and discussed. Numerical examples giving run times and the consequent “speed-ups” for the parallel code when executed on various numbers of transputers are given. Comparisons between sequential and parallel codes are also given. The “speed-ups” achieved when compared with the sequential code are significant. The “speed-ups” achieved when networking further transputers is not always sustained. It is demonstrated that the consequent “speed-up” depends on parameters relating to the size of the problem.     

Fluid-structure interactions using different mesh motion techniques

In this work, we compare different mesh moving techniques for monolithically-coupled fluid-structure interactions in arbitrary Lagrangian–Eulerian coordinates. The mesh movement is realized by solving an additional partial differential equation of harmonic, linear-elastic, or biharmonic type. We examine an implementation of time discretization that is designed with finite differences. Spatial discretization is based on a Galerkin finite element method. To solve the resulting discrete nonlinear systems, a Newton method with exact Jacobian matrix is used. Our results show that the biharmonic model produces the smoothest meshes but has increased computational cost compared to the other two approaches.