Академический Документы
Профессиональный Документы
Культура Документы
and
Finite Element Method in 1D
Jayadeep U. B.
M.E.D., NIT Calicut
Ref.: Finite Elements and Approximation, Zienkiewicz,
O. C., and Morgan, K., John Wiley & Sons.
Introduction
Why Discretization?
The trial functions can not be chosen easily, which are defined
and with continuous derivatives over the complete domain.
Improving the accuracy necessitates increasing the number of
trial functions used, leading to highly complex formulation of
the problem.
The stiffness matrix obtained is generally complete (with nonzero elements at all positions) Computational complexity.
Generally, it is tough to find functions satisfying the B.C. for
complicated domains.
In F.E.M., the domain is discretized into a large number of
sub-domains, each of which will have simple geometry.
Any trial function will have non-zero magnitude only over
few adjacent sub-domains. The approxns over individual subdomains can be added to get global approxn.
Lecture - 01
Piecewise Approximation
The given function is approximated by a set of interpolation
functions, piece-wise continuous over the sub-domains
(elements). Each node has a trial function associated with it.
This gives another option for improving the accuracy
increase the number of sub-domains (elements).
1
2
= 1 N1 N2
x0 = 0
x1
x2
xl-1
xl
xl+1
xN-1
xN = L
Lecture - 01
Ni
Nj
i
x0 = 0
x2
x1
xi-1
e xi e+1 xj
xN-1
xN = L
Nj
Ni
i
x0 = 0
x1
x2
xl-1
xi
xj
xN-1
xN = L
( x j x)
( x xi )
Ni
and N j
( x j xi )
( x j xi )
Systematic Procedure:
Let N i ( x) a bx
N i ( xi ) a bxi 1 & N i ( x j ) a bx j 0
Lecture - 01
1 xi a 1
1 x
j b 0
By Cramers Rule:
1 xi
1 1
det
det
0
x
x
1
0
1
j
j
a
&b
( x j xi )
( x j xi )
1 xi
1 xi
det
det
1 x
1
x
j
Therefore we get:
( x j x)
1
N i ( x) a bx
x
( x j xi ) ( x j xi )
( x j xi )
xj
Similarly, we can form the shape function Nj. (We will get it
to be same as our initial guess.)
Lecture - 01
W ( )d N ( N
i
j 1
)d 0 for i 1, 2,..., N
) d
W
(
Lecture - 01
N ( N
i
j 1
) d for i 1, 2,..., n
e T
N N d
K ij
for i, j 1, 2,..., n
fi e
N d
i
for i 1, 2,..., n
[K ]
Lecture - 01
x Ni Ni dx x Ni N j dx
i
i
,
xj
xj
N
N
dx
N
N
dx
x j i x j j
i
i
xj
xj
f
e
x Ni dx
i
xj
dx
x j
i
xj
[ K ] f
(1 , 2 ,..., N )
[K ] [K e ]
i 1
E
f f e
i 1
Lecture - 01
W (L$ p)d W
i
(M$ r )d
j N j p d Wi M
Wi L
j Nj r d 0
j 1
Lecture - 02
j N j p d N i M
Ni L
j Nj r d 0
j 1
d 2 Q
L p 2 + 0
dx
k
on 0 x 1
500 0 at x 0
and 300 0 at x 1
Lecture - 02
, Nj
e
e
x j xi
h
x j xi
h
Domain discretization and numbering:
N1
1
x1 = 0
Lecture - 02
N2
N3
2
2 3
x2 = 0.25 x3 = 0.5
N4
N5
4
4
x4 = 0.75
5
x5 = 1
, Nj
e
e
x j xi
h
x j xi
h
Galerkin WR Statements (considering the whole domain):
d 2 Q
Ni L p dx 0 Ni dx 2 + k dx
1
d2
Ni
dx 2
Q
j N j + dx 0 for i 1,..., M ,
k
j=1
dN i dN j
d
j
dx N i
dx
j=1
0 dx dx
dN i dN j
j
dx
j=1
0 dx dx
M
x 1
x 0
Q
N i dx for i 1, 2,..., M
k
0
Q
d
N i dx N i
k
dx
0
x 1
for i 1, 2,..., M
x 0
dN i dN j
1
K ij
dx,
dx dx
x1
Q
d
f i N i dx N i
k
dx
x1
x x1
x2
K 1
Lecture - 02
dN1
x dx dx
1
dN
1 dN 2
x dx dx dx
1
,
2
x2
x2
dN 2 dN
1
dN 2
dx
dx
x dx dx
dx
x
1
1
x2
Q
d
x N1 k dx dx
1
x x1
x2
Q
x N 2 k dx
1
x2
x2
Q
d
f i N i dx N i
k
dx
x4
x x5
x5
x5
dN i dN j
4
K ij
dx,
dx dx
x4
Q
x N 4 k dx
1
f
4
Lecture - 02
x2
N Q dx d
5k
dx
x x 5
x1
x2
e
mn
dN m dN n
dx,
dx dx
xi
xj
Q
f N m dx
k
xi
e
m
f i
e
f j
Lecture - 02
Q
x Ni k dx
i
xj
Q
x N j k dx
i
xj
1
dN i
K iie
dx
e 2
dx
xi
h
d x j x
1
dx
x dx
e 2
h
i
xj
xj
1
dN i dN j
e
K ij
dx
e 2
dx
dx
xi
h
xj
1 1 dx
xi
xj
dx
xi
1
e
K
jj
he
1
e
K
ji
he
Q
Q
f i N i dx e
k xi
hk
e
xj
x
xi
x dx
xj
Q
e x j x j xi
h k
2
Lecture - 02
xi
Q x j xi
2h e k
Qh e
f je
2k
h
h
e
e
K k
, f
e
1
1
Qh
he
2
h e
Substituting the values:
4 4
K 0.5
4
4
125
e
& f
125
e
2
2
The stiffness matrix will be same for element 1 & 4, but the
right-side vector will have additional terms (for nodes 1 & 5)
We have to assemble these elemental contributions to obtain a
global system.
Lecture - 02
N2
N3
2
2 3
x2 = 0.25 x3 = 0.5
N4
N5
4
4
x4 = 0.75
T5=300 K
5 q5 = ?
x5 = 1
d
q1 k
2 2 0 0 0 1 125
dx x 0
2 2 0 0 0 125
0
K f 0 0 0 0 0 3 0
0
0
0
0
0
0
0
0 0 0 0 0 5 0
2 2 0
2 4 2
K f 0 2 2
0 0 0
0 0 0
0 0
0 0
0 0
0 0
0 0
1
2
3
0
0
125
q1
250
125
2 4 2 0 0
250
2
K f 0 2 4 2 0 3 250
250
0
0
2
4
0 0 0 2 2 5 125 q5
Lecture - 02
4 2 0 2
2 4 2
3
0 2 4 4
250 2 500
1250
250 250
850
250 2 300
Lecture - 03
i-1
i-2
Ni
Nj
e-1
Nk
k+1
e+1
k+2
Ni
xx xx
,
x x x x
xx xx
Nk
Lecture - 03
xk xi xk xi
Nj
x xi x xk
xi x j xk
&
N i a bx cx 2 0 if x x j
0 if x x
k
2
1
x
x
j
j
1 xk xk 2
2
1
det 0 x j x j 2
det
1
0
x
det
j
2
2
0 xk xk
1 0 x k
1
a
,b
&c
2
2
1 xi xi
1 xi xi
det 1 x j x j 2
det
1
x
x
j
j
det 1
1 xk xk 2
1 xk x k 2
Lecture - 03
a
b
c
1
0
0
xi
xj
x k
1
0
0
xi
xj
xk
xi 2
2
xj
xk 2
j N j p d Wi M
Wi L
j 1
j Nj r d 0
j 1
Nm
Nm
A
A
dNm/dx
dNm/dx
A
A
d Nm/dx
2
A
Lecture - 04
dNm/dx
d2Nm/dx2
A
d3Nm/dx3
A
d 4w
EI 4 q 0
dx
Where: E is the Youngs modulus, I is the second moment of
area of C.S. of beam, q is the loading per unit length and w
is the vertical deflection.
If the length of the beam is L, the weighted residual
formulation can be written as:
d 4 w
0 Wi EI dx 4 q dx 0
L
Lecture - 04
d w
Wi EI 3
dx
L
dW i
d 3 w
EI 3 dx Wi qdx 0
dx
dx
0
0
L
d w
Wi EI 3
dx
dW i
d w
EI 2
dx
dx
0
2
L
d 2 w
d 2Wi
EI 2 dx Wi qdx 0
2
dx
dx
0
0
L
w1
1
w2
2
3x 2 2 x3
N1 1 2 3
L
L
1
1
1
Lecture - 04
1
2
3
4
2x 2 x 3
N2 x
2
L
L
3x 2 2 x3
N1 2 3
L
L
x 2 x3
N2 2
L L
d w
N i EI 3
dx
dN i
d w
EI 2
dx
dx
d 2 Ni
2
dx
0
d2
EI 2 N j j dx N i qdx 0
dx
d
N j
d Ni
e
K ij
EI
dx
2
2
dx
dx
0
L
&
Lecture - 04
d
3x
2x
e
K11 EI
1 2 3
2
dx
L
L
0
L
6 6 x
dx EI 2 3 dx
L L
0
36 72 x 36 x
36 x 36 x 12 x
EI 4 5 6 dx EI 4 5 6
L
L
L
L
L
L
0
12 EI
36 36 12
EI 3 2 3 3
L
L L L
L
2
2
d
N
d
N2
4 6 x
6 6 x
e
1
K 21 EI
dx EI 2 3 2 dx
2
2
dx dx
L L
L L
0
0
24 x 30 x 12 x
3 4 5
L
L
L
2
Lecture - 04
6 EI
2
L
K e
6 L 12 6 L
12
2
2
EI 6 L 4 L 6 L 2 L
3
L 12 6 L 12 6 L
2
2
6 L 2 L 6 L 4 L
Lecture - 04
d w
N i EI 3
dx
&
0
dN i
d w
EI 2
dx
dx
2
d 3 w
EI 3 0 Shear force is zero at the end.
dx
Equating the second term to zero:
d 2 w
EI 2 0 Bending Moment is zero at the end.
dx
The remaining part of the problem is left as home work for the
student. Solve a sample problem by assuming suitable data.
Lecture - 04
Concluding Remarks
In this chapter we developed the fundamental idea of FEM,
i.e., Piecewise defined trial functions, after discretizing the
domain into finite elements.
We first applied this concept to approximation of known
functions and then for the solution of differential equations,
both in 1D.
By specifying the properties of the trial functions, we could
directly solve for the nodal values of the unknown variable
and obtain the global stiffness matrix to be sparse.
We discussed the idea of higher order trial functions
(elements) and the continuity requirements.
However, all these discussions were limited to 1D, were the
geometry is trivial. The real power of FEM appears in 2D or
3D problems, were simultaneous approximation of the field
variable and the geometry is required.
Lecture - 04