Académique Documents
Professionnel Documents
Culture Documents
rectangular elements
linear basis functions quadratic basis functions
Scope: Understand the origin and shape of basis functions used in classical finite element techniques.
u ( x) = ci i
i =1
where i is the number of grid points (the edges of our elements) defined at locations xi. As the basis functions look the same in all elements (apart from some constant) we make life easier by moving to a local coordinate system
x xi = xi +1 xi
so that the element is defined for x=[0,1].
u ( ) = c1 + c2
Our node points are defined at 1,2=0,1 and we require that
u1 = c1 u2 = c1 + c2
c1 = u1 c2 = u1 + u2
1 0 A= - 1 1
c = Au
u ( ) = u1 + (u1 + u 2 ) = u1 (1 ) + u2 = u1 N1 ( ) + N 2 ( )
.. and N1,2(x) are the linear basis functions for 1-D elements.
u ( ) = c1 + c2 + c3 2
Our node points are defined at 1,2,3=0,1/2,1 and we require that
u1 = c1 u2 = c1 + 0.5c2 + 0.25c3 u3 = c1 + c2 + c3
0 0 1 A= 3 4 1 2 4 2
Finite element method basis functions
5
c = Au
u ( ) = c1 + c2 + c3 2 = u1 (1 3 + 2 2 ) + u2 (4 4 2 ) + u3 ( + 2 2 ) = ui N i ( )
i =1 3
... note that now we re using three grid points per element ... Can we approximate a constant function?
u ( ) = c1 + c2 + c3 2 + c4 3 N1 ( ) = 1 3 2 + 2 3 N 2 ( ) = 2 2 + 3 N 3 ( ) = 3 2 2 3 N 4 ( ) = 2 + 3
... note that here we need derivative information at the boundaries ... How can we approximate a constant function?
Finite element method basis functions
7
P3 P2 P1 x
before
P3
P1
P2
after
x = x1 + ( x2 x1 ) + ( x3 x1 ) y = y1 + ( y2 y1 ) + ( y3 y1 )
using counterclockwise numbering. Note that if =0, then these equations are equivalent to the 1D tranformations. We seek to approximate a function by the linear form
u ( , ) = c1 + c2 + c3
we proceed in the same way as in the 1-D case
c = Au
1 0 0 A= 1 1 0 1 0 1
Finite element method basis functions
1 0 A= - 1 1
10
N1 ( , ) = 1 N 2 ( , ) = N 3 ( , ) =
11
u ( x, y ) = 1 + 2 x + 3 y + 4 x + 5 xy + 6 y
u ( , ) = c1 + c2 + c3 + c4 2 + c5 + c6 2
P3 P1 (0,0) P2 (1,0) P3 (0,1) P4 (1/2,0) P5 (1/2,1/2) P6 (0,1/2)
+
P6
P5
P1
P4
P2
12
P3
P6 + P+ 1
+
P4
P5
P2
... and by matrix inversion we can calculate the coefficients as a function of the values at Pi
c = Au
13
c = Au
0 0 0 0 0 1 3 1 0 4 0 0 3 0 1 0 0 4 A= 2 2 0 4 0 0 4 0 0 4 4 4 0 2 0 0 4 2
P3
P6 + P+ 1
+
P4
P5
P2
N1 ( , ) = (1 )(1 2 2 ) N 2 ( , ) = (2 1) N 3 ( , ) = (2 1) N 4 ( , ) = 4 (1 ) N 5 ( , ) = 4 N 2 ( , ) = 4 (1 )
... and they look like ...
Finite element method basis functions
14
P6 + P+ 1
+ + P
P5
+2
15
P6 + P+ 1
+ + P
P5
+2
16
rectangles: transformation
Let us consider rectangular elements, and transform them into a local coordinate system
P4
P3
P4 P3
P1
P2 x
before
P1
P2
after
17
u ( , ) = c1 + c2 + c3 + c4
we obtain matrix A as
1 0 1 1 A= 1 0 1 1
0 0 0 1 1 1 0 0
N1 ( , ) = (1 )(1 ) N 2 ( , ) = (1 ) N 3 ( , ) = N 4 ( , ) = (1 )
Finite element method basis functions
18
P4
u ( , ) = c1 + c2 + c3 + c4 2 + c5 + c6 2 + c7 2 + c8 2
we obtain an 8x8 matrix A ... and a basis function looks e.g. like
P7
P3
+ P8
N2
+ P6
P5
P1
P2
19
The basis functions for finite element problems can be obtained by: Transforming the system in to a local (to the element) system Making a linear (quadratic, cubic) Ansatz for a function defined across the element. Using the interpolation condition (which states that the particular basis functions should be one at the corresponding grid node) to obtain the coefficients as a function of the function values at the grid nodes. Using these coefficients to derive the n basis functions for the n node points (or conditions).
20