Finite Element Method (CG NOTE 2)
Finite Element Method (CG NOTE 2)
Finite Element Method (CG NOTE 2)
CG FEM NOTE 2
Finite Element Method
( ) ( ) ( ) ( ) ( )
2
''' 2 ''
1 1 2 2 3 3
''' 2
1 1
( ) 1 1
2
The solution can also be approximated as:
T ......
For N=3, If compared with analytical solution, then
and 1
2
L
N
N N
q L x q L x
T x T
k L k L
x a x a x a x a x
q L
a
k
(
| | | |
= + +
(
| |
\ . \ .
(
= + + + +
= =
2
''
2 2
3 3
and 1
and 1
L
x
L
q L x
a
k L
a T
(
| |
(
|
\ .
(
(
| |
= =
|
(
\ .
= =
2 | P a g e
CG FEM NOTE 2
Element arrangement for 1-D conduction problem
Galerkins method of FEM formulation
( ) ( ) ( )
( )
( )
( ) ( )
( )
2
1 1 2 2
1
2
1 1 1
Fo r a n y e le m e n t - e
T N T + N T N T
N o w ,
T ( ) N T
n u m b e r o f e le m e n t s i n t h e c o m p u t a t i o n a l d o m a i n
j
e e e e
j j
j
j N M
e N
i i j j
i e j
x
x a x x
M
=
=
=
= = =
= =
= =
=
3 | P a g e
CG FEM NOTE 2
To minimize global error over the entire domain the error is integrated over the domain w.r.t.
a residual function.
In case of Galerkins method,
Now it can be written
( ) ( ) ( )
T T e
N N
x x x = +
( )
'''
L T 0
N
N
d d T
k q
d x d x
| |
= + =
|
\ .
( )
'''
0 f o r 1 i N
0 f o r 1 i N
N
i
N
i
w L T d x
d d T
w k q d x
d x d x
O
O
s s
| |
+ s s
|
\ .
}
}
( ) ( )
i i
w x x =
( )
'''
0
0
1 i N
T h e s eco n d d er i va t i ve t e rm i n t h e eq u at i o n
m ay b e r ed u ced t o f i r s t d er i v at i ve t erm b y
a p p lyi n g i n t e g r at i o n b y p ar t s .
L
N
i
d d T
x k q d x
d x d x
f o r
(
| |
+
( |
\ .
s s
}
4 | P a g e
CG FEM NOTE 2
As the derivative is reduced in order by 1 the statement now called Galerkins weak
statement and termed as WS.
Term by term Formulation is shown in the next page
L
N
i
0
L
N
i
0
L
'''
i
0
d d T
W S = k d x -
d x d x
d d d T
k d x d x
d x d x d x
+ q d x 0
(
| |
( |
\ .
(
| |
( |
\ .
=
}
} }
}
2
1 1
'''
1
1
1
0
For 1 i 2
are Kronecker delta for boundary
condition specification.
e
e
M
j
h e
i
j
e j
M
i i eM i e
e
e eM
dN
dN
WS k dxT
dx dx
dT dT
N q dx N k N k
dx dx
and
= =
O
=
O
(
| |
( = |
|
(
\ .
(
+ + =
(
(
s s
}
}
5 | P a g e
CG FEM NOTE 2
Problem: for M=2, perform FEM
{ }
{ } { }
{ }
{ }
1
i = 1
1
i = 2
( )
( )
1
1
0
( )
2
0
( )
1 1
1 1
1 1
1 1
1 1
1 1
i
e
e
j e i
j
e
e
e
j
e
e
j
e
j
d N
d x
d N
d N
k d x T
d x d x
k d x T
e e
k
d x T
e
k
T
e
A
+
A
O
A
=
A A
(
=
(
A
(
=
(
A
}
}
}
( )
{ }
'''
1 ''' '''
2
0
1
'''
1
1
1
1 2
Therefore, WS
1 1 1 0
=
1 1 1 0 2
e
i
e
M
e h
e
M
e
e
e
eM
N
q e
N q dx q dx
N
WS
k q e dT
T k
e dx
A
O
=
=
A
= =
` `
) )
=
| |
( A
+ + =
| ` ` `
(
A
) ) )
\ .
} }
6 | P a g e
CG FEM NOTE 2
For M=2 the discretization scheme
When two element-matrixes are combined, it gives the global matrix for all over
the domain of analysis.
{ }
( )
{ }
( )
( )
'''
1
11
1
'''
1
''
''
1 1 1
1: WS
1 1 1 0 2
1 1 1 1 / 2
1 1 1 0 / 2 2
: =q at x = 0.
e k q e dT
e T k
e dx
q L
k
T q
L
dT
Note k
dx
=
( A
= = + +
` `
(
A
) )
(
= + +
` `
(
) )
{ }
( )
{ }
( )
( )
{ }
( )
{ }
( )
'''
2
2
22
'''
2
1
1
2
2
1
2
2:
0 1 1 1
WS
1 1 1 2
1 1 1 0 / 2
1 1 1 1 / 2 2
: =
=
e
e
k q e dT
T k
e dx
q L
k dT
T k
L dx
T
Note T
T
T
T
T
=
=
( A
= + +
` `
(
A
) )
(
= + +
` `
(
) )
`
)
`
)
| | { }
1
2
3
,
K = G l o b a l d i f f u s i o n m a t r i x
b = G l o b a l l o a d m a t r i x
T
K T b
T
W h e r e
=
`
)
7 | P a g e
CG FEM NOTE 2
| | | |
( )
2
1
1 1 0 0 0 0
2 2
1 1 0 0 1 1
0 0 0 0 1 1
1 1 0
2
1 2 1
0 1 1
e
M
e
N o w
K K
k k
L L
k
L
=
=
=
( (
( (
=
( (
( (
(
(
=
(
(
{ } { }
( )
2
1
''
''' '' '
,
1 0 0
1 0 1 0
4 4
0 0 0
e
e
S i m i l a r l y
b b
q
q L q L
d T
k
d x
=
=
=
` ` ` `
) )
)
)
{ } { }
( )
2
1
''
''' '''
,
1 0 0
1 0 1 0
4 4
0 0 0
e
e
S i m i l a r l y
b b
q
q L q L
d T
k
d x
=
=
=
` ` ` `
) )
)
)
8 | P a g e
CG FEM NOTE 2
1
2
3
' '
' ' ' 2
2
t h r o u g h a l l t h e t e r m s b y - ,
1 1 0
1 2 1
0 1 1
1
2 0
8 2
1
k
D i v i d i n g
L
T
T
T
q
q L L
k k
d T
k
d x
(
(
`
(
(
)
= +
` `
)
)
3
1 2
' ' '
' '
1
' ' ' 2
2
3
t h e b o u n d a r y c o n d i t i o n a t x = L i s T = T
T a n d T a r e o n l y t w o u n k n o w n t e m p e r a t u r e s .
T h e m a t r i x e q u a t i o n r e d u c e s t o :
2 4
1 1 0
1 2 1
4
0 1 1
L
L
A s T
o n l y
L q L
q
k k
T
q L
T
k
T
T
=
| |
+
|
\ .
(
(
=
`
(
(
)
' ' '
' '
1
' ' ' 2
2
, t h e m a t r i x e q u a t i o n i s r e d u c e d t o 2 x 2 m a t r i x
1 1
2 4
1 2
4
L
O r
L q L
q
T
k k
T
q L
T
k
`
)
| |
+
|
(
\ .
=
` `
(
)
+
)
3
1 2
' ' '
' '
1
' ' ' 2
2
3
t h e b o u n d a r y c o n d i t i o n a t x = L i s T = T
T a n d T a r e o n l y t w o u n k n o w n t e m p e r a t u r e s .
T h e m a t r i x e q u a t i o n r e d u c e s t o :
2 4
1 1 0
1 2 1
4
0 1 1
L
L
A s T
o n l y
L q L
q
k k
T
q L
T
k
T
T
=
| |
+
|
\ .
(
(
=
`
(
(
)
' ' '
' '
1
' ' ' 2
2
, t h e m a t r i x e q u a t i o n i s r e d u c e d t o 2 x 2 m a t r i x
1 1
2 4
1 2
4
L
O r
L q L
q
T
k k
T
q L
T
k
`
)
| |
+
|
(
\ .
=
` `
(
)
+
)