Académique Documents
Professionnel Documents
Culture Documents
Solutions to Exercises
EXERCISE 9.1 The result of running the Mathematica script on version 4.2 on a Mac G4 are shown in Figure
E9.3. Some intermediate printout produced in the weight loop has been deleted to save space. The log-log
plot has been massaged through Adobe Illustrator to boost line widths.
Weight w = 1. x 10 3
L2 solution error = 4.05286 x 10 2
Weight w = 1. x 10 4
3
L2 solution error = 4.14382 x 10
5
Weight w = 1. x 10
L2 solution error = 4.15314 x 10 4
Weight w = 1. x 106
L2 solution error = 4.15407 x 10 5
-4
-6
Log 10 (w)
-8
4
10
12
14
16
The minimum solution error is obtained for w 1010 , which gives roughly 8 digits of accuracy. The square
root rule suggests taking w 102 1016/2 = 1010 so for this simple problem it works well.
Note: The plot minimum and ascending branch shape may depend on the oating-point hardware used. On
PCs in which Mathematica takes advantage of the 80-bit oating-point registers of the Pentium, the maximum
accuracy is signicantly better (about 14 places) and the optimal weight moves to w 1016 .
EXERCISE 9.2 The results of running the given Mathematica script for the Lagrangian Multiplier method
are shown in Figure E9.4.
1
0
0 200
0 100
0
0
Kmod =
0
0
0
0
0
0
0
1
0
100
200
100
0
0
0
0
0
0
100
200
100
0
0
0
0
0
0
100
200
100
0
0
0
0
0
0
100
200
100
1
0
0
0
0
0
100
100
0
0
1
0
0
0
1
0
0
fmod = { 0, 2, 3, 4, 5, 6, 7, }
5
Solution u = { 0., 0.27, 0.275, 0.25, 0.185, 0.07, 0.14 }, lambda = 24.5
Recovered node forces = { 27., 26.5, 3., 4., 5., 18.5, 7.}
Figure E9.4. Results from Exercise 10.2.
917
918
EXERCISE 9.3 The penalty elements for the stated MFCs are obtained with the rules explained in 9.1.4:
w
w
1
1
1
1
3
9
1
3
u2
u6
u2
u6
0
0
1
3
(E9.9)
1
3
(E9.10)
EXERCISE 9.4
(a)
Master-slave transformation:
Transformed system:
u1
u2
u3
=
2
2
4
2
1
0
1
0
1
0
u1
u2
u1
.
u2
(E9.11)
3
0
(E9.12)
2+w
1
w
1
2
1
w
1
2+w
u1
u2
u3
1
0
2
(E9.13)
6w + 5
,
4w + 4
u 2 = 1.5
for any w,
u3 =
6w + 7
.
4w + 4
(E9.14)
As w the solution tends to u 1 = u 2 = u 3 = 1.5, which is the same found in (a). For sample nite
values of w we get
w=0
u 1 = 1.250, u 2 = 1.500, u 3 = 1.750
w=1
u 1 = 1.375, u 2 = 1.500, u 3 = 1.625
w = 10
u 1 = 1.477, u 2 = 1.500, u 3 = 1.523
(E9.15)
w = 100
u 1 = 1.498, u 2 = 1.500, u 3 = 1.502
(c)
2 1
2
1
0 1
1
0
0
1
2
1
E A/L
0
0
0
12E I /L 3
6E I /L 2
1
u1
1
0 u2 0
=
.
1 u 3 2
0
0
0
6E I /L 2
4E I /L
u x1
u y1
1
=
EA
L
1
0
0
0
12
6 L
0
6 L
4 L 2
918
u x1
u y1
1
E A
0
0
P
0
0
(E9.16)
,
(E9.17)
.
(E9.18)
919
(a)
Solutions to Exercises
u x1
u y1
1
=
1
1
0
0
0
1
u x1
,
1
u = Tu.
or
(E9.19)
6 L
4 L 2
u x1
1
E A
.
0
(E9.20)
Solving:
u x1 =
L
,
1 + 3
1 =
3
,
2(1 + 3)
(E9.21)
1
1
1
1
u x1
u y1
0
.
0
(E9.22)
EA
L
1 + wL
wL
0
wL
12 + wL
6 L
0
6 L
4 L 2
u x1
u y1
1
=
E A
0
0
,
(E9.23)
L(3 + wL)
.
3 + wL(1 + 3)
(E9.24)
EA
L
0
0
1
0
12 ELA
6 E A
1
0
6 E A
4 E AL
0
919
u x1 E A
1 u y1 = 0 ,
1 0
0
0
0
1
(E9.25)
920
avg
35
(a)
plate edge
ux3
+
z
34
(b)
y
x
ux3
ux4
ux5
H/2
H/2
ux5
5
45
Figure E9.5. Geometric interpretation of plate edge rotations for Exercise 10.6.
EXERCISE 9.6
(a)
u y2 = u y4 ,
avg
2 = 35 = (u x5 u x3 )/2.
(E9.26)
avg
The rotation 35 of the plate edge 35 about z is dened in terms of the displacements of the nodes 35.
From geometry, see Figure E9.5(a):
avg
avg
35 tan 35
u x5 u x3
H
(E9.27)
where the replacements are justied by the small-displacements and small-angles assumptions of this
course. Trying to rene this estimate by accounting for the displacement of node 4, we have two angles
identied in Figure E9.5(b): 34 tan 34 (u x4 u x3 )/(H/2) = 2(u x4 u x3 )/H and 45 tan 45
(u x5 u x4 )/(H/2) = 2(u x5 u x4 )/H . Assuming that the rotation at node 4 is the average of these
(which is reasonable since the lengths 34 and 45 are the same) we get
avg
4
1
(
2 34
+ 45 ) =
1
2
2(u x4 u x3 ) 2(u x5 u x4 )
+
H
H
u x5 u x3
.
H
(E9.28)
It is seen that u x4 cancels out and we get back (E9.27). Conclusion: the inclusion of node 4 makes no
difference in this particular conguration.
Note. Another way to rene the rotation estimate would be to try a least-square linear t through u x3 ,
u x4 and u x5 . If correctly explained and worked out, this alternative method is also acceptable as answer
for the second part of the question.
(c)
u x2
0
u
y2
0
2 1/H
u x3 1
u y3 = 0
u 0
x4
u y4 0
u x5
0
u y5
0
0
0
0
0
1
0
0
0
0
1
0
0
0
0
1
0
0
0
920
0
1
0
0
0
0
1
0
0
0
0
1/H
0
0
0
0
1
0
0
0
u x3
0
u y3
0
u x4
0
u y4 .
0
u x5
0
u y5
0
1
(E9.29)
921
(d)
Solutions to Exercises
1 1
u x2
0
=
,
u x4
1 1
0
1 1
u y2
0
=
,
For u y2 = u y4 : w
u y4
1 1
0
1
1/H
1/H
2
0
2
2
For 2 = (u x5 u x3 )/H : w 1/H
1/H
u x3 = 0
1/H
1/H 1/H 2 1/H 2
u x5
0
For u x2 = u x4 :
(E9.30)
Scaled versions of the latter (for example, using H 2 + u x3 u x5 = 0 as MFC) are also OK as answers.
(e)
K
I
TT
I
0
0
T
0
0
u
f
0
0
(E9.31)
Eliminating u and , in that order, yields TT KTu = Tu, which is the equation of the master-slave method.
EXERCISE 9.8 Never assigned.
EXERCISE 9.9 Solution given in paper [48].
921