Skip to main content

Research Repository

Advanced Search

A fast algorithm for finding the first intersection with a non-convex yield surface

Sheng, D.; Augarde, C.E.; Abbo, A.

Authors

D. Sheng

A. Abbo



Abstract

A major task in the numerical modelling of soils using complex elastoplastic material models is stress updating. This paper proposes a fast and robust numerical algorithm for locating the first intersection between a non-convex yield surface and an elastic trial stress path. The intersection problem is cast into a problem of finding the smallest positive root of a nonlinear function. Such a function may have multiple roots within the interval of interest. The method is based on the modified Steffensen method, with important modifications to address the issues arising from the non-convexity. Numerical examples demonstrate that the proposed M2 Steffensen method is indeed computationally efficient and robust.

Citation

Sheng, D., Augarde, C., & Abbo, A. (2011). A fast algorithm for finding the first intersection with a non-convex yield surface. Computers and Geotechnics, 38(4), 465-471. https://doi.org/10.1016/j.compgeo.2011.02.008

Journal Article Type Article
Publication Date Jun 1, 2011
Deposit Date Apr 1, 2011
Journal Computers and Geotechnics
Print ISSN 0266-352X
Publisher Elsevier
Peer Reviewed Peer Reviewed
Volume 38
Issue 4
Pages 465-471
DOI https://doi.org/10.1016/j.compgeo.2011.02.008
Keywords Non-convexity, Yield surface intersection, Stress integration.