×

zbMATH — the first resource for mathematics

A return mapping algorithm for plane stress elastoplasticity. (English) Zbl 0585.73059
Summary: An unconditionally stable algorithm for plane stress elastoplasticity is developed, based upon the notion of elastic predictor-return mapping (plastic corrector). Enforcement of the consistency condition is shown to reduce to the solution of a simple nonlinear equation. Consistent elastoplastic moduli are obtained by exact linearization of the algorithm. Use of these moduli is essential in order to preserve the asymptotic rate of quadratic convergence of Newton methods. The accuracy of the algorithm is assessed by means of iso-error maps. The excellent performance of the algorithm for large time steps is illustrated in numerical experiments.

MSC:
74S30 Other numerical methods in solid mechanics (MSC2010)
74-04 Software, source code, etc. for problems pertaining to mechanics of deformable solids
74C99 Plastic materials, materials of stress-rate and internal-variable type
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] ’Calculation of elastic-plastic flow’, in Methods of Computational Physics 3 ( et al., Eds.), Academic Press, New York. 1964.
[2] and , ’Implementation of a time dependent plasticity theory into structural computer programs’, in Constitutive Equations in Viscoplasticity: Computational and Engineering Aspects, ( and , Eds.), AMD-20, ASME, New York, 1976, pp. 125-137.
[3] Krieg, J. Pressure Vessel Tech., ASME 99 (1977)
[4] Schreyer, J. Pressure Vessel Tech., ASME 101 (1979)
[5] and , ’OTHERCIT’, preprint (1983).
[6] Sandler, J. Geotech. Eng. Div. 3 pp 173– (1979)
[7] ’Topics in constitutive theory for inelastic solids’, Ph.D. dissert., Dept. of Civil Engineering, Univ. of California, Berkeley (1981).
[8] Moss, Int. j. numer. methods eng. 20 pp 1703– (1984)
[9] Simo, Comp. Meth. Appl. Mech. Eng. 49 pp 221–
[10] Simo, Mech. Mater. (1985)
[11] Argyris, Comp. Meth. Appl. Mech. Eng. 17/18 pp 341– (1979)
[12] Ortiz, Int. j. numer. methods eng. 21 pp 1561– (1985)
[13] ’NIKE2D: a vectorized, implicit, finite deformation finite element code for analyzing the static and dynamic response of 2-D solids’, Rep. UCID-19677, Univ. of California, Lawrence Livermore National Laboratory (1984).
[14] Marques, Eng. Comp. 1 pp 42– (1984)
[15] The Finite Element Method, Third Edition, McGraw-Hill, 1977.
[16] Private communication (1985).
[17] Hallquist, Implemention of a modified Hughes-Liu shell into a fully vectorized explicit finite element code (1985)
[18] and , ’Computational fracture mechanics’, Proc. Symp. Numer. Comp. Meths. Struct. Mech. (Ed.), Urbana IL, (1971) Academic Press, New York, 1973.
[19] Hughes, Comp. Struct. 8 pp 169– (1978)
[20] Simo, Comp. Meth. Appl. Mech. Eng. 48 pp 101– (1985)
[21] and , Finite Elements in Plasticity: Theory and Practice, Pineridge Press, Swansea, Wales, 1980. · Zbl 0482.73051
[22] ’Analysis of transient algorithms with particular emphasis in stability behaviour’, in Computational Methods for Transient Analysis, ( and , Eds.) North-Holland, Amsterdam, 1983.
[23] Chorin, Commun. Pure Appl. Math. 31 pp 205– (1978)
[24] Iwan, J. Ing.-Mech., ASCE 109 pp 231– (1983)
[25] Ortiz, Int. j. numer. methods eng. 23 pp 353– (1986)
[26] and , Numerical Methods for Unconstrained Optimization, Prentice-Hall, Englewood Cliffs, N.J., 1983.
[27] Linear and Nonlinear Programming, 2nd edn, Addison-Wesley, Reading, Mass., 1984.
[28] Matthies, Int. j. numer. methods. eng. 14 pp 1613– (1979)
[29] ’Numerical implementation of constitutive models: rate-independent deviatoric plasticity’, Workshop on Theoretical Foundations for Large Scale Computations of Nonlinear Material Behaviour, Northwestern University, Evanston, Illinois (1983).
[30] Nagtegaal, Comp. Meth. Appl. Mech. Eng. 33 (1982)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.