Beruflich Dokumente
Kultur Dokumente
Kalyan
Indian Institute of Technology, Kharagpur
Brief Outlook
Introduction
Basic Process of FEM
Strong vs Weak Formulation
Variational methods
Rayleigh Ritz method
Introduction to FEM
Numerical technique for the development of
px = p0
d 2u
EA 2 = p0
dx
u 0 = 0
du
EA
dx
=0
xL
Strong form
The boundary conditions along with the governing
=0
xL
Weak form
A weak form or variational form is a weighted-integral statement
of a differential equation
Developed so as to ease the restrictions on boundary conditions.
d 2u
In our case it is
= p0
2
Strong form
dx
d 2u
Residual Function (R)
p0 = 0
2
dx
L
Weak form
d 2u
0 dx 2 p0 vdx = 0
v= Weight function
u U N c j j ( x) 0 ( x)
j 1
d
du
[a( x) ] q( x) for 0<x<L
dx
dx
With the following boundary conditions
u(0) =
0 , a( )
Steps to be done:
Make the weighted integral form of the equation
w= weight function
T Sri Kalyan Finite element methods
Weak form
L
L
wdv
vdw
[
wv
]
0
10
11
u U N c j j ( x) 0 ( x)
(1)
j 1
(2)
or
{K}{c} = {F}
(Matrix form)
= B( , );
= l( ) - B( , 0 )
T Sri Kalyan Finite element methods
12
EXAMPLE:
Determining the deflection in a simply supported beam
Governing Eq:
Let y(x) =
2
=
2
=1,3
Quadratic functional
s obtained by minimizing
Thus y=
13
residual sense
W R 0
j
functions ( )
The requirements on , 0 are more stringent
Different sets of equations produced from different
methods
T Sri Kalyan Finite element methods
14
Process
Consider the operator and approximation equation
u U N c j j ( x) 0 ( x)
j 1
unknown parameters
15
Least-Squares method
Parameters are determined by minimizing the
integral of the square of the residual
as in governing equation
16
Collocation Method:
Residual function made zero at N selected points thus
generating N equations
Selection of N specific points is crucial in this method
( , ) = 0 (i = 1,2,.N)
Sub-domain Method:
Domain is divided into large number of subdomains.
= 1 in
= 0 else
W R R
j
17
Galerkin Method
Weight function taken to be equal to approximation
function ( = )
Results in development of symmetric matrices
When it is referred as PetrovGalerkinmethod
Rx 0
i
(i = 1,2,N)
Ritz method
Ritz and Galerkin are same only in two cases:
When all the boundary conditions are essential
Same approximation functions are used
T Sri Kalyan Finite element methods
18
Example:
0 = x; 1 = x(2-x); 2 = 2 (1-2x/3)
The final residual function is
19
Taking =
Galerkin Method:
Take = we get
20
Domain Discretization
Domain () of the problem divided into set of
21
Element Shapes:
Depending on the problem there can be one, two,
22
Interpolation Functions
FEM seeks approximate solution over each element as
where,
Uje = Value of solution at nodes
= Interpolation functions
T Sri Kalyan Finite element methods
23
24
Element Equations
Linear Elements:
Function assumes a value at nodes and nullifies at
other points
ie ( x je ) 0
if ij
ie ( x je ) 1
if i=j
and,
i ( x) 1
i 1
25
Triangular Element:
Most commonly used element in 2 dimensions
26
Rectangular Elements:
Because of four nodes a bilinear term is added in the
approximation solution
Interpolation function becomes
Quadratic Elements:
Each side of the element should have three nodes
In this case the solution assumes the form,
27
Numerical Integration
Evaluation of the complicated integral forms or where
28
Newton-Cotes Quadrature
Employs values of function at equally spaced points
where,
= Weighting coefficients;
= Base points; r = Number of base points
It is to be ensured that 1 = 1
29
Computer Implementation
Finite element program consists of three basic units:
Preprocessor: This involves reading geometry, material
data and boundary conditions of the problem
Processor: Here all the calculations like generation of
mesh, element matrices etc are done
Postprocessor: Computing the solution at desired points
of the domain
The major steps in processor are:
Generation of element matrices
Assembly of element equations
Imposition of boundary conditions
T Sri Kalyan Finite element methods
30
31
32
Summary
FEM Allows accurate representation of complex
functions
Triangular element is elementary shape for two
dimensional problems
Numerical Integration necessary for computer
implementation
33
References:
J.N Reddy: Introduction to Finite Element method,
34
35