You are on page 1of 34

NATIONAL INSTITUTE OF TECHNOLOGY KARNATAKA

SURATHKAL
DEPARTMENT OF MECHANICAL ENGINEERING

A Seminar on

MECHANICAL BEHAVIOUR OF ENGINEERING MATERIALS


(DP702)
Presented by

Abhinandan
Chetan H C
Prashant
Vishwas
INTENDED LEARNING OBJECTIVES

To study constitutive relations: Fourier Law of Heat Conduction and to


formulate differential equation for heat flow.
To learn weak formulation of differential equation applicable to heat
transfer.

Discretization of space and time: Spatial Discretization (FEM).

Time Stepping Algorithms.

Newmark Predicators and Correctors.

Explicit Dynamics.
Radiation

Convection

Conduction
FOURIERS LAW OF HEAT CONDUCTION
Statement: The time rate of heat transfer through a material is proportional
to the negative gradient in the temperature.

i.e. = -k

Where,
- is the heat flow rate by conduction (W)

k - is the thermal conductivity of body material ()
(,)
, =
is the temperature gradient ().

Heat transfer has direction as well as magnitude, C/S Area A


Temp T0C
and thus it is a vector quantity.
FORMULATION OF DIFFERENTIAL
EQUATION
Control Volume

qx qx dx
x dx

Energy Balance:
Energy in =
Energy Out = qx dx
First order Taylor series equation to relate heat flow
qx
qx dx qx x
x
Contd..

Net heat Flow is given by i/p minus o/p

qx
qx qx dx qx (qx x)
x
qx
x
x

Rate of energy generation = q volume qdxdydz


Energy is never created its due to its internal changes (exothermic and endothermic reactions)

Rate of energy accumulation du mass C p dT dxdydz


dt dt
dU dT
Cp U C p (T Tref )
dt dt
Contd..
According to Fouriers Law, we have
dT
qx k (dydz )
dx
Substituting the values, we get
qx dT
x (kdydz )dx
x x dx
Above equation gives heat flow in x direction. Hence finding heat flux flow in other
directions we get
dT
(k )dxdydz
x dx
dT
(k )dxdydz
y dy
dT
(k )dxdydz
z dz

dT dT dT dT
(k ) (k (k ) q C p
x dx y dy z dz dt
WEAK FORMULATION
The main idea of the weak form is to turn the
differential equation into an integral equation, so as to
lessen the burden on the numerical algorithm in evaluating
derivatives.
Consider a concrete example of 1D heat transfer at steady
state with no heat source.
we are interested in the temperature T, as function of
distance x, defined by the interval (1<x<5).

No heat flux, hence


Contd..
Involves the first derivative of the heat flux q, or the second derivative of the
temperature T, which may cause numerical issues in practical situations
where the differentiability of the temperature profile may be limited.

For example, at a boundary where the adjacent materials have different


values of thermal conductivity

The first derivative of the temperature, becomes discontinuous and the


second derivative of T, can not be evaluated numerically.

To improve upon it, we can ask instead that the average value of

,in the enter domain.

Differential equation into an integral equation, so as to lessen the burden


Contd
Integrating function between interval 1<x<5

This is very weak in the domain 1<x<5, hence assuming a interval

To improve accuracy

For heat flux equation

dT dT
(k
dT
) (k (k ) q C p
dT
C p k T f (T , t )
x dx y dy z dz dt
.

Contd..

Let V be the space of weighting functions (or test functions).


Then () ( be any is continuously differentiable.
The weighting functions also satisfy w(x) 0onT
For a similar set of functions in Poisson equation. We can write

V {w(x) | x , w(x) H 1 (), and w(x) 0 on T }

Let St be the set of trial solutions. Then any trail function (, )


has to satisfy the essential boundary conditions on T
To get the weak form, we multiply the governing equation by the
weighting function and integrate over the volume to get

T
v ( T) wdV
C t wdV s wdV
.

exact weak form of the heat equation

Contd
The second term in the equation has second-order derivatives. We
will convert these into first order derivatives using the divergence
theorem and the identity

Exact weak form of the heat equation


T
v t wdV

C w( T ) ndA.
(w) ( T )dV s wdV
q

w C T (0) dV w C T dV

v

v 0

Following the same process for the initial condition, we get


w, Cv T (0) w, Cv T0 .
DISCRETISATION
One-dimensional unsteady-state heat transfer equation, can be defined if
the initial conditions and boundary conditions are known, but may not be
analytically solvable.

Solutions must then be sought numerically.

Continuous differential equations must have been discretized before they


can be solved by a computer.

Put simply, discretization is the replacement of infinitesimal time dt and


distance dx with a finite time t and distance x, respectively.

These operations are known as time and space discretization's,


respectively.
Contd..

Discretization Methods

Finite Difference Method (FDM)

Finite Volume Method (FVM)

Finite Element Method (FEM)

Spectral and pseudo-spectral method.


Contd

Assume a trail function

Weak equation of heat conduction

Consider a function

By substituting value of v
Establishing a standard discrete equation of the form

We just take an arbitrary basis { : 1 a n}. An element and are


then represented by
N E n

h a Na = ea Nae
a=1 e=1 a=1

N E n

h a Na = ea Nae
a=1 e=1 a=1

Where, h- denotes constant spatial length scale.


TIME STEPPING ALGORITHMS
To integrate constitutive relation in time at all points.
Assume that the conditions at time tn have been calculated and that the temperature is
to be determined for time tn+1 where t is the time increment.
Need some algorithm to march in time.
Examples : Newmark algorithm, Newton Raphson method.

t0 t1 tn tn+1
PREDICTOR-CORRECTOR METHOD
Numerical methods are used to find exact analytical solutions of differential equations.
The most general form of an ordinary differential equation is given by
1
= , , , 1

Two categories of methods to solve ODEs.


1) One step methods or Single step methods
Ex: Taylors series method
2) Step by step methods or marching methods
Ex: Eulers method, Predictor-Corrector methods
Predictor-Corrector method uses two formulae.
Predictor is an explicit formula used to determine an estimate of the solution +1 from
the known solution at the previous point , .
+1 = ,
Corrector is an implicit formula uses the estimated value of +1 for computing a new,
more accurate value of +1
+1 = , , +1
NEWMARK METHOD/NEWMARK ALGORITHM

Newmark algorithm is one of the most popular to use for dynamic


analysis.
It is an extension of linear acceleration method.
It is based on the solution of an incremental form of equations of the
motion.
Newmark developed a family of time stepping method based on
following equation.

xn 1 xn tvn t 2 [(0.5 ) a n an 1
vn1 vn t[(1 )an an1 ]

Where an and an+1 follow from

Man f int ( xn , vn ) f ext (tn )

Ma( n1) f int ( xn1 , vn1 ) f ext (tn1 )

Parameters and defines variation of acceleration over a time


step.
= and = 1/6 or depending on cases
Solution Procedure
1) Newmark Predictors

xn 1 xn tvn t 2 (0.5 )an


(0)

vn 1(0) vn t (1 )an
an 1(0) 0
2) Now,

{xn 1( k ) ; vn 1( k ) ; an 1( k ) }

xn 1( k 1) xn 1( k ) x

vn 1( k 1) vn 1( k ) v

an 1( k 1) an 1( k ) a
Substituting value x and v we get,

xn 1( k 1) xn 1( k ) t 2 a (1)

vn 1( k 1) vn 1( k ) t a (2)

Using these 2 equations in dynamic equation, we get

M (an 1( k ) a) f int ( xn 1( k ) x, vn 1( k ) v) f n 1ext

By Solving,
M a K n 1( k ) x Cn 1( k ) v f n 1ext Man 1( k ) f int ( xn 1( k ) , vn 1( k ) )
Solving (1) and (2) explicitly,

x
a
t 2


v t a x
t
3) Newmark Correctors

xn 1( k 1) xn 1( k ) x

( k 1)
vn 1 v n 1
(k )
x
t
1
an1 a n 1
(k )
x
t 2
What is Explicit Dynamics?

An Explicit FEM analysis does the incremental procedure and at the


end of each increment updates the stiffness matrix based on
geometry changes (if applicable) and material changes (if
applicable).
Then a new stiffness matrix is constructed and the next increment of
load (or displacement) is applied to the system.
In this type of analysis the hope is that if the increments are small
enough the results will be accurate.
One problem with this method is that you do need many small
increments for good accuracy and it is time consuming.
If the number of increments are not sufficient the solution tends to
drift from the correct solution.
EXPLICIT APPROACH

Once you choose a specific technique to solve the given problems,


you will find that the technique falls under one of the two general
approaches: Explicit approach or Implicit approach.
Let us consider 1D heat conduction equation:

(1)
Eq. 1 will be treated as Model equation for the purpose of
discussion further.
All the necessary points concerning explicit and implicit approaches
can be made using this model equation.
Let us choose to represent by forward difference and by central
second difference. This leads to:

(2)
With some re arrangements:

(3)

Assume that T is known at all grid points at time level n. Time


marching means that T at all grid points at time level n+1 are
calculated from known values at time level n.
When this calculation is finished, we have known values at time level
n+1. The same procedure is repeated to know the time values at time
level n+2.
EXPLICIT V/S IMPLICIT TIME STEPPING

Explicit Implicit
Easy to implement and parallelize, Stable over a wide range of time
low cost per time step. steps, sometimes unconditionally
A good starting point for the Constitute excellent iterative
development of CFD software. solvers for steady-state problems
Small time steps are required for Difficult to implement and
stability reasons, especially if the parallelize, high cost per time step
velocity and/or mesh size are Insufficiently accurate for truly
varying strongly . transient problems at large t
Extremely inecient for solution of Convergence of linear solvers
stationary problems unless local deteriorates/fails as t increases
time-stepping i.e. t = t(x) is
employed
REFERENCES

https://ocw.mit.edu/courses/aeronautics-and-astronautics/16-225-computational-
mechanics-of-materials-fall-2003
The Finite Element Method, Volume I, The Basis, Fifth Edition by O. C. Zienkiewicz and
R. L. Taylor.
Numerical Methods, by Rao. V. Dukkipati
Finite Element Procedures, by Bathe, K. J.
THANK YOU

You might also like