2010
DOI: 10.1002/nag.887
|View full text |Cite
|
Sign up to set email alerts
|

Large static problem in numerical limit analysis: A decomposition approach

Abstract: International audienceA general decomposition approach for the static method of limit analysis is proposed. It is based on piecewise linear stress fields, on a partition into finite element sub-problems and on a specific coordination of the subproblem stress fields through auxiliary interface problems. The final convex optimization problems are solved using nonlinear interior point programming methods. As validated for the compressed bar with Tresca/von Mises materials in plane strain, this method appears rapi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
4
3
3

Relationship

1
9

Authors

Journals

citations
Cited by 17 publications
(11 citation statements)
references
References 21 publications
0
10
0
Order By: Relevance
“…has so far defied solution, but the latest bounds from largescale FELA (Kammoun et al, 2010;Pastor et al, 2009) are…”
Section: Vertical Cutmentioning
confidence: 99%
“…has so far defied solution, but the latest bounds from largescale FELA (Kammoun et al, 2010;Pastor et al, 2009) are…”
Section: Vertical Cutmentioning
confidence: 99%
“…While the decomposition techniques for optimisation problems is a relatively recent topic, its application to limit analysis and other plasticity problems has found far less attention [12]. We also refer the reader to [11], where alternative decomposition techniques of the limit analysis problem has been introduced. We here first briefly describe some of the general ideals of decomposition of optimisation problems.…”
Section: Decomposition Techniquesmentioning
confidence: 99%
“…In the early works, the convex yield criterion was approximated in a piecewise linear form so that the LA problem could be solved using linear [43] or quadratic programming [41]. The subsequent developments in mathematical programming provided solvers (e.g., [44]) that can handle static [45][46][47][48][49] and kinematic [19,46,50] numerical problems of LA involving more complex yield criteria.…”
Section: Introductionmentioning
confidence: 99%