Lecture Notes: Introduction to Finite Element Method

Chapter 4. FE Modeling and Solution Techniques

II. Substructures (Superelements)

Substructuring is a process of analyzing a large structure as
a collection of (natural) components. The FE models for these
components are called substructures or superelements (SE).

Physical Meaning:
A finite element model of a portion of structure.

Mathematical Meaning:
Boundary matrices which are load and stiffness matrices
reduced (condensed) from the interior points to the exterior or
boundary points.

1998 Yijun Liu, University of Cincinnati

107

Lecture Notes: Introduction to Finite Element Method

Chapter 4. FE Modeling and Solution Techniques

Advantages of Using Substructures/Superelements:

Large problems (which will otherwise exceed your
computer capabilities)
Less CPU time per run once the superelements have
been processed (i.e., matrices have been saved)
Components may be modeled by different groups
Partial redesign requires only partial reanalysis (reduced
cost)
Efficient for problems with local nonlinearities (such as
confined plastic deformations) which can be placed in
one superelement (residual structure)
Exact for static stress analysis

Disadvantages:
Increased overhead for file management
Matrix condensation for dynamic problems introduce
new approximations
...

1998 Yijun Liu, University of Cincinnati

108

Lecture Notes: Introduction to Finite Element Method

Chapter 4. FE Modeling and Solution Techniques

III. Equation Solving

Direct Methods (Gauss Elimination):
Solution time proportional to NB2 (N is the dimension of
the matrix, B the bandwidth)
Suitable for small to medium problems, or slender
structures (small bandwidth)
Easy to handle multiple load cases

Iterative Methods:
Solution time is unknown beforehand
Reduced storage requirement
Suitable for large problems, or bulky structures (large
bandwidth, converge faster)
Need solving again for different load cases

1998 Yijun Liu, University of Cincinnati

109

Lecture Notes: Introduction to Finite Element Method

Chapter 4. FE Modeling and Solution Techniques

Gauss Elimination - Example:

8 2 0 x1 2
2 4 3x = 1

x 3 3
0 3 3

or Ax = b .

Forward Elimination:
Form

(1) 8 2 0
(2) 2 4 3

(3)
0 3 3

2
1;

(1) + 4 x (2) (2):

(1) 8 2
0
(2) 0 14 12

(3)
3
0 3

(2) +

2
2;

14
(3) (3):
3

(1) 8 2
0
(2) 0 14 12

(3)
2
0 0

2
2;

12

Back Substitution:
x 3 = 12 / 2 = 6
x 2 = ( 2 + 12 x 3 ) / 14 = 5
x1 = (2 + 2 x 2 ) / 8 = 1.5

1998 Yijun Liu, University of Cincinnati

or

1.5

x = 5 .
6

110

Lecture Notes: Introduction to Finite Element Method

Chapter 4. FE Modeling and Solution Techniques

Iterative Method - Example:

The Gauss-Seidel Method
Ax = b

(A is symmetric)

or

aij x j = bi ,

i = 1, 2, ..., N .

j =1

Start with an estimate x( 0 ) and then iterate using the following:

xi

( k + 1)

bi

1
=
a ii

i 1

a ij x j

( k + 1)

j =1

a ij x j

for i = 1, 2, ..., N .

(k )

j=i+ 1

In vector form,
1

x ( k + 1) = A D b A L x ( k + 1) A L x ( k ) ,
T

where

A D = a ii is the diagonal matrix of A,

A L is the lower triangular matrix of A,
such that A = A D + A L + A L .
T

Iterations continue until solution x converges, i.e.

x ( k + 1) x ( k )
x(k )

where is the tolerance for convergence control.

1998 Yijun Liu, University of Cincinnati

111