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

Title: A fast algorithm for finding the first intersection with a non-convex yield surface
Creator: Sheng, Daichao; Augarde, Charles E.; Abbo, Andrew J.
Relation: Computers and Geotechnics Vol. 38, Issue 4, p. 465-471
Publisher Link: http://dx.doi.org/10.1016/j.compgeo.2011.02.008
Publisher: Elsevier
Resource Type: journal article
Date: 2011
Description: 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 M² Steffensen method is indeed computationally efficient and robust.
Subject: non-convexity; yield surface intersection; stress integration
Identifier: http://hdl.handle.net/1959.13/1064429
Identifier: uon:17529
Identifier: ISSN:0266-352X
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format