Durham Research Online
You are in:

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

Sheng, D. and Augarde , C.E. and Abbo, A. (2011) 'A fast algorithm for finding the first intersection with a non-convex yield surface.', Computers and geotechnics., 38 (4). pp. 465-471.

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.

Item Type:Article
Keywords:Non-convexity, Yield surface intersection, Stress integration.
Full text:Full text not available from this repository.
Publisher Web site:http://dx.doi.org/10.1016/j.compgeo.2011.02.008
Record Created:22 Jun 2011 09:35
Last Modified:22 Jun 2011 12:47

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library