Please use this identifier to cite or link to this item:
|Title:||Axisymmetric lower-bound limit analysis using finite elements and second-order cone programming||Authors:||Tang, C.
Lower-bound limit analysis
Second-order cone programming
|Issue Date:||2014||Citation:||Tang, C., Toh, K.-C., Phoon, K.-K. (2014). Axisymmetric lower-bound limit analysis using finite elements and second-order cone programming. Journal of Engineering Mechanics 140 (2) : 268-278. ScholarBank@NUS Repository. https://doi.org/10.1061/(ASCE)EM.1943-7889.0000669||Abstract:||In this paper, the formulation of a lower-bound limit analysis for axisymmetric problems by means of finite elements leads to an optimization problem with a large number of variables and constraints. For the Mohr-Coulomb criterion, it is shown that these axisymmetric problems can be solved by second-order cone programming (SOCP). First, a brief introduction to SOCP is given and how axisymmetric lowerbound limit analysis can be formulated in this way is described. Through the use of an efficient toolbox (MOSEK or SDPT3), large-scale SOCP problems can be solved in minutes on a desktop computer. The method is then applied to estimate the collapse load of circular footings and uplift capacity of single or multiplate circular anchors. By comparing the present analysis with the results reported in the literature, it is shown that the results obtained from the proposed method are accurate and computationally more efficient than the numerical lower-bound limit analysis incorporated with linear programming. © 2014 American Society of Civil Engineers.||Source Title:||Journal of Engineering Mechanics||URI:||http://scholarbank.nus.edu.sg/handle/10635/90913||ISSN:||07339399||DOI:||10.1061/(ASCE)EM.1943-7889.0000669|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 23, 2019
WEB OF SCIENCETM
checked on Aug 14, 2019
checked on Aug 17, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.