IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-75999-7_148.html
   My bibliography  Save this book chapter

Lower Bound Shakedown Analysis by Using the EFG Method and Nonlinear Programming

In: Computational Mechanics

Author

Listed:
  • S. S. Chen

    (Tsinghua University, Department of Engineering Mechanics)

  • Y. H. Liu

    (Tsinghua University, Department of Engineering Mechanics)

  • Z. Z. Cen

    (Tsinghua University, Department of Engineering Mechanics)

Abstract

Shakedown theorems are exact theories of classical plasticity for the direct computation of the load-carrying capacity under varying loads. Based on the classical Melan’s theorem, a numerical solution procedure for determining the shakedown load of elasto-perfectly plastic structure is presented firstly making use of the element free Galerkin (EFG) method. The numerical implementation is very simple and convenient because it is only necessary to construct an array of nodes in the domain under consideration. The reduced-basis technique is adopted here to solve the mathematical programming iteratively in a sequence of reduced self-equilibrium stress subspaces with very low dimensions. The self-equilibrium stress field is expressed by linear combination of several self-equilibrium stress basis vectors with parameters to be determined. These self-equilibrium stress basis vectors can be generated by performing equilibrium iteration procedure during elasto-plastic incremental analysis. The Complex method is used to solve nonlinear programming and determine the maximal load amplifier. The numerical results show that it is efficient and accurate to solve shakedown analysis problems by using the EFG method and nonlinear programming.

Suggested Citation

  • S. S. Chen & Y. H. Liu & Z. Z. Cen, 2007. "Lower Bound Shakedown Analysis by Using the EFG Method and Nonlinear Programming," Springer Books, in: Computational Mechanics, pages 348-348, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-75999-7_148
    DOI: 10.1007/978-3-540-75999-7_148
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:sprchp:978-3-540-75999-7_148. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.