Efficient and low memory strain-rate independent return mapping algorithm for general yield surfaces and stress states
•Return mapping algorithm for arbitrary constraint stress states considering combined isotropic and kinematic hardening and general yield surfaces;•Exact fulfillment of arbitrary stress constraints common in general structural theories;•Development of a explicitly closed-form tangent operator, provi...
Saved in:
| Published in | Advances in engineering software (1992) Vol. 164; p. 103067 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier Ltd
01.02.2022
Elsevier |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0965-9978 1873-5339 |
| DOI | 10.1016/j.advengsoft.2021.103067 |
Cover
| Summary: | •Return mapping algorithm for arbitrary constraint stress states considering combined isotropic and kinematic hardening and general yield surfaces;•Exact fulfillment of arbitrary stress constraints common in general structural theories;•Development of a explicitly closed-form tangent operator, providing quadratic convergence to the local iterative process;•Memory cost and computational time optimization while maintaining a general format.
Structural theories often consider constraints on the stresses, creating a partition into active and fixed components. Sophisticated nonlinear material models are usually described in 3D-continuum form. A reformulation of the material models is then necessary in order to enforce the constraint on the relevant stress components. In this paper, a new strain-rate independent return mapping algorithm is developed in order to deal with arbitrary partitions of the stresses considering general associative elasto-plastic material models. The developed algorithm works directly with the active stress and strain components, satisfying the constraints on the relevant stresses components at each integration point of each element and yielding optimal computational efficiency and memory costs. The tangent operator is obtain in closed-form, providing quadratic convergence to the local iterative process. A comparison of the proposed approach to a previously developed algorithm is made to highlight its properties. |
|---|---|
| ISSN: | 0965-9978 1873-5339 |
| DOI: | 10.1016/j.advengsoft.2021.103067 |