Академический Документы
Профессиональный Документы
Культура Документы
COMPUTATIONAL PLASTICITY
Raaele Casciaro
Dipartimento di Strutture, Universit`
a della Calabria
Contents
1 Plasticity for absolute beginners
1.1 Initial remarks . . . . . . . . . . . . . . . . . .
1.2 Basics of plasticity theory . . . . . . . . . . .
1.3 Some more . . . . . . . . . . . . . . . . . . . . .
1.4 The Drucker postulate (1951) . . . . . . . . .
1.5 Limit analysis . . . . . . . . . . . . . . . . . . .
1.6 An example . . . . . . . . . . . . . . . . . . . .
1.7 The static theorem of limit analysis . . . . .
1.8 The kinematic theorem of limit analysis . .
1.9 Additional comments . . . . . . . . . . . . . .
1.10 Plastic adaptation (shakedown) . . . . . . .
1.11 The Melans theorem (1936) . . . . . . . . .
1.12 Relations with admissibletensions criteria
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
3 Computational strategies
3.1 Numerical algorithms for plastic analysis . .
3.2 Incremental elastoplastic analysis . . . . . .
3.3 Solution of subproblem P1 . . . . . . . . . . .
3.4 Example 1: constant tension plane elements
3.5 Some comments . . . . . . . . . . . . . . . . .
3.6 Example 2: framed structures . . . . . . . . .
3.7 Solution of subproblem P2 . . . . . . . . . . .
3.8 Some remarks . . . . . . . . . . . . . . . . . . .
3.9 The arclength method . . . . . . . . . . . . .
3.10 Riks iteration scheme . . . . . . . . . . . . .
3.11 Convergence of Riks scheme . . . . . . . . .
26
27
29
30
31
32
33
34
35
36
37
38
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
solutions and
. . . .
. . . .
. . . .
. . . .
. . . .
. . . .
much
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
. . . . .
more...
39
40
41
42
43
44
45
46
47
48
49
Chapter 1
Plasticity for absolute beginners
This section intends to provide motivations and basic hypotheses of elastoplastic theory and presents some of the
more classical results of the theory.
In particular, we present the fundamental theorems of limit
analysis (the static and kinematic one) and the Melan theorem for plastic adaptation (shakedown analysis).
The discussion claries the real meaning of traditional procedures based on elastic analysis and admissible tension criteria.
1.1
Initial remarks
1.2
1.3
Some more
1.4
1.5
Limit analysis
1.6
An example
1.7
T c
dv
B c
T c
dv
B a
= c {
= a {
q u dv +
B
T
q u dv +
B
T
T c
f
u ds}
B
T c
f
u ds}
B
( c ) dv = (c a ){
B
a T c
q u dv +
B
T
T c
f
u ds}
B
1.8
T p dv
B p
= p {
q u dv +
T
f T u p ds}
f T u p ds}
T p dv
B c
= c {
q u dv +
T
we obtain, by dierence:
( p c)T p dv = (p c){
B
qT u p dv +
B
f T u p ds}
11
1.9
Additional comments
12
1.10
13
1.11
T 1
)
E
(
) dv 0
B
we obtain:
=
[t]
T p
(
)
dv 0 ( < 0 if = 0)
B
1.12
15
Chapter 2
Finitestep incremental analysis
In this part some theoretical basis of the incremental elasto
plastic analysis will be introduced.
In particular it will be presented an analysis procedure oriented to furnish the complete time evolution of the structural
response due to a given loading process.
The solution, represented by a path in the load/displacement
space, is obtained through the computation of a sequence of
equilibrium points {uk , pk } ne enough to reconstruct an
interpolating curve.
Since the earlier 60s, the interest for these topics has been
strongly increasing, thanks to the availability of powerful
computers and to the development of specic numerical algorithms.
16
2.1
Holonomic plasticity
17
2.2
1
2 B
E dv +
T
T p
0 dv
B
ds
(N)T u
=
=
( +
dv
B
T T
p0 ) dv
(N)T u ds
(N) u ds
B
T
T
p
dv
B
T
p
(
dv 0
a
B
18
2.3
1
2 B
( E )T E1( E ) dv = minimum
2.4
20
2.5
A deep insight
U [[t]] := [t] T dt
We dene extremal the paths characterized by the following
(extremal) condition:
U [ 1] := U [
[t]] U [[t]]
In order to complete the denition domain of U , we assume
that
U [ 1] := +
when no admissible path between 0 and 1 does exist. So,
U [ 1] has been characterized as a function dened in all the
space, and will be called extremalpath potential .
From the decomposition of the total strain in the elastic
and plastic components ( = e + p), it is possible to derive
the decomposition of the complementary work in the elastic
part U e [] and the plastic part U p[]. Only the latter is
pathdependent, and we can express it in this way:
U [[t]] := [t] T p dt
p
21
2.6
T
(
)
(
2 + L [t]) dt
1
2
0
= U [ 2] + ( 1 2)T 2 +
T
(
)
L [t] dt
1
2
0
( 1 2) L[t] dt =
0
T
1 t
{
0
TL L d } dt
2.7
Consequences of convexity
23
2.8
[] ( eq ) dv
B
T
T
(N(
)
u ds = 0
eq
B
U [] dv
B
(N)T u ds
B
U [ eq ] dv
B
(N eq )T u ds
24
2.9
=
p
[t]
p
[
]d dt =
0
[ ] d [t]dt
p[t]T ( a [t])dt 0
Ue
se f [] 1
U [] =
+
se f [] > 1
and the principle of minimum becomes equivalent to the
Haar-Karman principle:
Among all the equilibrated and admissible stress elds,
the elastoplastic extremalpath solution minimizes
the complementary energy.
25
Chapter 3
Computational strategies
This part intends to discuss some numerical strategies suitable for the nite element elasto-plastic analysis of complex
structures.
In particular, the discussion will refer to the incremental
elastoplastic problem, using the so called initial stress strategy combined with a pathfollowing incremental method.
26
3.1
1. Limit analysis:
Linear programming algorithms (based on limit analysis theorems and on the statickinematic duality).
Nonlinear programming (algorithms based on limit
analysis theorems).
Alternative variational formulations combined with
the use of specialized solution algorithms.
This class of algorithms has been very popular (at
least within the Italian academy) during the 60s
70s. At the present time, it is not used at all, except for rare cases, because it is considered much less
ecient then the incremental approach.
2. Plastic adaptation (shakedown):
The situation is the same as limit analysis.
In a certain sense, the problem is similar to that
of limit analysis, and therefore similar solution algorithms could be used. However, the methods recently proposed are poorly ecient, even if there is
the possibility of providing synthetic results for complex loading combinations, circumstance that makes
this approach particularly interesting.
Because of the technical relevance of the topic, it is
desirable an increasing development in the research.
27
3. Incremental analysis:
Heuristic algorithms (Euler extrapolation ...).
Quadratic programming.
Initial stress approach:
28
3.2
29
3.3
Solution of subproblem P1
3.4
1
2
(1
+
)
ij + 3(1 2)
2
2E
ij
f [] :=
1 2
< 1
y2 ij ij
3.5
Some comments
32
3.6
&
3&
[] :=
N2 +
(Mi2 + Mj2 2cMi Mj )
2 EA
EJ
1
where
c :=
1 /2
2+
:=
12EJ
GA&2
33
3.7
Solution of subproblem P2
rj+1
1 rj
= I Kj K
I Kj K < 1 , j
where [] is the spectral radius of the matrix.
The convergence condition can be rearranged in a more
useful form:
0 < Kj < 2K
34
3.8
Some remarks
The inequality
0 (s[uj+1]s[uj ])T (uj+1uj ) (uj+1uj )T KE (uj+1uj )
which is true for solutions obtained through extremal
paths, starting from u0, can be written in the following
matrix form:
0 Kj KE
Hence, the second part of the convergence condition (i.e.,
is trivially satised once it is assumed (as in
Kj < 2K)
the initial stress method)
:= KE
K
(or a reasonable approximation of KE ).
the rst part of the convergence condition (Kj > 0)
is more critical because, even if we have Kj 0, the
iteration scheme fails to converge near to the collapse,
where:
Kt [u] 0
For this reason, the MNRbased incremental process is
not able to describe the collapse state of the structure.
Actually, when the plasticization process goes on, the
convergence of the iterative process rapidly decreases,
and this generally means that the process itself will prematurely stop.
35
3.9
These diculties are easily avoided if an analytical representation is used. A proper description is obtained assuming a curvilinear arclength abscissa as description
parameter, in the {u, } space.
The arclength method has been proposed by Riks in
1974 for the pathfollowing analysis of nonlinear elastic
problems. At the present time, it can be considered as
the de facto standard method for nonlinear analysis.
36
3.10
The iteration scheme due to Riks represents the rst, and jet
more ecient, implementation of the arclength method.
Its main idea is to introduce explicitely the load multiplier
as further unknown. At the same time a further constraint
is needed, and it is given in the following way:
uTMu + = 0
where M and are appropriate metric factors. This condition implies the orthogonality (in the enlarged space {u, })
between the iterative correction
u = uj+1 uj
= j+1 j
and the total step increment
u = uj u0
=
j
0
If the iteration starts from a suitable extrapolation {u1, 1}
that realizes the required distance from {u0, 0}, the constraint represents an approximate, but computationally ecient way to x the arclength.
With this choice, the iteration scheme can be rearranged:
u
K
p
= rj
uT Mu
+ = 0
where
p
:=
dp[]
d
37
3.11
rj+1
1 [I j Bj ] rj
= I Kj K
p
T dj
j :=
j + p
T dj
[I Kj K ][I j Bj ] < 1 , j
Remarks:
The better performance of the Riks scheme is strictly
related to the lter eect produced by the matrix
[I j Bj ]
The lter does not aect the components of rj orthogonal
to dj , and reduces the parallel components of a (1 j )
factor.
For 0 and, in any case, near to a limit point (where
0), we have j 0 and then the lter corresponds
to an orthogonal projection on the direction dj .
38
3.12
j+1 = j rT
/
pT u
j u
1
u
u
j+1 = uj + K rj + (j+1 j )
Using arguments similar to the loadcontrolled scheme, we
can derive the following (sucient) convergence condition:
in U := u : p
Tu = 0
;
0 < Kt [u] <2K
p
u c =
c dv > 0
c
B
39
3.13
An ecient incremental process should have an adaptive behaviour; that is, it should be able, on the basis of autonomous
choices, to vary its internal parameters in order to reduce the
computational cost and increase the accuracy of the analysis.
In particular, the following features are required:
the process should tune the step length: that is, it should
increase such length where the equilibrium curve is weekly
nonlinear, and reduce it in the strongly nonlinear parts.
This allows either a better description of the curve and
the computation of a smaller number of equilibrium points.
too, in
The process should tune the iteration matrix K
order to follow the evolution of Kj : for instance, we
should use the full elastic stiness matrix only in the
nearly elastic incremental steps, and a reduced stiness
in the plastic steps.
The adaptivity feature must be computationally cheap
and, anyway, must preserve the reliability of the overall
analysis.
40
3.14
u1 = u0 + u0
1 = 0 + 0
where u0 and 0 are the total increments attained
in the previous step.
The second one controls the evaluation of the iteration
which is assumed to be proportional to KE
matrix K,
= 1 KE
K
rT
j
j u
= j
(rj rj+1)Tu j
k+1 = k t 2nn
Chapter 4
Finite element discretization
The presence of the discontinuities related to the elastoplastic behaviour requires an approach dierent from the one
generally used for elastic problems, for which the solution is
characterized by an high degree of regularity.
Discretization methods (nite element modeling) which
are ecient for elastic problems can be not so convenient
for plastic ones.
In this part a rapid sketch on this topics is given, with the
aim to describe some nite elements potentially suitable for
elastoplastic problems.
42
4.1
43
4.2
Further comments
44
4.3
These elements are triangular (more generally, a tetrahedron with n + 1 vertices, n being the space dimension
of the problem).
Both displacement and stress elds are linearly interpolated on the basis of the nodal values.
both displacements and stresses are continuous on the
element interfaces. Neverthless, if the ratio n.of elements
/ n.of vertices is 2, the model requires 2.5 variables per
element, and the algebra of the problem is very simple.
This allows the use of ne meshes.
It may be convenient to combine 4 triangular elements
into a single quadrangular element (the quadrangle is divided along the two diagonals). In this case we have 5
variables (2 displacements and 3 stresses) for each element.
A convenient variant is the assumption of a constant
stress within the inuence area of each node.
45
4.4
Fluxlaw elements
These are, usually, quadrangular elements (but triangular versions are also possible), endowed with topological
regularity (regular geometry is even better).
Stress and displacement variables are associated to the
total ux which passes through the interfaces.
The balance equations (equilibrium and kinematic compatibility) are written in absolute form (rigid body equilibrium and mass conservation law). The discretization
error is related to the internal stress interpolation used
to dene the discrete form of the strain energy.
We have 6 variables per element (2 displacements and 4
stresses). The element is suitable for ne meshes.
The algebra is very simple for regular geometry (rectangular elements)
46
4.5
HC elements
47
4.6
Flat elements
48
4.7