4-1 COMPUTATIONAL ASPECTS

FEM PROCESS

PRE-PROCESSING

SOLVE EQUATIONS

POST-PROCESSING

Finite Element Methods © 2004 Kent L. Lawrence 1/20/2011 4- p1

 4-2 FACTORIZATION METHODS
EQUATION SOLUTIONS

LINEAR PROBLEM K (D ) = (R )
FACTORIZATION
[ ]
(D ) = [K ]−1 (R )
[K ]−1 is very expensive
[K ](D ) = [L][L]T (D )
[L]→ Lower Triangular Matrix
[L]T (D ) = (Y ) → Temp. Variable

⇒ (R ) = [L](Y )

Finite Element Methods © 2004 Kent L. Lawrence 1/20/2011 4- p2

  R1  l11 0 0 L Y1 
  
 R2  l21 l22 0 L Y2 
 M  = l l l33 
L M
 
   31 32  
R 
 n  M M M O Yn 

R1
1st Equation R1 = l11Y1 ⇒ Y1 =
l11
( R2 − l21Y1 )
2nd Equation R2 = l21Y1 + l22Y2 ⇒ Y2 =
l22
M M
FORWARD SUBSTITUTION

Finite Element Methods © 2004 Kent L. Lawrence 1/20/2011 4- p3

 (Y ) = [L]T (D)
 Y1  l11 l21 l31 L  D1 
  
 Y2   0 l22 l23 L  D2 
 M = 0 0 O 
L M 
 
    
Y 
 n  M M M lnn   Dn 
Yn
Last Equation Yn = lnn Dn ⇒ Dn =
lnn
Next Last Equation Dn −1 = L
M

BACKWARD SUBSTITUTION

Finite Element Methods © 2004 Kent L. Lawrence 1/20/2011 4- p4

 [L][DIA][U ] = [K ]
How to find L ? [ ]
3 x 3 CASE
[L][L]T = [K ]
Knowing [K ]Find
, [L]
k11 k12 k13  l11 0 0  l11 l21 l31 
k k k  = l l 0  0 l l 
 21 22 23   21 22  22 32 

k31 k32 k33  l31 l32 l33   0 0 l33 

k11 = l112 + 0 + 0
Multiply Terms
l11 = k11

Finite Element Methods © 2004 Kent L. Lawrence 1/20/2011 4- p5

 k12 = l11l21 + 0
k12
l21 =
l11

Factor [K ]into [L ]
Fixed number of operations
Sparse [K ]→ Sparse [L ]

Finite Element Methods © 2004 Kent L. Lawrence 1/20/2011 4- p6

 4-3 BANDWIDTH
TRUSSES × × 0
[K ] = × × ×
0 × ×

× × 0  × 
× × ×  × × 0 
   
[K ] =  × × ×  [L] =  × × 
   
 × × ×  × × 
 0 × ×  0 × ×
BAND STRUCTURE
Finite Element Methods © 2004 Kent L. Lawrence 1/20/2011 4- p7
 SIZE AND DIMENSIONALITY

10 NODE TRUSS PROBLEM

1 DOF/NODE
DIMENSIONS OF K = 10× 10 [ ]

10 x 10 NODE 2D PROBLEM
100 NODES,
2 DOF/NODE
DIMENSIONS OF K = 200× 200[ ]

10 x 10 x 10 NODE 3D PROBLEM
1000 NODES,
3 DOF/NODE
[ ]
DIMENSIONS OF K = 3000× 3000

Finite Element Methods © 2004 Kent L. Lawrence 1/20/2011 4- p8

 NODE NUMBERING - BANDWIDTH

2D TRUSS EXAMPLE semi bandwidth

4 5 6 1 2 3 4 5 6
× × 0 × 0 0 1
× × × × × 0 2

0 × × 0 × × 3
1 2 3 [K ] =  
1 2 3 4 5 6 × × 0 × × 0 4

× × × 0 0 0 1 0 × × × × × 5
×  
 × × × 0 0 2 0 0 × 0 × × 6

× × × × × 0 3 2 4 6
[K ] =  
0 × × × × × 4
0 0 × × × × 5
 
0 0 0 × × × 6 1 3 5
Finite Element Methods © 2004 Kent L. Lawrence 1/20/2011 4- p9
 4-4 ITERATIVE METHODS

DIRECT METHOD
Solution
Time to

ITERATIVE METHODS

No. of Equations

[K ](D ) = (R )
Finite Element Methods © 2004 Kent L. Lawrence 1/20/2011 4- p10
 fin

Finite Element Methods © 2004 Kent L. Lawrence 1/20/2011 4- p11