کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
255149 503352 2011 7 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A fast algorithm for finding the first intersection with a non-convex yield surface
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
A fast algorithm for finding the first intersection with a non-convex yield surface
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers and Geotechnics - Volume 38, Issue 4, June 2011, Pages 465–471
نویسندگان
, , ,