On the robustness and efficiency of integration algorithms for a 3D finite strain phenomenological SMA constitutive model
Most 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 pheno...
Gespeichert in:
Veröffentlicht in: | International journal for numerical methods in engineering 2011-01, Vol.85 (1), p.107-134 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Most 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. |
---|---|
ISSN: | 0029-5981 1097-0207 1097-0207 |
DOI: | 10.1002/nme.2964 |