On structural shape optimization using an embedding domain discretization technique

This contribution presents a novel approach to structural shape optimization that relies on an embedding domain discretization technique. The evolving shape design is embedded within a uniform finite element background mesh which is then used for the solution of the physical state problem throughout the course of the optimization. We consider a boundary tracking procedure based on adaptive mesh refinement to separate between interior elements, exterior elements, and elements intersected by the physical domain boundary. A selective domain integration procedure is employed to account for the geometric mismatch between the uniform embedding domain discretization and the evolving structural component. Thereby, we avoid the need to provide a finite element mesh that conforms to the structural component for every design iteration, as it is the case for a standard Lagrangian approach to structural shape optimization. Still, we adopt an explicit shape parametrization that allows for a direct manipulation of boundary vertices for the design evolution process. In order to avoid irregular and impracticable design updates, we consider a geometric regularization technique to render feasible descent directions for the course of the optimization. Copyright © 2016 John Wiley & Sons, Ltd.     

CALCULATION OF THE STRESS INTENSITY FACTOR AND ESTIMATION OF ITS ERROR BY A SHAPE SENSITIVITY ANALYSIS

Abstract— The precision with which the stress intensity factor (SIF) can be calculated from a finite element solution depends essentially on the extraction method and on the discretization error. In this paper, the influence of the discretization error in the SIF calculation was studied and a method for estimating the resulting error was developed. The SIF calculation method used is based on a shape design sensitivity analysis; this assures that the resulting error in the extracted SIF depends solely on the global discretization error present in the finite element solution. Moreover, this method allows us to extend the Zienkiewicz-Zhu discretization error estimator to the SIF calculation. The reliability of the proposed method was analysed solving a two-dimensional problem using an h -adaptive process. Also the convergence of the error with the h -adaptive refinement was studied.     

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.     

An automatic adaptive refinement procedure using triangular and quadrilateral meshes

An automatic adaptive refinement procedure for finite element analysis for two-dimensional stress analysis problems is presented. Through the combined use of the new mesh generator developed by the authors (to appear) for adaptive mesh generation and the Zienkiewicz-Zhu [Int. J. numer. Meth. Engng31, 1331–1382 (1992)] error estimator based on the superconvergent patch recovery technique, an adaptive refinement procedure can be formulated which can achieve the aimed accuracy very economically in one or two refinement steps. A simple method is also proposed to locate the existence and the position of singularities in the problem domain. Hence, little or no a priori knowledge about the location and strength of the singularities is required. The entire adaptive refinement procedure has been made fully automatic and no user intervention during successive cycles of mesh refinements is needed. The robustness and reliability of the refinement procedure have been tested by solving difficult practical problems involving complex domain geometry with many singularities. We found that in all the examples studied, regardless of the types of meshes employed, triangular and quadrilateral meshes, nearly optimal overall convergence rate is always achieved.     

Closed form stiffness matrices and error estimators for plane hierarchic triangular elements

Closed form expressions for the stiffness matrix and a simple error estimator and error indicator are derived for plane straight sided triangular finite elements in elasticity problems. The calculation of the error estimator is performed on an element by element basis, and is found to be very accurate and efficient. In general, the solutions for benchmark problems using the error indicators for selective refinement of the regions show accelerated convergence when compared to the convergence rate of solutions using uniform mesh refinement. Evaluation of the stiffness matrices and error estimators using explicit formulations is found to be several times faster than numerical integration.     

New a posteriori error estimator and adaptive mesh refinement strategy for 2-D crack problems

A posteriori error estimation and adaptive refinement technique for fracture analysis of 2-D/3-D crack problems is the state-of-the-art. The objective of the present paper is to propose a new a posteriori error estimator based on strain energy release rate (SERR) or stress intensity factor (SIF) at the crack tip region and to use this along with the stress based error estimator available in the literature for the region away from the crack tip. The proposed a posteriori error estimator is called the K-S error estimator. Further, an adaptive mesh refinement (h-) strategy which can be used with K-S error estimator has been proposed for fracture analysis of 2-D crack problems. The performance of the proposed a posteriori error estimator and the h-adaptive refinement strategy have been demonstrated by employing the 4-noded, 8-noded and 9-noded plane stress finite elements. The proposed error estimator together with the h-adaptive refinement strategy will facilitate automation of fracture analysis process to provide reliable solutions.     

An adaptive finite element approach for frictionless contact problems

The derivation of an a posteriori error estimator for frictionless contact problems under the hypotheses of linear elastic behaviour and infinitesimal deformation is presented. The approximated solution of this problem is obtained by using the finite element method. A penalization or augmented‐Lagrangian technique is used to deal with the unilateral boundary condition over the contact boundary. An a posteriori error estimator suitable for adaptive mesh refinement in this problem is proposed, together with its mathematical justification. Up to the present time, this mathematical proof is restricted to the penalization approach. Several numerical results are reported in order to corroborate the applicability of this estimator and to compare it with other a posteriori error estimators. Copyright © 2001 John Wiley & Sons, Ltd.     

Mesh refinement and iterative solution methods for finite element computations

Global and element residuals are introduced to determine a posteriori, computable, error bounds for finite element computations on a given mesh. The element residuals provide a criterion for determining where a finite element mesh requires refinement. This indicator is implemented in an algorithm in a finite element research program. There it is utilized to automatically refine the mesh for sample two-point problems exhibiting boundary layer and interior layer solutions. Results for both linear and nonlinear problems are presented. An important aspect of this investigation concerns the use of adaptive refinement in conjunction with iterative methods for system solution. As the mesh is being enriched through the refinement process, the solution on a given mesh provides an accurate starting iterate for the next mesh, and so on. A wide range of iterative methods are examined in a feasibility study and strategies for interweaving refinement and iteration are compared.     

Automatic adaptive refinement for plate bending problems using Reissner–Mindlin plate bending elements

The influence of the presence of singular points and boundary layers associated with the edge effects in a Reissner–Mindlin (RM) plate in the design of an optimal mesh for a finite element solution is studied, and methods for controlling the discretization error of the solution are suggested. An effective adaptive refinement strategy for the solution of plate bending problems based on the RM plate bending model is developed. This two-stage adaptive strategy is designed to control both the total and the shear error norms of a plate in which both singular points and boundary layers are present. A series of three different order assumed strain RM plate bending elements has been used in the adaptive refinement procedure. The locations of optimal sampling points and the effect of element shape distortions on the theoretical convergence rate of these elements are given and discussed. Numerical experiments show that the suggested refinement procedure is effective and that optimally refined meshes can be generated. It is also found that all the plate bending elements used can attain their full convergence rates regardless of the presence of singular points and boundary layers inside the problem domain. Boundary layer effects are well captured in all the examples tested and the use of a second stage of refinement to control the shear error is justified. In addition, tests on the Zienkiewicz–Zhu error estimator show that their performances are satisfactory. Finally, tests of the relative effectiveness of the plate bending elements used have also been made and it is found that while the higher order cubic element is the most accurate element tested, the quadratic element tested is the most efficient one in terms of CPU time used. © 1998 John Wiley & Sons, Ltd.     

Unification of parametric and implicit methods for shape sensitivity analysis and optimization with fixed mesh

Parametric and implicit methods are traditionally thought to be two irrelevant approaches in structural shape optimization. Parametric method works as a Lagrangian approach and often uses the parametric boundary representation (B‐rep) of curves/surfaces, for example, Bezier and B‐splines in combination with the conformal mesh of a finite element model, while implicit method relies upon level‐set functions, that is, implicit functions for B‐rep, and works as an Eulerian approach in combination with the fixed mesh within the scope of extended finite element method or finite cell method. The original contribution of this work is the unification of both methods. First, a new shape optimization method is proposed by combining the features of the parametric and implicit B‐reps. Shape changes of the structural boundary are governed by parametric B‐rep on the fixed mesh to maintain the merit in computer‐aided design modeling and avoid laborious remeshing. Second, analytical shape design sensitivity is formulated for the parametric B‐rep in the framework of fixed mesh of finite cell method by means of the Hamilton–Jacobi equation. Numerical examples are solved to illustrate the unified methodology. Copyright © 2016 John Wiley & Sons, Ltd.     

An automatic adaptive refinement finite element procedure for 2D elastostatic analysis

An automatic adaptive refinement procedure for finite element analysis is presented. The procedure is applied to two-dimensional elastostatic problems to obtain solutions of prescribed accuracy. Through the combined use of new mesh generator using contour developed by Lo¹ and the concept of strain energy concentration, high-quality graded finite element meshes are generated. The whole process is fully automatic and no user intervention is required during the successive cycles of the mesh refinements. The Zienkiewicz and Zhu² error estimator is found to be effective and has been adopted for the present implementation. In the numerical examples tested, the error estimator gives an accurate error norm estimation and the effectivity index of the estimator converges to a value close to unity.     

A contribution to error estimation and mapping algorithms for a hierarchical adaptive FE-strategy in finite elastoplasticity

The aim of this contribution is the presentation of an adaptive finite element procedure for the solution of geometrically and physically non-linear problems in structural mechanics. Within this context, the attention is mainly directed on the error estimation and hierarchical strategies for mesh refinement and coarsening in the case of finite elasto-plastic deformations. An important but sensitive aspect of adaptation approaches of the space discretization is the calculation of mechanical field variables for the modified mesh. Procedures of mesh refinement and coarsening imply the determination of strains, stresses and internal variables at the nodes and the Gauss points of new elements based on the transfer of the required data from the former mesh. In order to improve the efficiency as well as the convergence behaviour of the adaptive FE process an approach of data transfer primarily related to nodal values is presented. It is characterized by solving the initial value problem not only at the Gauss points but additionally at the nodes of the elements.     

A scaled boundary finite element based explicit topology optimization approach for three-dimensional structures

This article proposes an efficient approach for solving three-dimensional (3D) topology optimization problem. In this approach, the number of design variables in optimization as well as the number of degrees of freedom in structural response analysis can be reduced significantly. This is accomplished through the use of scaled boundary finite element method (SBFEM) for structural analysis under the moving morphable component (MMC)-based topology optimization framework. In the proposed method, accurate response analysis in the boundary region dictates the accuracy of the entire analysis. In this regard, an adaptive refinement scheme is developed where the refined mesh is only used in the boundary region while relating coarse mesh is used away from the boundary. Numerical examples demonstrate that the computational efficiency of 3D topology optimization can be improved effectively by the proposed approach.     

On variational sensitivity analysis and configurational mechanics

This contribution is concerned with the application of variational design sensitivity analysis in the context of structural optimization and configurational mechanics. In both disciplines we consider variations of the material configuration and we use techniques from variational sensitivity analysis in order to solve these problems. We derive the physical and material residual problem in one step by using standard optimization procedures. Furthermore, we investigate the sensitivity of the physical as well as the material residual problem and obtain the coupled saddle point problem based on these sensitivities. Both problems are coupled by the pseudo load operator, which plays an important role by the solution of structural optimization problems. By means of computational examples from mesh optimization and shape optimization, we demonstrate the capability of the proposed theoretical framework.     

Adaptive finite element analysis of mixed‐mode crack problems with automatic mesh generator

Fully automatic advancing front type mesh generator to take care of crack and fracture problems has been presented. It is coupled with Zienkiewicz and Zhu error estimator, the refinement methodology depends on the concept of strain energy concentration for adaptive analysis of mixed‐mode crack problems. No investigation is reported in this direction so far. It has been found that the above combination proved to be very powerful for adaptive finite element analysis of mixed‐mode crack problems in two‐dimensional isotropic solids. Very accurate stress intensity factors have been obtained for a target error of 10 per cent with a minimum number of steps. Copyright © 2000 John Wiley & Sons, Ltd.     

An adaptive multigrid technique for three-dimensional elasticity

A program for finite element analysis of 3D linear elasticity problems is described. The program uses quadratic hexahedral elements. The solution process starts on an initial coarse mesh; here error estimators are determined by the standard Babu?ka-Rheinboldt method and local refinement is performed by partitioning of indicated elements, each hexahedron into eight new elements. Then the discrete problem is solved on the second mesh and the refinement process proceeds in the following way-on the ith mesh only the elements caused by refinement on the (i-1)th mesh can be refined. The control of refinement is the task of the user because the dimension of the discrete problem grows very rapidly in 3D. The discrete problem is being solved by the frontal solution method on the initial mesh and by a newly developed and very efficient local multigrid method on the refined meshes. The program can be successfully used for solving problems with structural singularities, such as re-entrant corners and moving boundary conditions. A numerical example shows that such problems are solved with the same efficiency as regular problems.     

Adaptive mesh refinement of the boundary element method for potential problems by using mesh sensitivities as error indicators

This paper presents a novel method for error estimation and h-version adaptive mesh refinement for potential problems which are solved by the boundary element method (BEM). Special sensitivities, denoted as mesh sensitivities, are used to evaluate a posteriori error indicators for each element, and a global error estimator. A mesh sensitivity is the sensitivity of a physical quantity at a boundary node with respect to perturbation of the mesh. The element error indicators for all the elements can be evaluated from these mesh sensitivities. Mesh refinement can then be performed by using these element error indicators as guides.The method presented here is suitable for both potential and elastostatics problems, and can be applied for adaptive mesh refinement with either linear or quadratic boundary elements. For potential problems, the physical quantities are potential and/or flux; for elastostatics problems, the physical quantities are tractions/displacements (or tangential derivatives of displacements). In this paper, the focus is on potential problems with linear elements, and the proposed method is validated with two illustrative examples. However, it is easy to extend these ideas to elastostatics problems and to quadratic elements.The computing for this research has been supported by the Cornell National Supercomputer Facility.     

Material state remapping in computational solid mechanics

A computational procedure for remapping material state information from one finite element mesh to another is described. The procedure is useful in connection with evolving meshes for inelastic problems, as for example occur in the context of fracture simulation and adaptive mesh refinement. The proposed method is based on weak enforcement of equality between corresponding fields on the two meshes, where piecewise‐constant fields on both meshes are generalized from the quadrature‐point values. The essential algorithmic problem is that of calculating the volume partition of an arbitrary convex region with respect to a covering set of disjoint convex regions. Instead of geometrically resolving the associated intersections, the problem is herein approximated by a constrained optimization problem, which may be readily and efficiently solved computationally. This formulation is a main contribution of the paper. Computational examples are given that illustrate the effectiveness of the proposed procedure. Copyright © 2002 John Wiley & Sons, Ltd.     

Voxel‐based meshing and unit‐cell analysis of textile composites

Unit‐cell homogenization techniques are frequently used together with the finite element method to compute effective mechanical properties for a wide range of different composites and heterogeneous materials systems. For systems with very complicated material arrangements, mesh generation can be a considerable obstacle to usage of these techniques. In this work, pixel‐based (2D) and voxel‐based (3D) meshing concepts borrowed from image processing are thus developed and employed to construct the finite element models used in computing the micro‐scale stress and strain fields in the composite. The potential advantage of these techniques is that generation of unit‐cell models can be automated, thus requiring far less human time than traditional finite element models. Essential ideas and algorithms for implementation of proposed techniques are presented. In addition, a new error estimator based on sensitivity of virtual strain energy to mesh refinement is presented and applied. The computational costs and rate of convergence for the proposed methods are presented for three different mesh‐refinement algorithms: uniform refinement; selective refinement based on material boundary resolution; and adaptive refinement based on error estimation. Copyright © 2003 John Wiley & Sons, Ltd.     

Adaptive Poly-FEM for the analysis of plane elasticity problems

In this work, we present an adaptive polygonal finite element method (Poly-FEM) for the analysis of two-dimensional plane elasticity problems. The generation of meshes consisting of n ? sided polygonal finite elements is based on the generation of a centroidal Voronoi tessellation (CVT). An unstructured tessellation of a scattered point set, that minimally covers the proximal space around each point in the point set, is generated whereby the method also includes tessellation of nonconvex domains. In this work, we propose a region by region adaptive polygonal element mesh generation. A patch recovery type of stress smoothing technique that utilizes polygonal element patches for obtaining smooth stresses is proposed for obtaining the smoothed finite element stresses. A recovery type a ? posteriori error estimator that estimates the energy norm of the error from the recovered solution is then adopted for the Poly-FEM. The refinement of the polygonal elements is then made on an region by region basis through a refinement index. For the numerical integration of the Galerkin weak form over polygonal finite element domains, we resort to classical Gaussian quadrature applied to triangular subdomains of each polygonal element. Numerical examples of two-dimensional plane elasticity problems are presented to demonstrate the efficiency of the proposed adaptive Poly-FEM.