Shape Function Generatio
Shape Function Generatio
Shape Function Generatio
requirements
Basic Concept of the Finite Element Method
T T
Approximate Piecewise
Exact Analytical Solution Linear Solution
x x
- 2
Basic Concept of the Finite Element Method
T
T T
T1 T1
T2 T2
T3 T3
T4 T5 T4 T5
x x
Piecewise Linear Approximation Piecewise Quadratic Approximation
Temperature Continuous but with Temperature and Temperature Gradients
Discontinuous Temperature Gradients Continuous
- 3
Basic Concept of the Finite Element Method
Common Approximation Schemes
One-Dimensional Examples
Polynomial Approximation
Most often polynomials are used to construct approximation functions for each
element. Depending on the order of approximation, different numbers of element
parameters are needed to construct the appropriate function.
Special Approximation
For some cases (e.g. infinite elements, crack or other singular elements) the approximation
function is chosen to have special properties as determined from theoretical considerations
- 4
Requirements for Shape Functions
The finite elements that satisfy this property are called conforming, or compatible.
(The use of elements that violate this property, nonconforming or incompatible
elements is however common)
- 5
Requirements for Shape Functions
Requirement for Compatibility:
The shape functions should provide displacement continuity between elements.
Physically this insure that no material gaps appear as the elements deform. As the
mesh is refined, such gaps would multiply and may absorb or release spurious
energy.
2. The requirement for completeness: The element shape functions must represent
exactly all polynomial terms of order m in the Cartesian coordinates. A set of
shape functions that satisfies this condition is called m-complete.
- 8
Requirements for Shape Functions
- 9
Requirements for Shape Functions
3. Completeness
Rigid body mode
Constant strain states
- 10
Lagrange Interpolation Functions
0 1 k 1 k 1 m m
i .
k 0 k 1 k k 1 k k 1 k m
L ( m)
i 0 k i
k
ik
No -k term! Lagrange
polynomial
of order m
at node k
- 11
Lagrange Interpolation Functions
1 , i j
Ni ( j )
0 , i j
1
N1 (1 )
2
1
N 2 (1 )
2
(1) 1 1 (2)
1
N1 (1 )
2
N 2 (1 )(1 )
1
(2) (3)
N 3 (1 )
(1) 2
- 12
Lagrange Interpolation Functions
9 1 1
N1 (1 )( )( )
16 3 3
27 1
N2 (1 )(1 )( )
16 3
27 1
N3 (1 )(1 )( )
16 3
(1) (2) (3) (4) 9 1 1
N 4 ( )( )(1 )
16 3 3
- 13
Lagrange Interpolation Functions
0 1 2 4 5 .
3
L(5)
3 0 3 1 3 2 3 4 3 5
- 14
Shape Functions of Plane Elements
Lagrangian Elements:
Order n element has (n+1)2 nodes arranged in square-
symmetric pattern requires internal nodes.
- 16
Rectangular elements Lagrange family
- 17
Rectangular elements Lagrange family
- 18
Rectangular elements Lagrange family
- 19
Rectangular elements Lagrange family
- 20
Rectangular elements Lagrange family
- 21
Rectangular elements Lagrange family
Check of completeness
A set of shape functions is complete for a continuum element if they can
represent exactly any linear displacement motions such as :
(1)
The nodal point displacements corresponding to this displacement field are :
(2)
The displacements (1) have to be obtained within the element when the element
nodal point displacements are given by (2).
In the isoparametric formulation we have the displacement interpolation :
- 23
Rectangular elements Lagrange family
to obtain :
(3)
The displacements defined in (3) are the same as those given (1), provided that
for any point in the element :
(4)
The relation (4) is the condition on the interpolation functions for the
completeness requirements to be satisfied.
- 24
Rectangular elements Lagrange family
- 25
Rectangular elements Lagrange family
- 26
Rectangular elements Serendipity elements
- 27
Rectangular elements Serendipity elements
Rectangles of boundary node (serendipity) family: (a) linear, (b) quadratic, (c) cubic, (d) quartic.
- 28
Rectangular elements Serendipity elements
- 29
Rectangular elements Serendipity elements
- 30
Rectangular elements Serendipity elements
Serendipity Shape functions
In general serendipity shape functions can be obtained with the following
expression:
- 31
Rectangular elements Serendipity elements
- 32
Rectangular elements Serendipity elements
27 1
N5 (1 2 )( )(1 )
32 3
27 1
N6 (1 )( )(1 )
2
32 3
1 2 1 2 1
N1 (1 )(1 ) N 5 N6 N 9 N12
4 3 3 3 3
1
Ni ( , ) (1 i )(1 i ) 9( 2 2 ) 10 , i 1, 2, 3, 4
32
9
Ni ( , ) (1 2 )(1 i )(1 9i ), i 5, 6 , 7 , 8
32
9
Ni ( , ) (1 i )(1 2 )(1 9i ), i 9, 10, 11, 12
32
- 33
Reference:
Zienkiewicz O.C. , Taylor R.L. , Zhu J.Z. : The Finite Element Method:
Its Basis and Fundamentals, 6. Edition, Elsevier ButterworthHeinemann,
2005.
- 34