Professional Documents
Culture Documents
Multi-Point Constraints
Multi-Point Constraints
Single point constraint examples
linear, homogeneous
linear, non-homogeneous
nonlinear, homogeneous
- 2
Multi-Point Constraints (Example)
Modelling of joints
Perfect connection ensured here
turbine blade
nodes at
turbine disc interface
(a) (b)
- 3
Multi-Point Constraints (Example)
Modelling of joints
v
u
Mismatch between DOFs of
beams and 2D solid beam is
free to rotate (rotation not
transmitted to 2D solid)
1
v Perfect connection by
u artificially extending
beam into 2D solid
1 (Additional mass)
- 4
Multi-Point Constraints (Example)
Modelling of joints
d1 d5 blade model
d 2 d 6 ad 7 d2 d6 d4
d1 d5 d3
d3 d5 d7
ad7
d 4 d 6 ad 7 d2 d6
d1
d5
2a disc model
- 5
Multi-Point Constraints (Example)
Node on neutral-
surface of the plate
Neutral surface
Rigid of the plate
body
- 6
Multi-Point Constraints (Example)
d6 = d1 + d5 or d1 + d5 - d6 = 0
d7 = d2 - d4 or d2 - d4 - d7 = 0
d8 = d3 or d3 - d8 = 0
d9 = d5 or d5 - d9 = 0
- 7
Multi-Point Constraints (Example)
Modelling of joints
dn = 0 v n
1
1 900
ui cos + vi sin=0 2 u
2
or ui+vi tan =0 3
y 3
for i=1, 2, 3
Axis of symmetry Axis of symmetry
x
- 9
Multi-Point Constraints (Example)
dx = 0.5(1-) d1 + 0.5(1+) d3
dy = 0.5(1-) d4 + 0.5(1+) d6 d6
d3
1
Substitute value of at node 2
1
Linear
Quad
d5
0
2 d2
0.5 d1 - d2 + 0.5 d3 =0
d4
0.5 d4 - d5 + 0.5 d6 =0 3 d1
-1
- 10
Multi-Point Constraints (Example)
d10
d2 = 0.251.5 d1 + 1.50.5 d3 - 0.250.5 d5 d5
1
d9 Quad
Quad 0.5
d4 = -0.250.5 d1 + 0.51.5 d3 + 0.251.5 d5 d4
d8
0
d7 d3
-0.5
d6 d2
-1
d1
- 11
Multi-Point Constraints (Example)
In x direction,
d10
In y direction, d5
1
d9 Quad
Quad 0.5
d8 d4
0.375 d6- d7+0.75 d8- 0.125 d10 = 0 0
d7 d3
-0.125 d6+0.75 d8 - d9 + 0.375 d10 = 0 d6 d2
-0.5
-1
d1
- 12
Multi-Point Constraints (Example)
Eliminate q1 and q2
- 13
Multi-Point Constraints
Incompressibility
- 14
Multi-Point Constraints
Master-Slave Elimination
- 15
Multi-Point Constraints
Example 1D Structure to Illustrate MPCs
Multi-Point constraint:
- 16
Multi-Point Constraints
- 17
Multi-Point Constraints- Master Slave Method
Recall:
Taking u as master:
- 18
Multi-Point Constraints- Master Slave Method
Unconstrained master
stiffness equations:
Master-slave transformation:
Congruential transformation:
- 19
Multi-Point Constraints- Master Slave Method
- 20
Multi-Point Constraints- Master Slave Method
- 21
Multi-Point Constraints- Master Slave Method
Multiple MPCs
Suppose
- 22
Multi-Point Constraints- Master Slave Method
Nonhomogeneous MPCs
In matrix form
- 23
Multi-Point Constraints- Master Slave Method
Nonhomogeneous MPCs
modified system:
in which:
- 24
Multi-Point Constraints- Master Slave Method
- 25
Multi-Point Constraints- Master Slave Method
DISADVANTAGES
requires user decisions
messy implementation for general MPCs
u2 = u6
- 27
Multi-Point Constraints- Penalty Function Method
- 28
Multi-Point Constraints- Penalty Function Method
Upon merging the penalty element the modified stiffness equations are
- 29
Multi-Point Constraints- Penalty Function Method
- 30
Multi-Point Constraints- Penalty Function Method
p
0 KU F CT CU + CT Q 0
dU
[K CT C]U F CT Q
Penalty matrix
- 31
Multi-Point Constraints- Penalty Function Method
= constant (1/h)p+1
p is the order of
element used
characteristic
size of element
1.0 10 46
max (diagonal elements in the
stiffness matrix)
or
1.0 10 5 8
Youngs modulus
- 32
Multi-Point Constraints- Penalty Function Method
DISADVANTAGES
selection of weight left to user
accuracy limited by ill-conditioning
- 33
Multi-Point Constraints- Lagrange Multiplier Method
- 34
Multi-Point Constraints- Lagrange Multiplier Method
Constant matrices
Optimization problem for solution of nodal degrees of freedom:
Find U to
1 T
Minimize: p U KU UT F
2
Subject to: CU - Q 0
- 37
Multi-Point Constraints- Lagrange Multiplier Method
1 2 m
T
(Lagrange multipliers)
Find U and to
1 T
Minimize: L U KU UT F T {CU Q} Added to functional
2
The stationary condition requires the derivatives of L with respect to the Ui and i to
vanish.
L
0 KU F CT 0 K CT
U F Matrix equation
dU
L C 0 Q is solved
0 CU Q 0
d
- 38
Multi-Point Constraints- Lagrange Multiplier Method
- 39
Multi-Point Constraints- Lagrange Multiplier Method
- 40
Multi-Point Constraints- Lagrange Multiplier Method
k (1)
- 41
Multi-Point Constraints- Lagrange Multiplier Method
k (2)
- 42
Multi-Point Constraints- Lagrange Multiplier Method
k (3)
- 43
Multi-Point Constraints- Lagrange Multiplier Method
k (4)
- 44
Multi-Point Constraints- Lagrange Multiplier Method
k (4)
- 45
Multi-Point Constraints- Lagrange Multiplier Method
k (5)
- 46
Multi-Point Constraints- Lagrange Multiplier Method
- 47
Multi-Point Constraints- Lagrange Multiplier Method
- 48
Multi-Point Constraints- Lagrange Multiplier Method
- 49
Multi-Point Constraints- Lagrange Multiplier Method
- 50
Multi-Point Constraints- Lagrange Multiplier Method
DISADVANTAGES
Difficult implementation
Total number of unknowns is increased
- 51
Multi-Point Constraints- Lagrange Multiplier Method
- 52
References
- 53