Abstract

SUMMARYAnalogously to the classical return‐mapping algorithm, so‐called variational constitutive updates are numerical methods allowing to compute the unknown state variables such as the plastic strains and the stresses for material models showing an irreversible mechanical response. In sharp contrast to standard approaches in computational inelasticity, the state variables follow naturally and jointly from energy minimization in case of variational constitutive updates. This leads to significant advantages from a numerical, mathematical as well as from a physical point of view. However, while the classical return‐mapping algorithm has been being developed for several decades, and thus, it has already reached a certain maturity, variational constitutive updates have drawn attention only relatively recently. This is particularly manifested in the numerical performance of such algorithms. Within the present paper, the numerical efficiency of variational constitutive updates is critically analyzed. It will be shown that a naive approximation of the flow rule causes a singular Hessian within the respective Newton–Raphson scheme. However, by developing a novel parameterization of the flow rule, an efficient algorithm is derived. Its performance is carefully compared to that of the classical return‐mapping scheme. This comparison clearly shows that the novel variationally consistent implementation is, at least, as efficient as the classical return‐mapping algorithm. Copyright © 2011 John Wiley & Sons, Ltd.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.