A robust explicit integration of elasto-plastic constitutive models, based on simple subincrement size estimation. Issue 6 (7th August 2017)

• Record Type: Journal Article
• Authors: Halilovic, Miroslav; Starman, Bojan; Vrh, Marko; Stok, Boris
• Is Part Of: Engineering computations. Volume 34:Issue 6(2017)
• Page Start: 1774
• Page End: 1806
• Publication Date: 2017-08-07
• Subjects: Constitutive equations -- Drift correction -- Elasto-plasticity -- Error control -- Substepping algorithm; Computer-aided engineering -- Periodicals; Computer graphics -- Periodicals; 620.00285
• DOI: 10.1108/EC-03-2016-0103
• Languages: English
• ISSNs: 0264-4401

Abstract

Abstract : Purpose: The purpose of this study, which is designed for the implementation of models in the implicit finite element framework, is to propose a robust, stable and efficient explicit integration algorithm for rate-independent elasto-plastic constitutive models. Design/methodology/approach: The proposed automatic substepping algorithm is founded on an explicit integration scheme. The estimation of the maximal subincrement size is based on the stability analysis. Findings: In contrast to other explicit substepping schemes, the algorithm is self-correcting by definition and generates no cumulative drift. Although the integration proceeds with maximal possible subincrements, high level of accuracy is attained. Algorithmic tangent stiffness is calculated in explicit form and optionally no analytical second-order derivatives are needed. Research limitations/implications: The algorithm is convenient for elasto-plastic constitutive models, described with an algebraic constraint and a set of differential equations. This covers a large family of materials in the field of metal plasticity, damage mechanics, etc. However, it cannot be directly used for a general material model, because the presented algorithm is convenient for solving a set of equations of a particular type. Practical implications: The estimation of the maximal stable subincrement size is computationally cheap. All expressions in the algorithm are in explicit form, thus the implementation is simple and straightforward. The overall performance of the approach (i.e. accuracy, time consumption) is fully comparable with a default (built-in) ABAQUS/Standard algorithm. Originality/value: The estimated maximal subincrement size enables the algorithm to be stable by definition. Subincrements are much larger than those in conventional substepping algorithms. No error control, error correction or local iterations are required even in the case of large increments.