Upper-bound limit analysis of a rigid-plastic body with frictional interfaces

Upper-bound limit analysis of a rigid-plastic body with frictional interfaces,10.1016/0020-7403(94)90071-X,International Journal of Mechanical Science

Upper-bound limit analysis of a rigid-plastic body with frictional interfaces   (Citations: 5)
BibTex | RIS | RefWorks Download
Abstraet--A finite element formulation of the upper-bound theorem for rigid-plastic solids, generalized to include interfaces with finite friction, is described. As proved by Collins ( J. Mech. Phys. Solids 17, 323 (1969)), the usual definition of a kinematically admissible velocity field is unnecessarily restrictive when the upper-bound theorem is applied to many practical problems. This paper shows that a relaxed inequality can be used successfully to derive upper bounds in the presence of Coulomb friction on interfaces, provided one considers a wide enough class of "admissible" velocity fields. One of the major advantages of using a numerical formulation of the upper-bound theorem is that both complex loading geometry and inhomogeneous material behaviour can be easily dealt with. Using a suitable linear approximation of the yield surface, the application of the necessary boundary conditions, the plastic flow rule and the yield criterion lead to a large linear programming problem. The numerical procedure uses constant-strain triangular elements with the unknown velocities as the nodal variables. An additional set of unknowns, the plastic multiplier rates, is associated with each element. Kinematically admissible velocity discontinuities are permitted along specified planes within the finite element mesh. During the solution phase, an active set algorithm is used to solve the linear programming problem.
Journal: International Journal of Mechanical Sciences - INT J MECH SCI , vol. 36, no. 3, pp. 219-229, 1994
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: