IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0321451.html
   My bibliography  Save this article

Axisymmetric adaptive upper-bound finite element limit analysis formulation based on second-order cone programming for bearing capacity of circular footing

Author

Listed:
  • Rui Sun
  • Haibing Cai
  • Kai Zhang

Abstract

An adaptive axisymmetric upper bound finite element limit analysis (UB-FELA) formulation has been presented for Mohr-Coulomb (M-C) materials in this paper. The computational domain is discretized using quadratic velocity elements. For the sake of computational efficiency, the axisymmetric UB finite element problem is recast into a model of second-order cone programming (SOCP). To enhance the precision of the proposed UB finite element method using a reduced element count, this study implements a mesh adaptation algorithm grounded in plastic dissipation. The collapse loads for determining the circular footings are then estimated by application of the proposed axisymmetric UB limit analysis formulas. By comparing the results to those reported in the literature, the analysis indicates that the method presented in this paper yields an accurate UB solution.

Suggested Citation

  • Rui Sun & Haibing Cai & Kai Zhang, 2025. "Axisymmetric adaptive upper-bound finite element limit analysis formulation based on second-order cone programming for bearing capacity of circular footing," PLOS ONE, Public Library of Science, vol. 20(6), pages 1-14, June.
    • Handle: RePEc:plo:pone00:0321451
    DOI: 10.1371/journal.pone.0321451
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0321451
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0321451&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0321451?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0321451. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.