Dimension extending technique for constitutive integration of plasticity with hardening–softening behaviors
Existence and uniqueness of solution of constitutive integration of non-associative plasticity has been an open issue until it was partly solved in Zheng et al. (2020), where the constitutive integration of elastic-perfect plasticity is reduced to a Mixed Complementarity Problem (MiCP), a special ca...
Uloženo v:
| Vydáno v: | Computer methods in applied mechanics and engineering Ročník 394; s. 114833 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Amsterdam
Elsevier B.V
01.05.2022
Elsevier BV |
| Témata: | |
| ISSN: | 0045-7825 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | Existence and uniqueness of solution of constitutive integration of non-associative plasticity has been an open issue until it was partly solved in Zheng et al. (2020), where the constitutive integration of elastic-perfect plasticity is reduced to a Mixed Complementarity Problem (MiCP), a special case of finite-dimensional variational inequalities, and the qualitative properties of the MiCP have been well established even for non-smooth yield surfaces and non-associated flow rules. The algorithm for the MiCP, called GSPC, has been proved globally convergent. In order to handle plasticity with hardening and softening behaviors, hardening functions are deemed the same position as stress components. In this way, hardening/softening plasticity reduces to elastic-perfect plasticity, and the GSPC is ideally suited to hardening/softening plasticity with no need to revise. The application of the proposed procedure to the Modified Cam-Clay plasticity is demonstrated. Comparisons are made with the return mapping (R-M) algorithm, indicating that those examples causing R-M to fail to converge can be easily solved using GSPC.
•Dimension extending technique reduces hardening/softening plasticity to perfect.•Algorithm GSPC is convergent even for non-associated flow rules and softening.•Some examples causing conventional algorithms to fail can be solved by GSPC. |
|---|---|
| Bibliografie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0045-7825 |
| DOI: | 10.1016/j.cma.2022.114833 |