FEM Higher Order Elements

Download as pdf or txt
Download as pdf or txt
You are on page 1of 28

MANE 4240 & CIVL 4240

Introduction to Finite Elements


Higher order elements


Reading assignment:

Lecture notes
Summary:

Properties of shape functions
Higher order elements in 1D
Higher order triangular elements (using area coordinates)
Higher order rectangular elements
Lagrange family
Serendipity family
Recall that the finite element shape functions need to satisfy the
following properties

1. Kronecker delta property

=
nodes other all at
i node at
N
i
0
1
...
2 2 1 1
+ + = u N u N u
Inside an element
At node 1, N
1
=1, N
2
=N
3
==0, hence
1
1
u u
node
=
Facilitates the imposition of boundary conditions
2. Polynomial completeness

y y N
x x N
N
i
i
i
i
i
i
i
i
=
=
=

1
y x u If
3 2 1
+ +
Then
Higher order elements in 1D
2-noded (linear) element:
1
2
x
2
x
1
1 2
1
2
2 1
2
1
x x
x x
N
x x
x x
N

=
In local coordinate system (shifted to center of element)
1
2
x

a a
a
x a
N
a
x a
N
2
2
2
1
+
=

=
x

3-noded (quadratic) element:
1
2
x
2
x
1
( )( )
( )( )
( )( )
( )( )
( )( )
( )( )
2 3 1 3
2 1
3
3 2 1 2
3 1
2
3 1 2 1
3 2
1
x x x x
x x x x
N
x x x x
x x x x
N
x x x x
x x x x
N


=


=


=
In local coordinate system (shifted to center of element)
1
2
x

a a
( )
( )
2
2 2
3
2
2
2
1
2
2
a
x a
N
a
x a x
N
a
x a x
N

=
+
=

=
3
x
3
x

a x x a x = = =
3 2 1
; 0 ;
3
4-noded (cubic) element:
1
2
x
2
x
1
( )( )( )
( )( )( )
( )( )( )
( )( )( )
( )( )( )
( )( )( )
( )( )( )
( )( )( )
3 4 2 4 1 4
3 2 1
4
4 3 2 3 1 3
4 2 1
3
4 2 3 2 1 2
4 3 1
2
4 1 3 1 2 1
4 3 2
1
x x x x x x
x x x x x x
N
x x x x x x
x x x x x x
N
x x x x x x
x x x x x x
N
x x x x x x
x x x x x x
N


=


=


=


=
In local coordinate system (shifted to center of element)
1 2
2a/3

x

a a
) 3 / )( 3 / )( (
16
27
) )( 3 / )( (
16
27
) 3 / )( 3 / )( (
16
9
) 3 / )( 3 / )( (
16
9
3
4
3
3
3
2
3
1
a x a x a x
a
N
x a x a x a
a
N
a x a x a x
a
N
a x a x a x
a
N
+ =
+ =
+ + =
+ =
3
x
3
x

x
4
4
3
4
2a/3

2a/3

Polynomial completeness
M
4
3
2
1
x
x
x
x
2 node; k=1; p=2
3 node; k=2; p=3
4 node; k=3; p=4
Convergence
rate (displacement)
1 ;
0
+ = k p Ch u u
p
h
Recall that the convergence in displacements
k=order of complete polynomial
Triangular elements
Area coordinates (L
1
, L
2
, L
3
)
1
A=A
1
+A
2
+A
3
Total area of the triangle
At any point P(x,y) inside
the triangle, we define
A
A
L
A
A
L
A
A
L
3
3
2
2
1
1
=
=
=
Note: Only 2 of the three area coordinates are independent, since
x
y
2
3
P
A
1
A
2
A
3
L
1
+L
2
+L
3
=1

A
y c x b a
L
i i i
i
2
+ +
=
1 2 3 2 1 3 1 2 2 1 3
3 1 2 1 3 2 3 1 1 3 2
2 3 1 3 2 1 2 3 3 2 1
3 3
2 2
1 1
x 1
x 1
x 1
det
2
1
x x c y y b y x y x a
x x c y y b y x y x a
x x c y y b y x y x a
y
y
y
triangle of area A
= = =
= = =
= = =
(
(
(

= =
Check that
y y L y L y L
x x L x L x L
L L L
= + +
= + +
= + +
3 3 2 2 1 1
3 3 2 2 1 1
3 2 1
1
x
y
2
3
P
A
1
1
L
1
= constant
P
Lines parallel to the base of the triangle are lines of constant L
We will develop the shape functions of triangular elements in
terms of the area coordinates
x
y
2
3
P
A
1
1
L
1
= 0
L
1
= 1
L
2
= 0
L
2
= 1
L
3
= 0
L
3
= 1
For a 3-noded triangle
3 3
2 2
1 1
L N
L N
L N
=
=
=
x
y
2
3
1
L
1
= 0
L
1
= 1
L
2
= 0
L
2
= 1
L
3
= 0
L
3
= 1
For a 6-noded triangle
L
1
= 1/2
L
2
= 1/2
L
3
= 1/2
4
5
6
How to write down the expression for N
1
?
Realize the N
1
must be zero along edge 2-3 (i.e., L
1
=0) and at
nodes 4&6 (which lie on L
1
=1/2)
( )( ) 2 / 1 0
1 1 1
= L L c N
Determine the constant c from the condition that N
1
=1 at
node 1 (i.e., L
1
=1)
( )( )
( ) 2 / 1 2
2
1 2 / 1 1 1 ) 1 (
1 1 1
1 1
=
=
= = =
L L N
c
c L at N
1 3 6
2 3 5
2 1 4
3 3 3
2 2 2
1 1 1
4
4
4
) 2 / 1 ( 2
) 2 / 1 ( 2
) 2 / 1 ( 2
L L N
L L N
L L N
L L N
L L N
L L N
=
=
=
=
=
=
x
y
2
3
1
L
1
= 0
L
1
= 1
L
2
= 0
L
2
= 1
L
3
= 0
L
3
= 1
For a 10-noded triangle
L
1
= 2/3
L
2
= 2/3
L
3
= 1/3
L
3
= 2/3
L
2
= 1/3
L
1
= 1/3
5
4
6
7
8
9
10
3 2 1 10
3 3 2 7
2 3 2 6
2 2 1 5
1 2 1 4
3 3 3 3
2 2 2 2
1 1 1 1
27
:
) 3 / 1 (
2
27
) 3 / 1 (
2
27
) 3 / 1 (
2
27
) 3 / 1 (
2
27
) 3 / 2 )( 3 / 1 (
2
9
) 3 / 2 )( 3 / 1 (
2
9
) 3 / 2 )( 3 / 1 (
2
9
L L L N
L L L N
L L L N
L L L N
L L L N
L L L N
L L L N
L L L N
=
=
=
=
=
=
=
=
NOTES:
1. Polynomial completeness
3 node; k=1; p=2
6 node; k=2; p=3
10 node; k=3; p=4
Convergence
rate (displacement)
L
3 2 2 3
2 2
1
y xy y x x
y xy x
y x
2. Integration on triangular domain
)! 1 (
! !
. 2
)! 2 (
! ! !
2 . 1
2 1
2 1
2 1
3 2 1
m k
m k
l dS L L
n m k
n m k
A dA L L L
edge
m k
A
n m k
+ +
=
+ + +
=

1
x
y
2
3
l
1-2
3. Computation of derivatives of shape functions: use chain rule
x
L
L
N
x
L
L
N
x
L
L
N
x
N
i i i i

3
3
2
2
1
1
e.g.,
But
A
b
x
L
A
b
x
L
A
b
x
L
2
;
2
;
2
3 3 2 2 1 1
=

e.g., for the 6-noded triangle


A
b
L
A
b
L
x
N
L L N
2
4
2
4
4
1
2
2
1
4
2 1 4
+ =

=
Rectangular elements
Lagrange family
Serendipity family
Lagrange family
4-noded rectangle
x
y
a
a
1 2
3 4
b
b
In local coordinate system
ab
y b x a
N
ab
y b x a
N
ab
y b x a
N
ab
y b x a
N
4
) )( (
4
) )( (
4
) )( (
4
) )( (
4
3
2
1
+
=

=
+
=
+ +
=
9-noded quadratic
x
y
a
a
1 2
3 4
b
b
Corner nodes
(

+
=
(


=
(

+
(


=
(

+
(

+
=
2 2
4
2 2
3
2 2
2
2 2
1
2
) (
2
) (
2
) (
2
) (
2
) (
2
) (
2
) (
2
) (
b
y b y
a
x a x
N
b
y b y
a
x a x
N
b
y b y
a
x a x
N
b
y b y
a
x a x
N
5
6
7
8 9
Midside nodes
(

+
=
(


=
(


=
(

+
(


=
2
2 2
2
8
2 2
2 2
7
2
2 2
2
6
2 2
2 2
5
2
) (
2
) (
2
) (
2
) (
b
y b
a
x a x
N
b
y b y
a
x a
N
b
y b
a
x a x
N
b
y b y
a
x a
N
Center node
(


=
2
2 2
2
2 2
9
b
y b
a
x a
N
5 4 3 2 2 3 4 5
4 3 2 2 3 4
3 2 2 3
2 2
1
y xy y x y x y x x
y xy y x y x x
y xy y x x
y xy x
y x
NOTES:
1. Polynomial completeness
4 node; p=2
9 node; p=3
Convergence
rate (displacement)
Lagrange shape functions contain higher order terms but miss
out lower order terms
Serendipity family
Then go to the corner nodes. At each corner
node, first assume a bilinear shape function as in
a 4-noded element and then modify:
2 2

4
) )( (

8 5
1 1
1
N N
N N
ab
y b x a
N
=
+ +
=
x
y
a
a
1 2
3 4
b
b
5
6
7
8
First generate the shape functions of the
midside nodes as appropriate products of
1D shape functions, e.g.,
(

+
=
(

+
(


=
2
2 2
8
2
2 2
5
2
) (
;
2
) (
b
y b
a
x a
N
b
y b
a
x a
N
4-noded same as Lagrange
8-noded rectangle: how to generate the shape functions?
bilinear shape fn at node 1:
actual shape fn at node 1:
Corner nodes
2 2 4
) )( (
2 2 4
) )( (
2 2 4
) )( (
2 2 4
) )( (
7 8
4
7 6
3
6 5
2
8 5
1
N N
ab
y b x a
N
N N
ab
y b x a
N
N N
ab
y b x a
N
N N
ab
y b x a
N

+
=

=

+
=
+ +
=
x
y
a
a
1 2
3 4
b
b
5
6
7
8
Midside nodes
(

+
=
(


=
(


=
(

+
(


=
2
2 2
8
2
2 2
7
2
2 2
6
2
2 2
5
2
) (
2
) (
2
) (
2
) (
b
y b
a
x a
N
b
y b
a
x a
N
b
y b
a
x a
N
b
y b
a
x a
N
8-noded rectangle
5 4 3 2 2 3 4 5
4 3 2 2 3 4
3 2 2 3
2 2
1
y xy y x y x y x x
y xy y x y x x
y xy y x x
y xy x
y x
NOTES:
1. Polynomial completeness
4 node; p=2
8 node; p=3
Convergence
rate (displacement)
12 node; p=4
16 node; p=4
More even distribution of polynomial terms than Lagrange
shape functions but p cannot exceed 4!

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy