Details
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 592-626 |
| Seitenumfang | 35 |
| Fachzeitschrift | International Journal for Numerical Methods in Engineering |
| Jahrgang | 69 |
| Ausgabenummer | 3 |
| Publikationsstatus | Veröffentlicht - 5 Juni 2006 |
Abstract
The problem of small-deformation, rate-independent elastoplasticity is treated using convex programming theory and algorithms. A finite-step variational formulation is first derived after which the relevant potential is discretized in space and subsequently viewed as the Lagrangian associated with a convex mathematical program. Next, an algorithm, based on the classical primal-dual interior point method, is developed. Several key modifications to the conventional implementation of this algorithm are made to fully exploit the nature of the common elastoplastic boundary value problem. The resulting method is compared to state-of-the-art elastoplastic procedures for which both similarities and differences are found. Finally, a number of examples are solved, demonstrating the capabilities of the algorithm when applied to standard perfect plasticity, hardening multisurface plasticity, and problems involving softening.
ASJC Scopus Sachgebiete
- Mathematik (insg.)
- Numerische Mathematik
- Ingenieurwesen (insg.)
- Allgemeiner Maschinenbau
- Mathematik (insg.)
- Angewandte Mathematik
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: International Journal for Numerical Methods in Engineering, Jahrgang 69, Nr. 3, 05.06.2006, S. 592-626.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
}
TY - JOUR
T1 - An interior-point algorithm for elastoplasticity
AU - Krabbenhoft, Kristian
AU - Lyamin, A. V.
AU - Sloan, S. W.
AU - Wriggers, Peter
PY - 2006/6/5
Y1 - 2006/6/5
N2 - The problem of small-deformation, rate-independent elastoplasticity is treated using convex programming theory and algorithms. A finite-step variational formulation is first derived after which the relevant potential is discretized in space and subsequently viewed as the Lagrangian associated with a convex mathematical program. Next, an algorithm, based on the classical primal-dual interior point method, is developed. Several key modifications to the conventional implementation of this algorithm are made to fully exploit the nature of the common elastoplastic boundary value problem. The resulting method is compared to state-of-the-art elastoplastic procedures for which both similarities and differences are found. Finally, a number of examples are solved, demonstrating the capabilities of the algorithm when applied to standard perfect plasticity, hardening multisurface plasticity, and problems involving softening.
AB - The problem of small-deformation, rate-independent elastoplasticity is treated using convex programming theory and algorithms. A finite-step variational formulation is first derived after which the relevant potential is discretized in space and subsequently viewed as the Lagrangian associated with a convex mathematical program. Next, an algorithm, based on the classical primal-dual interior point method, is developed. Several key modifications to the conventional implementation of this algorithm are made to fully exploit the nature of the common elastoplastic boundary value problem. The resulting method is compared to state-of-the-art elastoplastic procedures for which both similarities and differences are found. Finally, a number of examples are solved, demonstrating the capabilities of the algorithm when applied to standard perfect plasticity, hardening multisurface plasticity, and problems involving softening.
KW - Finite elements
KW - Interior-point
KW - Optimization
KW - Plasticity
UR - http://www.scopus.com/inward/record.url?scp=33846308817&partnerID=8YFLogxK
U2 - 10.1002/nme.1771
DO - 10.1002/nme.1771
M3 - Article
AN - SCOPUS:33846308817
VL - 69
SP - 592
EP - 626
JO - International Journal for Numerical Methods in Engineering
JF - International Journal for Numerical Methods in Engineering
SN - 0029-5981
IS - 3
ER -