FEM Basic
FEM Basic
FEM Basic
Finite Element Method Pensyarah : Risby Mohd Sohaimi & Tan Keng Sen
1. Historical Background
1947
1953 1954 1956 1960 1960
Levy
Levy Argyris & Kelsey Turner, Clough, Martin, Topp Clough Turner et. al
1961
1961 1962
Melosh
Martin Gallagher et al
2. Basic Concepts The finite element method (FEM), or finite element analysis (FEA), is based on the idea of building a complicated object with simple blocks, or, dividing a complicated object into small and manageable pieces. Application of this simple idea can be found everywhere in everyday life as well as in engineering.
Area of one triangle: Area of the circle: where N = total number of triangles (elements).
Computer Implementations
Preprocessing (build FE model, loads and constraints) FEA solver (assemble and solve the system of equations) Post processing (sort and display the results)
line
b. 2D problem surface c. 3D problem solid
e. Form the system equation Assemble the element equations to obtain global system equation and introduce boundary conditions
stress field
Advantages
Irregular Boundaries General Loads Different Materials Boundary Conditions Variable Element Size Easy Modification Dynamics Nonlinear Problems (Geometric or Material)
Easy input - preprocessor. Solves many types of problems Modular design - fluids, dynamics, heat, etc. Can run on PCs now. Relatively low cost.
A is called a nxn (square) matrix, and x and b are (column) vectors of dimension n.
Matrix Addition and Subtraction For two matrices A and B, both of the same size (mxn), the addition and subtraction are defined by
Scalar Multiplication
Matrix Multiplication For two matrices A (of size lxm) and B (of size mxn), the product of AB is defined by
where i = 1,2,...,l; j = 1,2, ...,n. Note that, in general, AB BA, but (AB)C = A(BC)(associative).
Transpose of a Matrix
Symmetric Matrix
Note that AI = A, Ix = x.
Determinant of a Matrix
The determinant of square matrix A is a scalar number denoted by det A or |A|. For 2x2 and 3x3 matrices, their determinants are given by
and
Singular Matrix A square matrix A is singular if det A = 0, which indicates problems in the systems (nonunique solutions, degeneracy, etc.) Matrix Inversion For a square and nonsingular matrix A (detA 0), its inverse A-1 is constructed in such a way that AA-1 = A-1 A = I The cofactor matrix C of matrix A is defined by Cij = (-1)i+j Mij where Mij is the determinant of the smaller matrix obtained by eliminating the i th row and j th column of A.
If det A = 0 (i.e., A is singular), then A-1 does not exist! The solution of the linear system of equations (Eq.(1)) can be expressed as (assuming the coefficient matrix A is nonsingular) x = A-1 b Thus, the main task in solving a linear system of equations is to found the inverse of the coefficient matrix.
Differentiating a matrix:
d a dx
d aij dx
U U x U y
1 [x 2
x y
Integrating a matrix:
[a]dx
aij dx
x
xy
y
y
z
yz
Xb Yb Zb
0 0 0
x
xz
y
yz
z
z
Strain Displacement
u u v x xy x y x v u w y xz y z x w w v z yz z y z (u, v, w) are the x, y and z components of displacement
Stress-Strain Relationships
1
x
0 1 0 1 0 1 2 2 0 0
0 0 0 0 1 2 2 0
0
x
0
y
0
z
xy
E 1 2
0 0 0
0 0 0
0 0 0
0
xy
yz
0 1 2 2
yz
zx
zx
3D Stress-Strain Matrix
1 1 1 D 1 E 1 2 0 0 0 Note : G E 21 0 0 0 0 0 0 0 0 0 1 2 2 0 0 0 0 0 0 1 2 2 0 0 0 0 0 0 1 2 2
1 D E 1 1 0 0 1
0 0 2
Cramers Rule
a {x} {c} or in index notation :
n
a ij x j
j 1
ci
Let matrix [d (i) ] be matrix [a] with column i repaced by {c} . Then : d(i) xi a
Example:
Consider the following equations : x1 2x 1 3x 2 4x 2 4x 2 2x 3 2x 3 x3 3 2 1
Example:
In matrix form : 1 2 0 3 4 4 2 2 1 x1 x2 x3 2 1 3
Solving:
2 1 d( 1 ) x1 a 3 1 2 0 3 4 4 3 4 4 2 2 1 2 2 1 41 10 4.1
1 2 2 d( 2) x2 a 0 1 2 0 1 3 3 4 4
2 2 1 2 2 1 1 .1
1 2 d( 3) x3 a 0 1 2 0
4 1 4 3 4 4 3 2 2 1 1.4
Inversion
a a I x x
1
c a x a a
1 1
a c
Example
1 2 0 3 4 4 2 2 1 x1 x2 x3 2 1 3
Example
x1 x2 x3
1.1 0.1
0.2 0.2
2 1 3
0.4 0.2
Gaussian Elimination
General System of n equations with n unknowns:
a 11 a 21 a n1
a 12 a 22 an2
a1n a2n a nn
x1 x2 xn
c1 c2 cn
x1 x2 xn
c1 c2 cn
xn
xi
1 a 1, n a ii
n 1 r i 1
a ir x r
Example
2 2 1 x1 2 1 0 x2 1 1 1 x3
9 4 6
Eliminate the coefficient of x1 in every equation except the first one. Select a11 =2 as the pivot element.
Add the multiple -a21/ a11 = -2/2 = -1 of the first row to the second row. Add the multiple -a31/ a11 = -1/2=-0.5 of the first row to the third row.
Step 1
2 0 0
2 1 0
1 x1 1 x2 0.5 x 3
9 5 1.5
Step 2
2 0 0
2 1 0
1 x1 1 x2 0.5 x 3
9 5 1.5
x2
5 3 1
x2
9 2( 2) 3 2
Gauss-Seidel Iteration
Write equations in form : x1 x2 xn 1 cn a nn a n1 x 1 a n 2 x 2 a n .n 1 x n
1
1 c1 a11 1 c2 a 22
a12 x 2 a 21 x1
a13 x 3 a1n x n a 23 x 3 a 2n x n
Gauss-Seidel Iteration
Assume a set of initial values for unknowns. Substitute into RHS of first equation. Solve for new value of x1 Use new value of x1and assumed values of other xs to solve for x2 in second equation. Continue till new values of all variables are obtained. Iterate until convergence.
Example
4x1 x1 x2 4x 2 x2 x3 4x 3 x3 x1 1 x2 x4 2x 4 1 2 5 6 6 x3 1 x4 1
Example
x1 x2 x3 x4 1 1 1 1 4 4 4 2 2 x2 5 x1 6 x2 2 x3 1 x3 x4 1 2 4 2 1 3 4 3 1 4
1 5 4 1 6 1.68 4 2 1.67
Example
x1 x2 x3 x4 1 1 1 1 4 4 4 2 2 x2 5 x1 6 x2 2 x3 1 x3 x4 1 2 4 2 1.68 1 1 4 4 0.922 1.899 1.944
2 1.944
Iteration x1
0 1 2 3 4 Exact
4