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

An Efficient Solution Algorithm for Elastoplasticity and its First Implementation Towards Uniform h- and p- Mesh Refinements

In: Numerical Mathematics and Advanced Applications

Author

Listed:
  • Johanna Kienesberger

    (Johannes Kepler University Linz, Special Research Program SFB F013, ‘Numerical and Symbolic Scientific Computing’)

  • Jan Valdman

    (Johannes Kepler University Linz, Special Research Program SFB F013, ‘Numerical and Symbolic Scientific Computing’)

Abstract

The main subject of this paper is the detailed description of an algorithm solving elastoplastic deformations. Our concern is a one time-step problem, for which the minimization of a convex but non-smooth functional is required. We propose a minimization algorithm based on the reduction of the functional to a quadratic functional in the displacement and the plastic strain increment omitting a certain nonlinear dependency. The algorithm also allows for an easy extension to higher order finite elements. A numerical example in 2D reports on first results for uniform h- and p- mesh refinements.

Suggested Citation

  • Johanna Kienesberger & Jan Valdman, 2006. "An Efficient Solution Algorithm for Elastoplasticity and its First Implementation Towards Uniform h- and p- Mesh Refinements," Springer Books, in: Alfredo Bermúdez de Castro & Dolores Gómez & Peregrina Quintela & Pilar Salgado (ed.), Numerical Mathematics and Advanced Applications, pages 1117-1125, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-34288-5_112
    DOI: 10.1007/978-3-540-34288-5_112
    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

    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-34288-5_112. 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.