Elastoplasticity by mathematical programming methods

verfasst von
K. Krabbenhøft, A. V. Lyamin, S. W. Sloan, Peter Wriggers
Abstract

In the last 10-15 years a number of very powerful methods for general convex programming have been developed. Commonly labeled interior-point (IP) methods, these algorithms make it possible to solve a wide variety of practical, large-scale problems with moderate computational effort. One such class of problems is classical small-displacement, rate-independent elastoplasticity. In this paper we investigate the prospects of applying the IP methodology to this class of problems. In addition to applying standard IP otimizers, we also develop a slightly modified IP method which in term of generality, efficiency, and robustness appears to be fully competitive with conventional methods.

Organisationseinheit(en)
Institut für Baumechanik und Numerische Mechanik
Externe Organisation(en)
University of Newcastle
Typ
Aufsatz in Konferenzband
Seiten
1106-1109
Anzahl der Seiten
4
Publikationsdatum
01.12.2005
Publikationsstatus
Veröffentlicht
Peer-reviewed
Ja
ASJC Scopus Sachgebiete
Theoretische Informatik und Mathematik, Theoretische Informatik
 

Details im Forschungsportal „Research@Leibniz University“