A computational algorithm for solving anelastic problems in finite deformations is introduced. The presented procedure, termed the Generalised Plasticity Algorithm (GPA) hereafter, takes inspiration from the Return Mapping Algorithm (RMA), which is typically employed to solve the Karush-Kuhn-Tucker (KKT) system arising in finite elastoplasticity, but aims to modify and extend the RMA to the case of more general flow rules and strain energy density functions as well as to non-classical formulations of elastoplasticity, in which the plastic variables are not treated as internal variables. To assess its reliability, the GPA is tested in two different contexts. First, it is used for solving two classical problems (a shear-compression test and the necking of a circular bar). In both cases, the GPA is compared with the RMA in terms of structural set-up, computational effort and flexibility, and its convergence is evaluated by solving several benchmarks. Some restrictions of the classical form of the RMA are pointed out, and it is shown how these can be overcome by adopting the proposed algorithm. Second, the GPA is applied to characterise the mechanical response of a biological tissue that undergoes large deformations and remodelling of its internal structure.
Bibliographical notePublisher Copyright:
© SAGE Publications.
- Finite strain elastoplasticity
- Generalised Plasticity Algorithm
- Return Mapping Algorithm
ASJC Scopus subject areas
- Materials Science(all)
- Mechanics of Materials