Effective explicit algorithms for integrating complex elastoplastic constitutive models, such as those belonging to the Cam clay family, are described. These automatically divide the applied strain increment into subincrements using an estimate of the local error and attempt to control the global integration error in the stresses. For a given scheme, the number of substeps used is a function of the error tolerance specified, the magnitude of the imposed strain increment, and the non‐linearity of the constitutive relations. The algorithms build on the work of Sloan in 1987 but include a number of important enhancements. The steps required to implement the integration schemes are described in detail and results are presented for a rigid footing resting on a layer of Tresca, Mohr‐Coulomb, modified Cam clay and generalised Cam clay soil. Explicit methods with automatic substepping and error control are shown to be reliable and efficient for these models. Moreover, for a given load path, they are able to control the global integration error in the stresses to lie near a specified tolerance. The methods described can be used for exceedingly complex constitutive laws, including those with a non‐linear elastic response inside the yield surface. This is because most of the code required to program them is independent of the precise form of the stress‐strain relations. In contrast, most of the implicit methods, such as the backward Euler return scheme, are difficult to implement for all but the simplest soil models.

SUMMARYThis paper describes two substepping schemes for integrating elastoplastic stress-strain relations. The schemes are designed for use in finite element plasticity calculations and solve for the stress increments assuming that the strain increments are known. Both methods are applicable to a general type of constitutive law and control the error in the integration process by adjusting the size of each substep automatically. The first method is ba5ed on the well-known modified Euler scheme, whereas the second technique employs a high order Runge-Kutta formula. The procedures outlined do not require any form of stress correction to prevent drift from the yield surface. Their utility is illustrated by analysis of typical boundary value problems.

No abstract

SUMMARYThis paper describes a new formulation, based on linear ÿnite elements and non-linear programming, for computing rigorous lower bounds in 1, 2 and 3 dimensions. The resulting optimization problem is typically very large and highly sparse and is solved using a fast quasi-Newton method whose iteration count is largely independent of the mesh reÿnement. For two-dimensional applications, the new formulation is shown to be vastly superior to an equivalent formulation that is based on a linearized yield surface and linear programming. Although it has been developed primarily for geotechnical applications, the method can be used for a wide range of plasticity problems including those with inhomogeneous materials, complex loading, and complicated geometry.

SUMMARYThis paper describes a technique for computing lower bound limit loads in soil mechanics under conditions of plane strain. In order to invoke the lower bound theorem of classical plasticity theory, a perfectly plastic soil model is assumed, which may be either purely cohesive or cohesive-frictional, together with an associated flow rule. Using a suitable linear approximation of the yield surface, the procedure computes a statically admissible stress field via finite elements and linear programming. The stress field is modelled using linear 3-noded trianglcs and statically admissible stress discontinuities may occur at the edges of each triangle. Imposition of the stress-boundary, equilibrium and yield conditions leads to an expression for the collapse load which is maximized subject t o a set of linear constraints on the nodal stresses. Since all of the requirements for a statically admissible solution are satisfied exactly (except for small round-off errors in the optimization computations), the solution obtained is a strict lower bound on the true collapse load and is therefore 'safe'.A major drawback of the technique, as first described by Lysmer,' is the large amount of computer time required to solve the linear programming problem. This paper shows that this limitation may be avoided by using an active set algorithm, rather than the traditional simplex or revised simplex strategies, to solve the resulting optimization problem. This is due to the nature of the constraint matrix, which is always very sparse and typically has many more rows than columns. It also proved that the procedure can, without modification, be used to derive strict lower bounds for a purely cohesive soil which has increasing strength with depth. This important class of problem is difficult to tackle using conventional methods. A number of examples are given to illustrate the effectiveness of the procedure.