Professional Documents
Culture Documents
1 Introduction
The contact problems of elastic bodies are widely used in many fields of science
and engineering. The recent achievements on analytical and numerical methods for
solution of these problems are given in work [10].
Nowadays the numerical methods based on the theory of variational inequalities
have become very popular for solving contact problems of elasticity. The develop-
ment of domain decomposition methods (DDM) has given a powerful incentive to
this approach, especially for the solution of multibody contact problems. The brief
overview of existing DDM for contact problems is given in [4, 10].
Using the penalty variational formulation and the simple iteration method for
variational equations we have proposed parallel Neumann and parallel Dirichlet
domain decomposition schemes for solution of unilateral frictionless two-body con-
tact problems of elasticity [9]. These schemes have been generalized for multibody
contact problems and their convergence has been proved [2].
G. Kreiss et al. (eds.), Numerical Mathematics and Advanced Applications 2009, 297
DOI 10.1007/978-3-642-11795-4 31, © Springer-Verlag Berlin Heidelberg 2010
298 I.I. Dyyak and I.I. Prokopyshyn
u˛ D u˛ ˛ C u˛ ˛ C u˛ n n˛ ; ˛ D O ˛ n˛ D ˛ ˛ C ˛ ˛ C ˛ n n˛ :
S S
The boundaryS˛ of every domain consists of three parts: ˛ D ˛u ˛ S˛ ,
where S˛ D ˇ 2B ˛ S˛ ˇ is the possible contact area of body ˝˛ with other bodies,
p3
Γ2u f2 Γ3σ
Ω2
d12 f3
d13 Ω3
p2 Γ2σ S21 Γ3u
S12 S31
S13
Ω1 x3
f1
Γ1σ
p1
x2
Fig. 1 Contact of several 3D Γ1u
bodies x1
Domain Decomposition Schemes for Frictionless Multibody Contact Problems 299
1
F .u/ D A .u; u/ L .u/ ! min ; (11)
2 u2K
300 I.I. Dyyak and I.I. Prokopyshyn
P
where A .u; v/ D N ˛D1 a˛ .u˛ ; v˛ / is the bilinear form which represents the total
P
deformation energy of the system of bodies and L .u/ D N ˛D1 l ˛ .u˛ / is the linear
form which is equal to the external forces work,
Z
a˛ .u˛ ; v˛ / D O ˛ .u˛ / W O ˛ .v˛ / d˝ ; u˛ ; v˛ 2 V˛0 ;
˝˛
Z Z
l ˛ .v˛ / D p˛ v˛ dS C f˛ v˛ d˝ ; v˛ 2 V˛0 ; ˛ D 1; 2; : : : ; N :
˝˛
˛
The bilinear form A is symmetric, continuous and coercive, and the linear form L
is continuous, i.e.,
8 u; v 2 V0 A .u; v/ D A .v; u/ ; (12)
9 M > 0 8 u; v 2 V0 jA .u; v/j M kukV 0
kvkV 0
; (13)
A .u; v u/ L .v u/ 0 ; 8 v 2 K; u 2 K : (16)
To satisfy the non-penetration condition (8) and to obtain an unconstrained
optimization problem, we have used the penalty method with following penalty [5]:
X Z
1 2
J .u/ D d˛ ˇ .x/ u˛ n .x/ uˇ n .x0 / dS: (17)
2 S˛ ˇ
f˛; ˇ g 2 Q
Here > 0 is a penalty parameter, and the quantity ˛ ˇ D d˛ ˇ u˛ n uˇ n =
has a sense of the contact stress.
Let us consider the following unconstrained minimization problem:
1
F .u/ D A .u; u/ L.u/ C J .u/ ! min : (18)
2 u2V 0
The penalty J is two times Gateaux differentiable at V0 and the Gateaux derivatives
satisfy the properties:
ˇ ˇ
8 u 2 V0 9 R > 0 8 v 2 V0 ˇJ 0 .u; v/ˇ R kukV 0
kvkV 0
; (19)
ˇ ˇ
9 D > 0 8 u; v; w 2 V0 ˇJ 00 .u; v; w/ˇ D kvkV 0
kwkV 0
; (20)
00
8 u; v 2 V0 J .u; v; v/ 0: (21)
Domain Decomposition Schemes for Frictionless Multibody Contact Problems 301
Due to the properties (12)–(15) and (19)–(21), it can be shown that the functional
F is two times Gateaux differentiable, strictly convex, weakly lower semicon-
tinuous and lim F .u/ D 1. Hence [1], there exists the unique solution
kukV 0
!1
of the minimization problem (18) and this problem is equivalent to the following
variational equation:
where
X Z
1
J 0 .u; v/ D d˛ ˇ u ˛ n u ˇ n v˛ n C v ˇ n dS:
S˛ ˇ
f˛; ˇ g 2 Q
Using the results of works [3, 8], we have proved the next theorem about the
convergence of this method.
Theorem 1. If uN 2 V0 is the solution of the variational equation (22) for
> 0 and if uN 2 K is the solution of the variational inequality (16), then
kuN uk
N V 0 ! 0.
!0
e kukV
e > 0 8 u 2 V0 G .u; u/ B 2
9B 0
: (25)
For the numerical solution of the nonlinear variational equation (22) we use the
simple iteration method [3] in the form [2, 9]:
h i
G .ukC1 ; v/ D G .uk ; v/
A .uk ; v/ C J 0 .uk ; v/ L .v/ ; k D 0; 1; : : : ;
(26)
where uk 2 V0 is the k-th approximation to the exact solution uN 2 V0 of the problem
(22) and
2 R is an iterative parameter.
We have proved the next theorem [2], which generalize the theorem about the
convergence of the simple iteration method for linear variational equations [3].
Theorem 2. Let conditions (13)–(15), (19)–(21), (23)–(25) hold and the iteration
e .M C D/2 .
parameter
lies in the interval .0I
2 / ,
2 D 2B B=
k
Then the sequence fu g V0 obtained by the iterative method (26) con-
verges strongly in V0 to the exact solution uN 2 V0 of the variational equation (22),
302 I.I. Dyyak and I.I. Prokopyshyn
i.e.
uk uN
V ! 0 . Moreover, the convergence rate in the norm kukG D
0 k!1
p
G .u; u/ is linear:
ukC1 uN
G q
uk uN
G , q D Œ1
.2B
.M C
1
D/2 =Be =f M 2 < 1.
Let us choose the bilinear form G in the simple iteration method (26) as follows
where
X Z
1
X.u; v/ D u ˛ n v˛ n C u ˇ n vˇ n ˛ˇ dS; (28)
S˛ ˇ
f˛; ˇ g 2 Q
(
0; x 2 S˛ ˇ nS˛1 ˇ
˛ˇ .x/ D ; S˛1 ˇ S˛ ˇ ; f˛; ˇg 2 Q:
1; x 2 S˛1 ˇ
ukC1
˛ D
uQ kC1
˛ C .1
/ uk˛ ; ˛ D 1; 2; : : : ; N; k D 0; 1; : : : : (32)
At each iteration k we have to solve N parallel elasticity problems (31) with
general Robin (Poincaré) condition on S˛ ˇ . Hence, this method refers to the parallel
Robin (Poincaré) domain decomposition schemes.
Domain Decomposition Schemes for Frictionless Multibody Contact Problems 303
X Z
a˛ .uQ kC1
˛ ; v˛ / D l ˛ .v˛ / C ˛kˇ v˛ n dS ; (34)
S˛ ˇ
ˇ 2B ˛
ukC1
˛ D
uQ kC1
˛ C .1
/ uk˛ ; ˛ D 1; 2; : : : ; N; k D 0; 1; : : : : (35)
If at each iteration k we choose
(
k 0; d˛ ˇ .x/ uk˛ n .x/ ukˇn .x0 / 0
˛ ˇ D ˛ ˇ .x/ D ; x 2 S˛ ˇ ; x 0 2 Sˇ ˛ ;
1; d˛ ˇ .x/ uk˛ n .x/ ukˇn .x0 / < 0
(36)
then we shall get the method [9]:
Z
1 X
a˛ .uQ kC1
˛ ; v˛ / C k˛ ˇ uQ kC1
˛n .d ˛ ˇ u k
ˇ n / v˛ n dS D l ˛ .v˛ / ;
S˛ ˇ
ˇ 2B ˛
(37)
ukC1
˛ D
uQ kC1
˛ C .1
/ uk˛ ; ˛ D 1; 2; : : : ; N; k D 0; 1; : : : : (38)
At each step k of this scheme we have to solve N parallel elasticity problems (37)
with prescribed displacements d˛ ˇ ukˇn on a subset of the surface S˛ ˇ . Therefore
this method refers to nonstationary Dirichlet domain decomposition schemes.
Note, that in the most general case we can choose ˛ ˇ (i.e., S˛1 ˇ ) differently for
each f˛; ˇg 2 Q.
The advantages of proposed numerical domain decomposition schemes are the
simplicity and the regularization of the contact problem through the penalty method.
5 Numerical Investigations
The numerical analysis of the schemes (31) and (32) has been made for 2D contact
problem of two transversally isotropic bodies ˝1 and ˝2 with the plane of isotropy
parallel to the plane x2 D 0 (Fig. 2). We have used FEM with 15 quadratic triangular
elements on the possible contact area.
0 0
ı 0 material properties of the bodies are: E˛ D 1:0, E˛ D 0:5, ˛ D ˛ D 0:3,
The
G˛ G˛ D 2:0, where E˛ , ˛ and G˛ are the elasticity modulus, Poisson’s ratio and
the shear modulus in the plane of isotropy for the body ˝˛ respectively, and E˛0 , ˛0 ,
G˛0 are these constants in the orthogonal direction, ˛ D 1; 2.
The distance between bodies before the deformation is d12 D 103 x12 , the
compression of the bodies is D 2:154434 103 .
304 I.I. Dyyak and I.I. Prokopyshyn
u21 = 0 p21 = 0
Ω2
p22 = 0 p22 = 0
u11 = 0 p11 = 0
Ω1
p12 = 0 p12 = 0
0 u11 = 0, u12 = 0 4 x1
a b
m m
1 2
80 80
1
60 60
5
40 40
2,4
5
20 20
4 3
3
0 0
0 0.2 0.4 0.6 0.8 1 γ –8 –7 –6 –5 –4 –3 lg εu
Fig. 3 Total iteration number m dependence: (a) on iteration parameter
for accuracy "u D 103 ;
(b) on logarithmic accuracy lg "u for optimal iteration parameter
D
N
ı ı
We have taken the penalty parameter in the form D c h1 E10 C h2 E20 ,
where h˛ is the height of the body ˝˛ , ˛ D 1; 2 , and c D 0:05 is the dimensionless
penalty parameter.
We have used the following stopping criterion:
.
kC1
kC1
u˛ n uk˛ n
u˛ n
"u ; ˛ D 1; 2 ; (39)
2 2
qP
where ku˛ n k2 D j 2 is the discrete norm, xj 2 S
j u˛ n .x / 12 are the finite
element nodes on the possible contact area, and "u > 0 is the relative accuracy.
At the Fig. 3 the convergence rates of different domain decomposition schemes
are compared. The first curve corresponds to the parallel Neumann scheme
1
.S12 D ;/, curves 2, 3, 4 and 5 correspond to the parallel Robin (Poincaré) schemes
Domain Decomposition Schemes for Frictionless Multibody Contact Problems 305
1 1
with S12 equal to Œ0I 0:5, Œ0I 1, Œ0I 1:5 and Œ0I 2 (S12 D S12 ) respectively.
Curve 3 also represents the nonstationary parallel Dirichlet scheme (37) and (38).
The optimal iteration parameters
N , for the schemes represented at curves 1–5,
are 0.173, 0.39, 0.72, 0.85 and 0.92 respectively. For
D
N and accuracy "u D 103
these schemes converge in 21, 11, 5, 11 and 14 iterations.
Thus, the convergence rate of all methods is linear. The parallel Robin (Poincaré)
1
scheme with the surface closed to the real contact area .S12 D Œ0I 1/, and the
k
nonstationary parallel Dirichlet scheme . 12 D 12 / have the highest convergence
rates. These two schemes also have the widest convergence range for
.
The problem of a priory determination of iterative parameter
and its upper
bound
2 , as well as development of nonstationary schemes, need additional
study.
References
Abstract The aim of this contribution is to shed new light on the intrinsic properties
of fluid-structure coupling methods. By studying the Dirichlet–Neumann coupling
for a one-dimensional model problem, it is shown that the masses at the interface can
be shifted to accelerate the convergence of the extensively applied Gauss–Seidel-
type iteration. Furthermore, the applied time integration as well as the size of the
spatial grid adjacent to the interface influence the convergence behavior. Numerical
studies confirm the results.
1 Introduction
G. Kreiss et al. (eds.), Numerical Mathematics and Advanced Applications 2009, 307
DOI 10.1007/978-3-642-11795-4 32, © Springer-Verlag Berlin Heidelberg 2010