Three-dimensional data transfer operators in large plasticity deformations using modified-SPR technique

In this paper, the data transfer operators are developed in 3D large plasticity deformations using superconvergent patch recovery (SPR) method. The history-dependent nature of plasticity problems necessitates the transfer of all relevant variables from the old mesh to new one, which is performed in three main stages. In the first step, the history-dependent internal variables are transferred from the Gauss points of old mesh to nodal points. The variables are then transferred from nodal points of old mesh to nodal points of new mesh. Finally, the values are computed at the Gauss points of new mesh using their values at nodal points. As the solution procedure, in general, cannot be re-computed from the initial configuration, it is continued from the previously computed state. In particular, the transfer operators are defined for mapping of the state and internal variables between different meshes. Aspects of the transfer operators are presented by fitting the best polynomial function with the C₀, C₁ and C₂ continuity in 3D superconvergent patch recovery technique. Finally, the efficiency of the proposed model and computational algorithms is demonstrated through numerical examples.     

A two‐level variational multiscale method for incompressible flows based on two local Gauss integrations

In this article, a two‐level variational multiscale method for incompressible flows based on two local Gauss integrations is presented. We solve the Navier–Stokes problem on a coarse mesh using finite element variational multiscale method based on two local Gauss integrations, then seek a fine grid solution by solving a linearized problem on a fine grid. In computation, we use the two local Gauss integrations to replace the projection operator without adding any variables. Stability analysis is performed, and error estimates of the method are derived. Finally, a series of numerical experiments are also given, which confirm the theoretical analysis and demonstrate the efficiency of the new method. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Monotone iterative methods for the adaptive finite element solution of semiconductor equations

Picard, Gauss–Seidel, and Jacobi monotone iterative methods are presented and analyzed for the adaptive finite element solution of semiconductor equations in terms of the Slotboom variables. The adaptive meshes are generated by the 1-irregular mesh refinement scheme. Based on these unstructured meshes and a corresponding modification of the Scharfetter–Gummel discretization scheme, it is shown that the resulting finite element stiffness matrix is an M-matrix which together with the Shockley–Read–Hall model for the generation–recombination rate leads to an existence–uniqueness–comparison theorem with simple upper and lower solutions as initial iterates. Numerical results of simulations on a MOSFET device model are given to illustrate the accuracy and efficiency of the adaptive and monotone properties of the present methods.     

A comparison between the material point method and the finite element method in view of extrusion problems

An appropriate method for the simulation of continuous forming processes is the material point method (MPM) [1],[2] which combines the viewpoints of fluid dynamics and solid mechanics. The MPM and related methods [3] are derived from the particle‐in‐cell methods [4]. Bodies are discretised by Lagragian particles with pointwise mass distributions. The differential equations in their weak form are solved on temporary meshes built of standard finite elements. At the end of each time step the particle positions are updated and the mesh is replaced by a new mesh with a regular shape. The state variables at the nodes of the new mesh are extracted from the state variables at the particles by a transfer algorithm. When particles pass element boundaries, numerical difficulties might be observed. These are eliminated by a smooth approximation of nodal data from material point data. The modified MPM has been implemented together with the FEM in one programme because the similarities of the methods outbalance the differences. On the basis of numerical examples the results of both methods are compared. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

High-order adaptive Gegenbauer integral spectral element method for solving non-linear optimal control problems

In this work, we propose an adaptive spectral element algorithm for solving non-linear optimal control problems. The method employs orthogonal collocation at the shifted Gegenbauer–Gauss points combined with very accurate and stable numerical quadratures to fully discretize the multiple-phase integral form of the optimal control problem. The proposed algorithm relies on exploiting the underlying smoothness properties of the solutions for computing approximate solutions efficiently. In particular, the method brackets discontinuities and ‘points of nonsmoothness’ through a novel local adaptive algorithm, which achieves a desired accuracy on the discrete dynamical system equations by adjusting both the mesh size and the degree of the approximating polynomials. A rigorous error analysis of the developed numerical quadratures is presented. Finally, the efficiency of the proposed method is demonstrated on three test examples from the open literature.     

Local a-posteriori error indicators for the Galerkin discretization of boundary integral equations

In this paper we present local a-posteriori error indicators for the Galerkin discretization of boundary integral equations. These error indicators are introduced and investigated by Babuška-Rheinboldt [3] for finite element methods. We transfer them from finite element methods onto boundary element methods and show that they are reliable and efficient for a wide class of integral operators under relatively weak assumptions. These local error indicators are based on the computable residual and can be used for controlling the adaptive mesh refinement. Received March 4, 1996 / Revised version received September 25, 1996     

A shock indicator for adaptive transonic flow computations

Summary An adaptive finite element method for the calculation of transonic potential flows was developed. A residual based error indicator is complemented by a shock indicator. For a good shock resolution mesh refinement as well as moving nodes were needed. An analysis of the method and computational results are given.The research reported in this article was supported by the Deutsche Forschungsgemeinschaft and the Volkswagen-Stiftung     

A new two grid variational multiscale method for steady‐state natural convection problem

A two‐grid variational multiscale method based on two local Gauss integrations for solving the stationary natural convection problem is presented in this article. A significant feature of the method is that we solve the natural convection problem on a coarse mesh using finite element variational multiscale method based on two local Gauss integrations firstly, and then find a fine grid solution by solving a linearized problem on a fine grid. In the computation, we introduce two local Gauss integrations as a stabilizing term to replace the projection operator without adding other variables. The stability estimates and convergence analysis of the new method are derived. Ample numerical experiments are performed to validate the theoretical predictions and demonstrate the efficiency of the new method. Copyright © 2016 John Wiley & Sons, Ltd.     

On regularization in parameter-free shape optimization

This contribution is concerned with a parameter-free approach to computational shape optimization of mechanically-loaded structures. Thereby the term ’parameter-free’ refers to approaches in shape optimization in which the design variables are not derived from an existing CAD-parametrization of the model geometry but rather from its finite element discretization. One of the major challenges in using this type of approach is the avoidance of oscillating boundaries in the optimal design trials. This difficulty is mainly attributed to a lack of smoothness of the objective sensitivities and the relatively high number of design variables within the parameter-free regime. To compensate for these deficiencies, Azegami introduced the concept of the so-called traction method, in which the actual design update is deduced from the deformation of a fictitious continuum that is loaded in proportion to the negative shape gradient. We investigate a discrete variant of the traction method, in which the design sensitivities are computed with respect to variations of the design nodes for a given finite element mesh rather than on the abstract level by means of the speed method. Moreover, the design update process is accompanied by adaptive mesh refinement based on discrete material residual forces. Therein, we consider radaptive node relocation as well as hadaptive mesh refinement. (© 2014 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Adaptive refinement procedure for the finite difference method

An adaptive refinement procedure consisting of a localized error estimator and a physically based approach to mesh refinement is developed for the finite difference method. The error estimator is a variation of a successful finite element error estimator. The errors are estimated by computing an error energy norm in terms of discontinuous and continuous stress fields formed from the finite difference results for plane stress problems. The error measure identifies regions of high error which are subsequently refined to improve the result. The local refinement procedure utilizes a recently developed approach for developing finite difference templates to produce a graduated mesh. The adaptive refinement procedure is demonstrated with a problem that contains a well-defined singularity. The results are compared to finite element and uniformly refined finite difference results.     

An error indicator for parameter identification with stabilized mixed tetrahedrals

The identification of parameters in constitutive laws considering inhomogeneous states of stress and strain is realized by iteratively minimizing a least squares functional. In each iterative step of this optimization problem a finite element analysis is carried out which results in a significant higher numerical cost than a single finite element analysis. Consequently, an efficient discretization is required to keep the numerical cost low. To address this problem an adaptive mesh refinement is considered which is based on a posteriori error indicators [1] leading to refinements appropriate to the parameter identification problem. The goal is to apply the error indicators to the finite element method for tetrahedral elements of low order which are preferable for adaptive mesh refinements and in addition reduce computational effort. Additional stabilization terms in the element formulation [4, 6] reduce volume locking effects making the elements suitable for (nearly) incompressible material behavior. Numerical examples illustrate the progress on this work. (© 2011 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

A gradient model for finite strain elastoplasticity coupled with damage

This paper describes the formulation of an implicit gradient damage model for finite strain elastoplasticity problems including strain softening. The strain softening behavior is modeled through a variant of Lemaitre's damage evolution law. The resulting constitutive equations are intimately coupled with the finite element formulation, in contrast with standard local material models. A 3D finite element including enhanced strains is used with this material model and coupling peculiarities are fully described. The proposed formulation results in an element which possesses spatial position variables, nonlocal damage variables and also enhanced strain variables. Emphasis is put on the exact consistent linearization of the arising discretized equations.

A numerical set of examples comparing the results of local and the gradient formulations relative to the mesh size influence is presented and some examples comparing results from other authors are also presented, illustrating the capabilities of the present proposal.     

Material-Force-Based Refinement Indicators in Adaptive Strategies

A material-force-based refinement indicator for adaptive finite element strategies for finite elasto-plasticity is proposed. Starting from the local format of the spatial balance of linear momentum, a dual material counterpart in terms of Eshelby's energy-momentum tensor is derived. For inelastic problems, this material balance law depends on the material gradient of the internal variables. In a global format the material balance equation coincides with an equilibrium condition of material forces. For a homogeneous body, this condition corresponds to vanishing discrete material nodal forces. However, due to insufficient discretization, spurious material forces occur at the interior nodes of the finite element mesh. These nodal forces are used as an indicator for mesh refinement. Assigning the ideas of elasticity, where material forces have a clear energetic meaning, the magnitude of the discrete nodal forces is used to define a relative global criterion governing the decision on mesh refinement. Following the same reasoning, in a second step a criterion on the element level is computed which governs the local h-adaptive refinement procedure. The mesh refinement is documented for a representative numerical example of finite elasto-plasticity. (© 2006 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Modified Legendre–Gauss–Radau Collocation Method for Optimal Control Problems with Nonsmooth Solutions

A new method is developed for solving optimal control problems whose solutions are nonsmooth. The method developed in this paper employs a modified form of the Legendre–Gauss–Radau orthogonal direct collocation method. This modified Legendre–Gauss–Radau method adds two variables and two constraints at the end of a mesh interval when compared with a previously developed standard Legendre–Gauss–Radau collocation method. The two additional variables are the time at the interface between two mesh intervals and the control at the end of each mesh interval. The two additional constraints are a collocation condition for those differential equations that depend upon the control and an inequality constraint on the control at the endpoint of each mesh interval. The additional constraints modify the search space of the nonlinear programming problem such that an accurate approximation to the location of the nonsmoothness is obtained. The transformed adjoint system of the modified Legendre–Gauss–Radau method is then developed. Using this transformed adjoint system, a method is developed to transform the Lagrange multipliers of the nonlinear programming problem to the costate of the optimal control problem. Furthermore, it is shown that the costate estimate satisfies one of the Weierstrass–Erdmann optimality conditions. Finally, the method developed in this paper is demonstrated on an example whose solution is nonsmooth.

     

A non-local damage approach for the boundary element method

The conventional (local) constitutive modelling of materials exhibiting strain softening behaviour is susceptive to a spurious mesh dependence caused by numerically induced strain localization. Also, for refined meshes, numerical instabilities may be verified, mainly if the simulations are performed by the boundary element method. An alternative to overcome such difficulties is the adoption of the so called non-local constitutive models. In these approaches, some internal variables of the constitutive model in a single point are averaged considering its values of the neighbouring points. In this paper, the implicit formulation of the boundary element method for physically non-linear problems in solid mechanics is used with a non-local isotropic damage model and a very simple averaging scheme, over internal cells, is introduced. It is shown that the analysis become more stable in comparison to the case of a local application of the same model and that the results recover the desired objectiveness to mesh refinement.     

A constrained optimization approach to finite element mesh smoothing

The quality of a finite element solution has been shown to be affected by the quality of the underlying mesh. A poor mesh may lead to unstable and/or inaccurate finite element approximations. Mesh quality is often characterized by the “smoothness” or “shape” of the elements (triangles in 2-D or tetrahedra in 3-D). Most automatic mesh generators produce an initial mesh where the aspect ratio of the elements are unacceptably high. In this paper, a new approach to produce acceptable quality meshes from a topologically valid initial mesh is presented. Given an initial mesh (nodal coordinates and element connectivity), a “smooth” final mesh is obtained by solving a constrained optimization problem. The variables for the iterative optimization procedure are the nodal coordinates (excluding, the boundary nodes) of the finite element mesh, and appropriate bounds are imposed on these to prevent an unacceptable finite element mesh. Examples are given of the application of the above method for 2- and 3-D meshes generated using automatic mesh generators. Results indicate that the new method not only yields better quality elements when compared with the traditional Laplacian smoothing, but also guarantees a valid mesh unlike the Laplacian method.     

A Regularized Newton-Like Method for Nonlinear PDE

An adaptive regularization strategy for stabilizing Newton-like iterations on a coarse mesh is developed in the context of adaptive finite element methods for nonlinear PDE. Existence, uniqueness and approximation properties are known for finite element solutions of quasilinear problems assuming the initial mesh is fine enough. Here, an adaptive method is started on a coarse mesh where the finite element discretization and quadrature error produce a sequence of approximate problems with indefinite and ill-conditioned Jacobians. The methods of Tikhonov regularization and pseudo-transient continuation are related and used to define a regularized iteration using a positive semidefinite penalty term. The regularization matrix is adapted with the mesh refinements and its scaling is adapted with the iterations to find an approximate sequence of coarse-mesh solutions leading to an efficient approximation of the PDE solution. Local q-linear convergence is shown for the error and the residual in the asymptotic regime and numerical examples of a model problem illustrate distinct phases of the solution process and support the convergence theory.     

An interface-fitted adaptive mesh method for elliptic problems and its application in free interface problems with surface tension

This work presents a novel two-dimensional interface-fitted adaptive mesh method to solve elliptic problems of jump conditions across the interface, and its application in free interface problems with surface tension. The interface-fitted mesh is achieved by two operations: (i) the projection of mesh nodes onto the interface and (ii) the insertion of mesh nodes right on the interface. The interface-fitting technique is combined with an existing adaptive mesh approach which uses addition/subtraction and displacement of mesh nodes. We develop a simple piecewise linear finite element method built on this interface-fitted mesh and prove its almost optimal convergence for elliptic problems with jump conditions across the interface. Applications to two free interface problems, a sheared drop in Stokes flow and the growth of a solid tumor, are presented. In these applications, the interface surface tension serves as the jump condition or the Dirichlet boundary condition of the pressure, and the pressure is solved with the interface-fitted finite element method developed in this work. In this study, a level-set function is used to capture the evolution of the interface and provide the interface location for the interface fitting.     

Parallel anisotropic mesh adaptivity with dynamic load balancing for cardiac electrophysiology

Simulations in cardiac electrophysiology generally use very fine meshes and small time steps to resolve highly localized wavefronts. This expense motivates the use of mesh adaptivity, which has been demonstrated to reduce the overall computational load. However, even with mesh adaptivity performing such simulations on a single processor is infeasible. Therefore, the adaptivity algorithm must be parallelised. Rather than modifying the sequential adaptive algorithm, the parallel mesh adaptivity method introduced in this paper focuses on dynamic load balancing in response to the local refinement and coarsening of the mesh. In essence, the mesh partition boundary is perturbed away from mesh regions of high relative error, while also balancing the computational load across processes. The parallel scaling of the method when applied to physiologically realistic heart meshes is shown to be good as long as there are enough mesh nodes to distribute over the available parallel processes. It is shown that the new method is dominated by the cost of the sequential adaptive mesh procedure and that the parallel overhead of inter-process data migration represents only a small fraction of the overall cost.     

Parallel multi-frontal solver for p adaptive finite element modeling of multi-physics computational problems

The paper presents a parallel direct solver for multi-physics problems. The solver is dedicated for solving problems resulting from adaptive finite element method computations. The concept of finite element is actually replaced by the concept of the node. The computational mesh consists of several nodes, related to element vertices, edges, faces and interiors. The ordering of unknowns in the solver is performed on the level of nodes. The concept of the node can be efficiently utilized in order to recognize unknowns that can be eliminated at a given node of the elimination tree. The solver is tested on the exemplary three-dimensional multi-physics problem involving the computations of the linear acoustics coupled with linear elasticity. The three-dimensional tetrahedral mesh generation and the solver algorithm are modeled by using graph grammar formalism. The execution time and the memory usage of the solver are compared with the MUMPS solver.