Abstract
AbstractMost devices based on shape memory alloys experience large rotations and moderate or finite strains. This motivates the development of finite‐strain constitutive models together with the appropriate computational counterparts. To this end, in the present paper a three‐dimensional finite‐strain phenomenological constitutive model is investigated and a robust and efficient integration algorithm is proposed. Properly defining the variables, extensively used regularization schemes are avoided and a nucleation–completion criterion is defined. Moreover, introducing a logarithmic mapping, a new form of time‐discrete equations is proposed. The solution algorithm as well as a suitable initial guess for the resultant nonlinear equations are also deeply discussed. Extensive numerical tests are performed to show robustness as well as efficiency of the proposed integration algorithm. Implementation of the integration algorithm within a user‐defined subroutine UMAT in the commercial nonlinear finite element software ABAQUS/Standard makes also possible the solution of a variety of boundary value problems. The obtained results show the efficiency and robustness of the proposed approach and confirm the improved efficiency (in terms of solution CPU time) when a nucleation–completion criterion is used instead of regularization schemes, as well as when a logarithmic mapping is used for the time‐discrete evolution equation instead of an exponential mapping. Copyright © 2010 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
More From: International Journal for Numerical Methods in Engineering
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.