Sunteți pe pagina 1din 7

G.P.Nikishkov.

Introduction to the Finite Element Method 1


Problems with solutions
Problem 1
Obtain shape functions for the one-dimensional quadratic element:
Solution
With shape functions, any field inside element is presented as:
.
At nodes the approximated function should be equal to its nodal value:
.
Since the element has three nodes the shape functions can be quadratic polynomials (with
three coefficients). The shape function N
1
can be written as:
.
Unknown coefficients
i
are defined from the following system of equations:
The solution is: . Thus the shape function N
1
is equal to:
.
The equation system for the determination of coefficients for the shape function
-1 0 1

1 2 3
u ( ) N
i
u
i
i ,

13 = =
u 1 ( ) u
1
u 0 ( ) u
2
u 1 ( ) u
3
= , = , =
N
1

1

2

3

2
+ + =
N
1
1 ( )
1

2

3
+ 1 = =
N
1
0 ( )
1
0 = =
N
1
1 ( )
1

2

3
+ + 0 = =

1
0
2
1 2
3
1 2 = , = , =
N
1
1
2
--- 1 ( ) =
G.P.Nikishkov. Introduction to the Finite Element Method 2
can be written as:
The solution gives and the expression for N
2
is: .
It is easy to obtain that the shape function N
3
is equal to: .
Problem 2
Prove that should be preserved at any point inside element.
Solution
The finite element should represent exactly the constant field u = c:
.
Problem 3
Write down a matrix [A] which relates local (element) and global (domain) node enumeration
for the following finite element mesh:
N
2

1

2

3

2
+ + =
N
2
1 ( )
1

2

3
+ 0 = =
N
2
0 ( )
1
1 = =
N
2
1 ( )
1

2

3
+ + 0 = =

1
1
2
0
3
1 = , = , = N
2
1
2
=
N
3
1
2
--- 1 + ( ) =
N
i
1 =
c N
1
c N
2
c + + N
i
c

= =
Node order
for an element
1 2
3
4
1 2 3
4 5 6
7 8
e1 e2
e3
G.P.Nikishkov. Introduction to the Finite Element Method 3
Solution
The matrix [A] relates element and global nodal values in the following way:
,
where {Q} is a global vector of nodal values and {Q
d
} is vector containing element vectors.
The explicit rewriting of the above relation looks as follows:
Problem 4
Evaluate the Jacobian matrix [J] for the four-node element (square with sides equal to 1
rotated by 45 degrees):
Solution
The Jacobian matrix includes the following entries:
.
The components of the Jacobian matrix are calculated using coordinates of element nodes:
Q
d
{ } A [ ] Q { } =
Q
1
Q
2
Q
5
Q
4



' ;



Q
2
Q
3
Q
6
Q
5


' ;



Q
5
Q
6
Q
8
Q
7


' ;















' ;












1 0 0 0 0 0 0 0
0 1 0 0 0 0 0 0
0 0 0 0 1 0 0 0
0 0 0 1 0 0 0 0
0 1 0 0 0 0 0 0
0 0 1 0 0 0 0 0
0 0 0 0 0 1 0 0
0 0 0 0 1 0 0 0
0 0 0 0 1 0 0 0
0 0 0 0 0 1 0 0
0 0 0 0 0 0 0 1
0 0 0 0 0 0 1 0

Q
1
Q
2
Q
3
Q
4
Q
5
Q
6
Q
7
Q
8







' ;







=
x
y

45
J [ ]
x y
x y
=
G.P.Nikishkov. Introduction to the Finite Element Method 4
The shape functions of the linear element are:
,
where , are local coordinates and
i
,
i
are their values at nodes. Global coordinates of
nodes are: .
Derivatives of shape functions in respect to the local coordinate are:
.
The first entry of the Jacobian matrix can be calculated as:
.
Other entries can be calculated in the similar manner. The Jacobian matrix for the square lin-
ear element rotated by 45 degrees is equal to:
.
For elements of a simple form (parallel sides) derivatives of global coordinates in respect to
local coordinates can be evaluated as finite differences. For the considered element the esti-
mation is:
.
Problem 5
Calculate nodal equivalents of a distributed load with constant intensity applied to the side of
a two-dimensional quadratic element:

x

N
i
x
i


y

N
i
y
i

= ,

=
N
i
1
4
--- 1
i
+ ( ) 1
i
+ ( ) =
x
1
0 y
1
, 0 x
2
; 2 2 y
2
, 2 2 x
3
0 y
3
, = ; 2 x
4
; 2 2 y
4
, 2 2 = = = = = = =

N
i 1
4
---
i
1
i
+ ( ) =

x

N
i
x
i
1
4
--- 1 ( ) 0 1 ( )
2
2
------- 1 + ( ) 0 1 + ( )
2
2
-------
,
_
+ +
,
_
2
4
------- = = =
J [ ]
2 4 2 4
2 4 2 4
=

x x

------
2
2
------- 2
2
4
------- = = =
-1 0 1

1 2 3
l = 1
p = 1
x
G.P.Nikishkov. Introduction to the Finite Element Method 5
Solution
The nodal equivalent of the distributed load is calculated as:
or
.
The shape functions for the one-dimensional quadratic elements are:
.
The value of nodal forces at nodes 1, 2 and 3 are defined by integration:
Problem 6
Show the fill of the global stiffness matrix for the finite element mesh shown below. Each
node has one degree of freedom.
p { } N [ ]
T
p
d
dx
d
1
1

=
p { }
p
1
p
2
p
3

' ;


N
1
N
2
N
3

' ;


p
d
dx

d
dx
,
1
1

------
1
2
--- = = = =
N
1
1
2
--- 1 ( ) N
2
1
2
N
3
1
2
--- 1 + ( ) = , = , =
p
1
1
2
--- 1 ( )
1
2
-- - d
1
1

1
6
--- = =
p
2
1
2
( )
1
2
--- d
1
1

2
3
--- = =
p
3
1
2
--- 1 + ( )
1
2
--- d
1
1

1
6
--- = =
Node order
for an element
1 2
3
4
1 2 3
4 5 6
7 8
e1 e2
e3
G.P.Nikishkov. Introduction to the Finite Element Method 6
Solution
The global stiffness matrix has a size of 8 by 8. Location of nonzero values in the global stiff-
ness matrix is defined by pairs of global node numbers for elements. The algorithm of assem-
bly of the element stiffness matrix k into the global stiffness matrix K is given by the
following pseudo-code:
do i=1,n
do j=1,n
K[C[i],C[j]] = K[C[i],C[j]] + k[i,j]
end do
end do
Here C[i] is ith global node number of the element. For example, the element e1 gives con-
tributions to rows 1, 2, 5 and 4. Each of these four rows contains entries from element e1 at
columns 1, 2, 5 and 4. The total fill of the global stiffness matrix is shown below where non-
zero values are denoted by 1:
Problem 7
Describe the structure of the global stiffness matrix from the previous problem using sparse
row-wise format.
Solution
The matrix structure in the sparse row-wise format is represented by the two arrays:
col[pcol[N+1]] = column numbers for nonzero entries of the matrix;
pcol[N+1] = pointers to the beginning of each row.
These arrays are:
col[] = 1,2,4,5, 1,2,3,4,5,6, 2,3,5,6,
1,2,4,5, 1,2,3,4,5,6,7,8, 2,3,5,6,7,8, 5,6,7,8, 5,6,7,8
pcol[] = 0, 4, 10, 14, 18, 26, 32, 36, 40
K [ ]
1 1 0 1 1 0 0 0
1 1 1 1 1 1 0 0
0 1 1 0 1 1 0 0
1 1 0 1 1 0 0 0
1 1 1 1 1 1 1 1
0 1 1 0 1 1 1 1
0 0 0 0 1 1 1 1
0 0 0 0 1 1 1 1
=
G.P.Nikishkov. Introduction to the Finite Element Method 7
Problem 8
Apply boundary condition x
2
= 0.5 to the following equation system:
Use both the explicit method and the method of large number.
Solution
According to the explicit method, the column 2 of the matrix is multiplied by x
2
= 0.5 and is
moved to the right-hand side. Then the equation 2 is replaced by the x
2
= 0. The system after
the application of the boundary condition looks like:
Using large number we need to change just the equation with the prescribed value of the
unknown:
1 1 0
1 2 1
0 1 1
x
1
x
2
x
3

' ;

0
0
1


' ;


=
1 0 0
0 1 0
0 0 1
x
1
x
2
x
3


' ;

0.5
0.5
1.5


' ;


=
1 1 0
1 2 10
20
1
0 1 1
x
1
x
2
x
3

' ;


0
1 10
20

1


' ;


=

S-ar putea să vă placă și