SUMMARYIn geomechanics, limit analysis provides a useful method for assessing the capacity of structures such as footings and retaining walls, and the stability of slopes and excavations. This paper presents a finite element implementation of the kinematic (or upper bound) theorem that is novel in two main respects. First, it is shown that conventional linear strain elements (6-node triangle, 10-node tetrahedron) are suitable for obtaining strict upper bounds even in the case of cohesive-frictional materials, provided that the element sides are straight (or the faces planar) such that the strain field varies as a simplex. This is important because until now, the only way to obtain rigorous upper bounds has been to use constant strain elements combined with a discontinuous displacement field. It is well known (and confirmed here) that the accuracy of the latter approach is highly dependent on the alignment of the discontinuities, such that it can perform poorly if an unstructured mesh is employed. Second, the optimization of the displacement field is formulated as a standard second-order cone programming (SOCP) problem. Using a state-of-the-art SOCP code developed by researchers in mathematical programming, very large example problems are solved with outstanding speed. The examples concern plane strain and the Mohr-Coulomb criterion, but the same approach can be used in 3D with the Drucker-Prager criterion, and can readily be extended to other yield criteria having a similar conic quadratic form.

SUMMARYThe formulation of limit analysis by means of the finite element method leads to an optimization problem with a large number of variables and constraints. Here we present a method for obtaining strict lower bound solutions using second-order cone programming (SOCP), for which efficient primaldual interior-point algorithms have recently been developed. Following a review of previous work, we provide a brief introduction to SOCP and describe how lower bound limit analysis can be formulated in this way. Some methods for exploiting the data structure of the problem are also described, including an efficient strategy for detecting and removing linearly dependent constraints at the assembly stage. The benefits of employing SOCP are then illustrated with numerical examples. Through the use of an effective algorithm/software, very large optimization problems with up to 700 000 variables are solved in minutes on a desktop machine. The numerical examples concern plane strain conditions and the Mohr-Coulomb criterion, however we show that SOCP can also be applied to any other problem of lower bound limit analysis involving a yield function with a conic quadratic form (notable examples being the Drucker-Prager criterion in 2D or 3D, and Nielsen's criterion for plates).

No abstract

SUMMARYThe classical lower and upper bound theorems allow the exact limit load for a perfectly plastic structure to be bracketed in a rigorous manner. When the bound theorems are implemented numerically in combination with the finite element method, the ability to obtain tight bracketing depends not only on the efficient solution of the arising optimization problem, but also on the effectiveness of the elements employed. Elements for (strict) upper bound analysis pose a particular difficulty since the flow rule is required to hold throughout each element, yet it can only be enforced at a finite number of points. For over 30 years, the standard choice for this type of analysis has been the constant strain element combined with discontinuities in the displacement field. Here we show that, provided certain conditions are observed, conventional linear strain triangles and tetrahedra can also be used to obtain strict upper bounds for a general convex yield function, even when the displacement field is discontinuous. A specific formulation for the Mohr-Coulomb criterion in plane strain is given in terms of second-order cone programming, and example problems are solved using both continuous and discontinuous quadratic displacement fields.