Você está na página 1de 53

INTRODUCTION TO FINITE

ELEMENT METHOD

VIJAYAVITHAL BONGALE
DEPARTMENT OF MECHANICAL ENGINEERING
MALNAD COLLEGE OF ENGINEERING
HASSAN - 573 202.
Mobile : 9448821954

8/14/2015 1
8/14/2015 2
Experimental Investigation:
• Expensive and impossible
• Performance on small scale model
• Small scale model do not simulate all the
features of the full scale difficulties of
measurement

Theoretical Calculation:
• Low cost and fast
• Complete information
• Ability to simulate realistic condition
• Ability to simulate ideal model
8/14/2015 3
Methods of Analysis:
• Exact methods( e.g. Separation of
variables and Laplace transformation
Analytical methods)

Methods • Approximate methods ( e.g. Rayleigh –


Ritz and Galerkin methods)

• Finite Difference method


• Finite Element Method
Numerical • Boundary Element Method
• Finite Volume Method
Methods • Spectral Method
• Mesh Free Method

8/14/2015 4
Why FEM?
• In nature every phenomenon is governed by laws of
physics, in terms algebraic, differential or integral
equations relating various quantities of interest.
• Examples
1. Dynamic behavior of the body- Newton’s law of motion
2. Heat conduction for analysis of temperature distribution in
solids -Fourier’s law
3. Study of motion of viscous fluids- Navier-Stokes equations
4. Structural Analysis – Force-stress-strain relations

• Derivation of these governing equations from basics


is easier but their solution by exact methods is a
formidable task
8/14/2015 5
Why FEA?

• Used in problems where analytical


solution not easily obtained.
• Mathematical expressions required for
solution not simple because of complex:
– geometries
– loadings
– material properties

8/14/2015 6
What is Finite Element Method?
• FEM is a numerical analysis technique
for obtaining approximate solutions to
a wide variety of engineering
problems.

8/14/2015 7
FEA: Basic concept

• Replace continuous geometry with a set of objects with


a finite number of DOF

• Divide body into finite number of simpler units


(elements).

• Elements connected at nodal points


– points common to two or more adjacent
elements
– set of elements referred to as “mesh”

8/14/2015 8
8/14/2015 9
Example of FEA Mesh

8/14/2015 10
Applications of FEM:
1. Equilibrium problems or time independent problems.
e.g. i) To find displacement distribution and stress
distribution for a mechanical or thermal loading in
solid mechanics. ii) To find pressure, velocity,
temperature, and density distributions of equilibrium
problems in fluid mechanics.
2. Eigenvalue problems of solid and fluid mechanics.
e.g. i) Determination of natural frequencies and
modes of vibration of solids and fluids. ii) Stability
of structures and the stability of laminar flows.
3.Time-dependent or propagation problems of continuum
mechanics.
e.g. This category is composed of the problems that
results when the time dimension is added to the
problems of the first two categories.

8/14/2015 11
Engineering applications of the FEM:
• Civil Engineering structures
• Air-craft structures
• Heat transfer
• Geomechanics
• Hydraulic and water resource engineering and
hydrodynamics
• Nuclear engineering
• Biomedical Engineering
• Mechanical Design- stress concentration problems,
stress analysis of pistons, composite materials,
linkages, gears, stability of linkages, gears and
machine tools. Cracks and fracture problems under
dynamic loads etc
8/14/2015 12
Advantages of Finite Element Method
• Model irregular shaped bodies quite easily
• Can handle general loading/ boundary conditions
• Model bodies composed of composite and
multiphase materials because the element equations
are evaluated individually
• Model is easily refined for improved accuracy by
varying element size and type
• Time dependent and dynamic effects can be
included
• Can handle a variety nonlinear effects including
material behavior, large deformation, boundary
conditions etc.
8/14/2015 13
Disadvantages:
• Needs computer programmes and computer
facilities
• The computations involved are too numerous for
hand calculations even when solving very small
problems
• Computers with large memories are needed to
solve large complicated problems

8/14/2015 14
Similarities that exists between various
types of engineering problems:
1. Solid Bar under Axial Load

  u 
 AE   0,
x  x 
Where , E is the Young' s modulus,
u is axial displaceme nt,
and A is cross  sectional area
8/14/2015 15
2. One – dimensional Heat Transfer
  T 
 KA   0, Laplace equation
x  x 
Where , K is the thermal conductivi ty,
T is temperature, and A is cross  sectional area
3. One dimensional fluid flow
  Φ 
 ρA   0, Where ,
x  x 
ρ is the density , φ  is potential function ,
Φ
and A is cross  sectional area and u 
8/14/2015
x 16
8/14/2015 17
General Steps to be followed while
solving a structural problem by using
FEM:
1. Discretize and select the element type
2. Choose a displacement function
3. Define the strain/displacement and stress/ strain
relationships
4. Derive the element stiffness matrix and equations
by using direct or variational or Galerkin’s approach
5. Assemble the element equations to obtain the
global equations and introduce boundary conditions
6. Solve for the unknown degrees of freedom or
generalized displacements
7. Solve for the element strains and stresses
8. Interpret the results
8/14/2015 18
Step 1. Discretize and Select element type

1. Dividing the body into an equivalent


system of finite elements with associated
nodes
2. Choose the most appropriate element
type
3. Decide what number, size and the
arrangement of the elements
4. The elements must be made small enough
to give usable results and yet large
enough to reduce computation effort 19
8/14/2015
Step 2. Selection of the displacement
function

1. Choose displacement function within


the element using nodal values of the
element
2. Linear, quadratic, cubic polynomials can
be used
3. The same displacement function can be
used repeatedly for each element

8/14/2015 20
Step 3. Define the strain/displacement and
stress/strain relationships

1. Strain/displacement and stress/strain


relationships are necessary for deriving the
equations for each element
2. In case of 1-D, deformation, say in x-direction
is given by,
du
x 
dx
3. Stress / strain law is , Hooke’s law given by,

8/14/2015
 x  E x 21
Step 4. Derive element stiffness matrix and
equations

1. Following methods can be used


– Direct equilibrium method
– Work or energy methods
– Method of weighted residuals such as
Galerkin’s method

2. Any one of the above methods will produce


the equations to describe the behavior of an
element
8/14/2015 22
3. The equations are written conveniently in matrix
form as,
 f1  k11 k12 k13        k1n  d 1 
 f  k k k        k  d 
 2   21 22 23 2n  2 
 f 3  k 31 k 32 k 33        k 3n  d 3 
   
    
    
    
 f n  k n1              k nn  d n 

or in compact matrix form as


8/14/2015
 f   k d  23
Step 5. Assemble the element equations to obtain
the global or total equations and introduce
boundary conditions
1. The element equations generated in the step 4
can be added together using the method of
superposition
2. The final assembled or global equations will
    
be of the matrix form F  K d
3. Now introduce the boundary conditions or
supports or constraints
4. Invoking boundary conditions results in a
modification of the global equation

8/14/2015 24
Step 6. Solve for the unknown degrees of
freedom or generalized displacements
• After introducing boundary conditions, we get a set
of simultaneous algebraic equations and these
equations can be written in the expanded form as
 F1   K11 K12 K13        K1n  d1 
 F   K K K        K  d 
 2   21 22 23 2n  2 
 F3   K 31 K 32 K 33        K 3 n  d 3 
   
    
    
    
 Fn   K n1              K nn  d n 25
8/14/2015
The above equations can be solved for unknown
degrees of freedom by using an elimination
method such as Gauss ‘s method or an iteration
method such as the Gauss-Seidel method

Step7. Solve for the element strain and stress

Secondary quantities such as strain and stress ,


moment or shear force can now be obtained

8/14/2015 26
Step 8. Interpret the results

1. The final goal is to interpret and analyze


the results for use in design / analysis
process.
2. Determine the locations where large
deformations and large stresses occur in
the structure
3. Now make design and analysis decisions

8/14/2015 27
Computer Programmes for the FEM
1. Algor
2. ANSYS – Engineering Analysis System
3. COSMOS/M
4. STARDYNE
5. IMAGES-3D
6. MSC/NASTRAN- NASA Structural Analysis
7. SAP90- Structural Analysis Programme
8. GT- STRUDL – Structural Design Language
9. SAFE- Structural Analysis by Finite Elements
10.NISA- Non linear Incremental Structural Analysis etc.

Introduction to FEM –ME 703 Course Contents

8/14/2015 28
Matrix Algebra:
Matrix is an mxn array of numbers arranged in m rows
and n columns

a
11
a a   a
12 13 
1n

a a a   a 
21 22 23

2n

a   a a a   a 
 
31 32 33 3n

      

a
m1
a a
m2 m3
  a 

mn

a or a  or a 
A matrix is represented by
ij

8/14/2015 29
Matrix types:
• Rectangular matrix if m ≠ n
• Row matrix if m = 1 and n > 1
• Column matrix if m > 1 and n = 1
• Square matrix if m=n
Row matrices and rectangular matrices are denoted
by using brackets   and column matrices are
denoted by using braces  

In FEM
• Force matrices and Displacements matrices are
Column matrices
• Stiffness matrix is a square matrix
8/14/2015 30
Matrix operations:
• Multification of a matrix by a scalar
• Addition of matrices- Matrices of same order
C  a  b  b a
   
• Multification of matrices- If two matrices to be
multiplied then the number of columns in one
matrix must be equal to the number of rows in the
other.
a xb  b xa
   

• Transpose of a matrix- by interchanging rows and


columns
a   a 
ij
T

ji

• Another important relationship that involves


transpose is
8/14/2015
a b  b a 
T


T


T

 - 31
aa
T
• Symmetric matrix  
• Unit matrix or identity matrix – a square matrix with
each element of the main diagonal to 1 and all other
elements equal to zero and is denoted by matrix I
• Diagonal Matrix- A square matrix with non-zero
elements only along the principle diagonal
• Upper triangular matrix- matrix with the elements
below the principle diagonal are all zero
• Differentiating a matrix-differentiating every element
in the conventional manner
• Integrating a matrix- integrating every element in the
conventional manner
• Determinant of a matrix c adj a T

• Inverse of a matrix- a 
1
  

8/14/2015
a

a
 32
• Inverse of a matrix is also obtained by row reduction
or Gauss-Jordan method

8/14/2015 33
Methods for solution of
simultaneous linear equations

• The general form of a set of equations will


be, a x  a x      a x  c
11 1 12 2 1n n 1

a x  a x      a x  c
21 1 22 2 2n n 2

a x  a x      a x  c
31 1 32 2 3n n 3

               
               
a x  a x      a x  c
n1 1 n2 2 nn n n

Where,
'
a are the coefficient of the unkowns x s and
ij j

8/14/2015 c are the known right  side terms


i 34
• In Structural problems-
aij’ s are the stiffness coefficients kij’ s ,
xj’ s are the unknown nodal displacements di’ s and
ci’ s are the known nodal Fi’ s (forces)

• If c’s are not all zeros, the set of equations is non-


homogeneous and all equations must be
independent to yield a unique solution (Stress
analysis).
• If c’s are all zeros, the set of equations is
homogeneous and no trivial solutions exists only if
all equations are not independent. Buckling and
vibration problems involve homogeneous sets of
equations
8/14/2015 35
Gaussian Elimination:
• It is a method which is easily adapted to the computer
and is based on triangularization of the coefficient
matrix and evaluation of the unknowns by back-
substitution starting from the last equation
• Procedure: Consider the general system of n
equations with ‘n’ unknowns

a a     a
11 12 1n  x 1  c 1

a a     a  x  c 
 21 22 2n
  2
  
2

              ( 1 )
    
         
  
a a     a
n1 n2 nn
  x n
 c 
n
8/14/2015 36
• To solve
1. Eliminate the coefficient of x1 in every equation except
the first one
To do this, select a11 as the pivot and
a
a) Add the multiple  of the first row to the second
21

a 11

b) Add the multiple 


a of the first row to the third row
31

a11

c) Continue this through the nth row


a a     a
11 12 1n  x 1  c 1

The system of equations 0 a     a


' '  x  c '

 22 2n
  2
  
2

will then be reduced to               ( 2 )


the form,     
           
8/14/2015
0 a     a
'
n2 nn
'
  x n
 c 
'
n 37
2. Eliminate the coefficient of x2 in every equation below
except the second equation
To do this, select a’ 22 as the pivot and
'

a) Add the multiple a of the second row to the third


32
'
a 22
'
b) Add the multiple a of the second row to the fourth
row
 42
'
a22

c) Continue this through the nth row

The system of equations a a a    a   x  c


11 12 13 1n 1 1 
will then be reduced to 0 a a    a   x  c
' ' ' ' 
the form,     
22 23 2n 2 2

0 0 a    a '' ''
 x   c   ( 3 )
''

 
33 3n 3 3

  
           
8/14/2015
0 0 a    a ''
n3
''
nn
  x n
 c  38
''
n
• Repeat this process for the remaining rows until we
have the system of equations (called triangular zed) as

a 11
a 12
    a  x1n 1  c 1 
0 a '
    a 
'  x  c ' 
 22

2n 2
  2

0 0 a a   a  x
'' '' ''
 c ''

    
33 34 3n 3 3

0 0 0 a   a  
'''
44
'''
4n      ( 4 )
0 0 0 0   a  
''''
   
    
5n

           
0  x  c 
0 0   a n 1 n 1

 0 nn n   n 
8/14/2015 39
3. Determine xn from the last equation as
n 1
c
x n
n
n 1
a nn

And determine the other unknowns by back substitution.


These steps are in general form
where ,
a ik
a ij  a ij  a kj k = 1,2,- - - - , n-1
a kk i = k+1, - - - - , n
j = k, - - - , n+1

1
x  a   a x 
n
where,
a  
i i ,n 1 r i1 ir r

ii ai, n+1 represents the


latest right side c’s given by
8/14/2015 40
equation (4)
Eigen Values and Eigen Vectors
• Given a square matrix [a] if there exists a scalar
λ (real or complex) and a non zero column
vector {X} such that [a] {X} = λ {X} , then λ is
called the Eigen value of [a] and {X} is called
Eigen vector of [a] corresponding to an Eigen
value λ.
Determination of Eigen value and Eigen vector
Consider an identity matrix ‘[I]’ of the same order
of [a], we can write,
{X} = [I] {X}
Therefore, [a] {X} = λ {X} = λ ( [I] {X} )
8/14/2015 41
i.e. ([a]- λ [I]) {X} = 0
For example, Let [a] be a 3X3 matrix given
by
a a a 
11 12 13


a   a a a  
21 22 23

a a a 
31 32 33

We have,
1 0 0   0 0 
  
 I    0 1 0  0  0 
   
0 0 1  0 0  
8/14/2015 42
a  
11
a a  12 13

therefore a    I   a
21
a  a 
22 23

a
31
a a   32 33

a   a a  x 
 
11 12 13 1


and a    I X   a a  
21
a  x 22 23 2 0
a a31
a     x 32 33 3

We get ,
a    x  a x  a x  0
11 1 12 2 13 3

a x  a    x  a x  0
21 1 22 2 23 3

8/14/2015 a x  a x  a    x  0
31 1 32 2 33 3 43
• The solution for the above system of
equations exists the determinant
a 11
a 12
a 13

a 21
a 
22
a 23
0
a 31
a 32
a 33

i .e . a    I   0
This equation is called the characteristic
equation of matrix [a]

8/14/2015 44
• Example: Find all the Eigen values and the corresponding Eigen
vectors of the matrix
 8  6 2
a    6 7  4 
 2  4 3 
The characteristic equation for the above matrix will be in the form of

a    I   0
8 6 2
i .e .  6 7  4 0
2 4 3

i .e .( 8   )7   3     ( 4 x  4 )
 ( 6 ) 6 x 3     ( 2 )( 4 )
8/14/2015  2( 6 x  4 )  2 x 7     0 45
• We get, after simplification of above equation

   3   15   0
Therefore ,
  0 , 3 and 15
• These are called Eigen Values
To determine the Eigen vectors, form the equation based on,

a    I X   0
8   6 2  x 
 
1

i .e .   6 7  
 4  x 2 0
 2 4 3     x 3


8/14/2015 46
i .e . 8    x  6 x  2 x  0
1 2 3

 6 x  7    x  4 x  0
1 2 3

2 x  4 x  3    x  0
1 2 3

Case 1 If λ= 0
Using the rule of cross multification
x1  x2 x3 x  x2 x3
  i .e 1  
6 2 8 2 8 6 10  20 20
7 4 6 4 6 7
we get , x1  1 , x 2  2 , x 3  2

Therefore Eigen vector at   0 is


1 
X    2 
2
8/14/2015   47
Case 2 If λ= 3
Using the rule of cross multification
x x x x x x
 1
 i .e2
  3 1 2 3

6 2 5 2 5 6 16  8  16
4 4 6 4 6 4 Therefore Eigen vector at   3 is
we get , x  2 , x  1 , x  2
1 2 3 2 
X    1 
 2
 

Case 3 If λ= 15
Using the rule of cross multification
x x x x x x
1
  i .e
2
  3 1 2 3

 6 2 7 2 7  6 40 40 20
8 4 6 4 68
8/14/2015 we get , x  2 , x  2 , x  1
1 2 3
48
Therefore Eigen vector at   15 is
2 
X    2 
 1
 

Example: Gaussian Elimination Method


Solve the following system of equations using Gaussian Elimination method
Ex 1. 2 x  2 x  1 x  9
1 2 3

2 x  1x
1 2
4
1x  1x  1x  6
1 2 3

In matrix form
 2 2 1   x  9 
 2 1 0   x   4   ( 1 )
1

    
2

8/14/2015 1 1 1   x  6 


3
49
Step 1:
Eliminate the coefficient of x1 in every equation except the first
one. Select a11 = 2 as the pivot
a 2
a) Add the multiple    of the first row to the second
21

a 11
2
a 1
b) Add the multiple    of the first row to the third
31

a 11
2
We obtain
   
2 2 1   x1   9 
    
 0  1  1   x2    5   ( 2 )
 1   x 3   3 
0 0   
 2  2
Second row operations :
a 21 a a
( x a11  a 21 )  0 , (  21 x a12  a 22 )  1 , (  21 x a13  a 23 )  1 and
a11 a11 a11
a 21
8/14/2015
( x c 1  c 2 )  5 50
a11
Step 2:
Eliminate the coefficient of x2 in every equation below the
second equation. In this case, we accomplished this in step 1.

Step 3:
Solve for x3 in the third of equation (2) as

1 3
x   x 3
3 3
2 2
Solve for x2 in the second of equation (2) as

 1 x2  1 x3  5  x2  2
Solve for x1 in the first of equation (2) as

9  2( 2 )  1( 3 )
x1  1
2
8/14/2015 51
Ex 2. x  4x  5x 4
1 2 3

3x  4x   1
2 3

 2 x  1x  2 x   3
1 2 3

Ex 3. 2 x  1 x  3 x  11
1 2 3

4x  2x  3x 8
1 2 3

 2 x  2 x  1x   6
1 2 3

8/14/2015 52
Thank You

8/14/2015 53

Você também pode gostar