No Arabic abstract
In order to accelerate implementation of hyperelastic materials for finite element analysis, we developed an automatic numerical algorithm that only requires the strain energy function. This saves the effort on analytical derivation and coding of stress and tangent modulus, which is time-consuming and prone to human errors. Using the one-sided Newton difference quotients, the proposed algorithm first perturbs deformation gradients and calculate the difference on strain energy to approximate stress. Then, we perturb again to get difference in stress to approximate tangent modulus. Accuracy of the approximations were evaluated across the perturbation parameter space, where we find the optimal amount of perturbation being $10^{-6}$ to obtain stress and $10^{-4}$ to obtain tangent modulus. Single element verification in ABAQUS with Neo-Hookean material resulted in a small stress error of only $7times10^{-5}$ on average across uniaxial compression and tension, biaxial tension and simple shear situations. A full 3D model with Holzapfel anisotropic material for artery inflation generated a small relative error of $4times10^{-6}$ for inflated radius at $25 kPa$ pressure. Results of the verification tests suggest that the proposed numerical method has good accuracy and convergence performance, therefore a good material implementation algorithm in small scale models and a useful debugging tool for large scale models.
FEpX is a modeling framework for computing the elastoplastic deformations of polycrystalline solids. Using the framework, one can simulate the mechanical behavior of aggregates of crystals, referred to as virtual polycrystals, over large strain deformation paths. This article presents the theory, the finite element formulation, and important features of the numerical implementation that collectively define the modeling framework. The article also provides several examples of simulating the elastoplastic behavior of polycrystalline solids to illustrate possible applications of the framework. There is an associated finite element code, also referred to as FEpX, that is based on the framework presented here and was used to perform the simulations presented in the examples. The article serves as a citable reference for the modeling framework for users of that code. Specific information about the formats of the input and output data, the code architecture, and the code archive are contained in other documents.
We present a novel method for finite element analysis of inelastic structures containing Shape Memory Alloys (SMAs). Phenomenological constitutive models for SMAs lead to material nonlinearities, that require substantial computational effort to resolve. Finite element analysis methods, which rely on Gauss quadrature integration schemes, must solve two sets of coupled differential equations: one at the global level and the other at the local, i.e. Gauss point level. In contrast to the conventional return mapping algorithm, which solves these two sets of coupled differential equations separately using a nested Newton procedure, we propose a scheme to solve the local and global differential equations simultaneously. In the process we also derive closed-form expressions used to update the internal state variables, and unify the popular closest-point and cutting plane methods with our formulas. Numerical testing indicates that our method allows for larger thermomechanical loading steps and provides increased computational efficiency, over the standard return mapping algorithm.
Derivatives play a critical role in computational statistics, examples being Bayesian inference using Hamiltonian Monte Carlo sampling and the training of neural networks. Automatic differentiation is a powerful tool to automate the calculation of derivatives and is preferable to more traditional methods, especially when differentiating complex algorithms and mathematical functions. The implementation of automatic differentiation however requires some care to insure efficiency. Modern differentiation packages deploy a broad range of computational techniques to improve applicability, run time, and memory management. Among these techniques are operation overloading, region based memory, and expression templates. There also exist several mathematical techniques which can yield high performance gains when applied to complex algorithms. For example, semi-analytical derivatives can reduce by orders of magnitude the runtime required to numerically solve and differentiate an algebraic equation. Open problems include the extension of current packages to provide more specialized routines, and efficient methods to perform higher-order differentiation.
Capturing the interaction between objects that have an extreme difference in Young s modulus or geometrical scale is a highly challenging topic for numerical simulation. One of the fundamental questions is how to build an accurate multi-scale method with optimal computational efficiency. In this work, we develop a material-point-spheropolygon discrete element method (MPM-SDEM). Our approach fully couples the material point method (MPM) and the spheropolygon discrete element method (SDEM) through the exchange of contact force information. It combines the advantage of MPM for accurately simulating elastoplastic continuum materials and the high efficiency of DEM for calculating the Newtonian dynamics of discrete near-rigid objects. The MPM-SDEM framework is demonstrated with an explicit time integration scheme. Its accuracy and efficiency are further analysed against the analytical and experimental data. Results demonstrate this method could accurately capture the contact force and momentum exchange between materials while maintaining favourable computational stability and efficiency. Our framework exhibits great potential in the analysis of multi-scale, multi-physics phenomena
Algorithm NCL is designed for general smooth optimization problems where first and second derivatives are available, including problems whose constraints may not be linearly independent at a solution (i.e., do not satisfy the LICQ). It is equivalent to the LANCELOT augmented Lagrangian method, reformulated as a short sequence of nonlinearly constrained subproblems that can be solved efficiently by IPOPT and KNITRO, with warm starts on each subproblem. We give numerical results from a Julia implementation of Algorithm NCL on tax policy models that do not satisfy the LICQ, and on nonlinear least-squares problems and general problems from the CUTEst test set.