Finite Volume Method for Unsteady Flows

Slides:



Advertisements
Similar presentations
Courant and all that Consistency, Convergence Stability Numerical Dispersion Computational grids and numerical anisotropy The goal of this lecture is to.
Advertisements

Example Project and Numerical Integration Computational Neuroscience 03 Lecture 11.
2ª aula Evolution Equation. The Finite Volume Method.
Computational Modeling for Engineering MECN 6040
Chapter 8 Elliptic Equation.
Parabolic Partial Differential Equations
Finite Element Method (FEM) Different from the finite difference method (FDM) described earlier, the FEM introduces approximated solutions of the variables.
Chapter 3 Steady-State Conduction Multiple Dimensions
CHE/ME 109 Heat Transfer in Electronics LECTURE 12 – MULTI- DIMENSIONAL NUMERICAL MODELS.
1 Lecture 11: Unsteady Conduction Error Analysis.
CHE/ME 109 Heat Transfer in Electronics LECTURE 11 – ONE DIMENSIONAL NUMERICAL MODELS.
CISE301: Numerical Methods Topic 9 Partial Differential Equations (PDEs) Lectures KFUPM (Term 101) Section 04 Read & CISE301_Topic9.
SE301: Numerical Methods Topic 9 Partial Differential Equations (PDEs) Lectures KFUPM Read & CISE301_Topic9 KFUPM.
CHAPTER 8 APPROXIMATE SOLUTIONS THE INTEGRAL METHOD
Ch 8.1 Numerical Methods: The Euler or Tangent Line Method
Tutorial 5: Numerical methods - buildings Q1. Identify three principal differences between a response function method and a numerical method when both.
Scientific Computing Partial Differential Equations Introduction and
© Arturo S. Leon, BSU, Spring 2010
Lecture 3.
1 EEE 431 Computational Methods in Electrodynamics Lecture 4 By Dr. Rasime Uyguroglu
Numerical methods to solve parabolic PDEs. Mathematical models: 5° Classification Classification based on the type of the solution (except, usually, the.
Lecture Objectives: Analyze the unsteady-state heat transfer Conduction Introduce numerical calculation methods Explicit – Implicit methods.
A particle-gridless hybrid methods for incompressible flows
Elliptic PDEs and the Finite Difference Method
Chapter 5: Numerical Methods in Heat Transfer
Transient Conduction: Finite-Difference Equations and Solutions Chapter 5 Section 5.9  
Engineering Analysis – Computational Fluid Dynamics –
Engineering Analysis – Computational Fluid Dynamics –
HW2 Due date Next Tuesday (October 14). Lecture Objectives: Unsteady-state heat transfer - conduction Solve unsteady state heat transfer equation for.
MECN 3500 Inter - Bayamon Lecture 9 Numerical Methods for Engineering MECN 3500 Professor: Dr. Omar E. Meza Castillo
CIS888.11V/EE894R/ME894V A Case Study in Computational Science & Engineering We will apply several numerical methods to find a steady state solution of.
Lecture Objectives: Discuss the HW1b solution Learn about the connection of building physics with HVAC Solve part of the homework problem –Introduce Mat.
FREE CONVECTION 7.1 Introduction Solar collectors Pipes Ducts Electronic packages Walls and windows 7.2 Features and Parameters of Free Convection (1)
Discretization Methods Chapter 2. Training Manual May 15, 2001 Inventory # Discretization Methods Topics Equations and The Goal Brief overview.
Ch 8.2: Improvements on the Euler Method Consider the initial value problem y' = f (t, y), y(t 0 ) = y 0, with solution  (t). For many problems, Euler’s.
Lecture 40 Numerical Analysis. Chapter 7 Ordinary Differential Equations.
Lecture 39 Numerical Analysis. Chapter 7 Ordinary Differential Equations.
1 LECTURE 6 Stability of Parabolic PDEs. 2 Aim of Lecture Last week we discussed Parabolic PDEs –Looked at Explicit and Implicit Methods –Advantages and.
Advanced Numerical Techniques Mccormack Technique CFD Dr. Ugur GUVEN.
EEE 431 Computational Methods in Electrodynamics
High Accuracy Differentiation Formulas
Lecture 4: Numerical Stability
Finite Difference Methods
Convection-Dominated Problems
Chapter 30.
Objective Numerical methods SIMPLE CFD Algorithm Define Relaxation
Nodal Methods for Core Neutron Diffusion Calculations
Steady convection-diffusion equation
21th Lecture - Advection - Diffusion
Lecture Objectives: Advance discretization methods
Objective Numerical methods.
Solution Methods Steady State Diffusion Equation Lecture 04 1.
Chapter 27.
Chapter 26.
Topic 3 Discretization of PDE
Lecture Objectives: Analysis of unsteady state heat transfer HW3.
Objective Numerical methods Finite volume.
HEAT TRANSFER Transient Conduction.
Numerical Analysis Lecture 37.
topic4: Implicit method, Stability, ADI method
topic4: Implicit method, Stability, ADI method
Topic 3 Discretization of PDE
topic16_cylinder_flow_relaxation
topic4: Implicit method, Stability, ADI method
AE/ME 339 Computational Fluid Dynamics (CFD) K. M. Isaac 4/30/2019
topic4: Implicit method, Stability, ADI method
What are Fins ? Fins are extended surfaces used to increase the rate of heat transfer. It is made of highly conductive materials such as aluminum.
6th Lecture : Numerical Methods
Topic 3 Discretization of PDE
Presentation transcript:

Finite Volume Method for Unsteady Flows Lecture 06

The conservation law for the transport of a scalar in an unsteady flow has the general form (1) The first term of the equation represents the rate of change term and is zero for steady flows. To predict transient problems we must retain this term in the discretisation process. The finite volume integration of equation (1) over a control volume (CV) must be augmented with a further integration over a finite time step t. By replacing the volume integrals of the convective and diffusive terms with surface integrals as before and changing the order of integration in the rate of change term we obtain (2)

One-dimensional unsteady heat conduction Unsteady one-dimensional heat conduction is governed by the equation (3) Where c is the specific heat of the material (J/kg/K).

One-dimensional unsteady heat conduction… Integration of equation (3) over the control volume and over a time interval from t to t + t gives (4) Rewriting, (5) In equation (5), A is the face area of the control volume, V is its volume, which is equal to Ax where x is the width of the control volume, and S is the average source strength.

One-dimensional unsteady heat conduction… If the temperature at a node is assumed to prevail over the whole control volume, the left hand side can be written as (6) In equation (6) superscript 'o' refers to temperatures at time t; temperatures at time level t + t are not superscripted. The same result as (6) would be obtained by substituting (Tp - T°)/t for dT/dt so this term has been discretised using a first- order (backward) differencing scheme. Higher order schemes, which may be used to discretise this term

One-dimensional unsteady heat conduction… If we apply central differencing to the diffusion terms on the right hand side equation (5) may be written as (7) To evaluate the right hand side of this equation we need to make an assumption about the variation of TP, TE and Tw with time. We could use temperatures at time t or at time t +t to calculate the time integral or, alternatively, a combination of temperatures at time t and t +  t.

We have highlighted the following values of integral IT: We may generalise the approach by means of a weighting parameter  between 0 and 1 and write the integral IT of temperature Tp with respect to time as (8) Variation of temperature with time for three difference schemes We have highlighted the following values of integral IT: if  = 0 the temperature at (old) time level t is used; if  = 1 the temperature at new time level t + t is used; and finally if  = 1/2, the temperatures at t and t + t are equally weighted.

Using formula (8) for Tw and Te in equation (7), and dividing by At throughout, we have (9) which may be re-arranged to give (10) Now we identify the coefficients of Tw and Te as aW and aE and write equation (10) in the familiar standard form:

In standard form, (11) The exact form of the final discretised equation depends on the value of . When  is zero, we only use temperatures T°p, T0w and T0E at the old time level t on the right hand side of equation (11) to evaluate TP at the new time; the resulting scheme is called explicit. When 0 <  < 1 temperatures at the new time level are used on both sides of the equation; the resulting schemes are called implicit. The extreme case of  = 1 is termed fully implicit and the case corresponding to  = 1/2 is called the Crank-Nicolson scheme (Crank and Nicolson, 1947).

Explicit scheme In the explicit scheme the source term is linearised as b = Su + Sp T0p . Substitution of  = 0 into (11) gives the explicit discretisation of the unsteady conductive heat transfer equation: (12)

Explicit scheme… The right hand side of equation (12) only contains values at the old time step so the left hand side can be calculated by forward marching in time. The scheme is based on backward differencing and its Taylor series truncation error accuracy is first-order with respect to time. All coefficients need to be positive in the discretised equation. The coefficient of T0p may be viewed as the neighbour coefficient connecting the values at the old time level to those at the new time level. For this coefficient to be positive we must have a0p - aw - aE > 0. For constant k and uniform grid spacing, xPE = xWP = x, this condition may be written as (13a) (13b)

This inequality sets a stringent maximum limit to the time step size and represents a serious limitation for the explicit scheme. It becomes very expensive to improve spatial accuracy because the maximum possible time step needs to be reduced as the square of x. Consequently, this method is not recommended for general transient problems. Explicit schemes with greater formal accuracy than the above one have been designed. Nevertheless, provided that the time step size is chosen with care, the explicit scheme described above is efficient for simple conduction calculations.

Crank-Nicolson scheme The Crank-Nicolson method results from setting  = 1/2 in equation (11). The discretised unsteady heat conduction equation is (14)

Crank-Nicolson scheme… Since more than one unknown value of T at the new time level is present in equation (14) the method is implicit and simultaneous equations for all node points need to be solved at each time step. Although schemes with 1/2 <  < 1, including the Crank-Nicolson scheme, are unconditionally stable for all values of the time step (Fletcher, 1991) it is more important to ensure that all coefficients are positive for physically realistic and bounded results. This is the case if the coefficient of T°p satisfies the following condition: which leads to

This time step limitation is only slightly less restrictive than (13) associated with the explicit method. The Crank-Nicolson method is based on central differencing and hence it is second-order accurate in time. With sufficiently small time steps it is possible to achieve considerably greater accuracy than with the explicit method. The overall accuracy of a computation depends also on the spatial differencing practice, so the Crank-Nicolson scheme is normally used in conjunction with spatial central differencing.

The fully implicit scheme When the value of  is set equal to 1 we obtain the fully implicit scheme. The discretised equation is (16) Both sides of the equation contain temperatures at the new time step, and a system of algebraic equations must be solved at each time level. The time marching procedure starts with a given initial field of temperatures T°. The system of equations (16) is solved after selecting time step t. Next the solution T is assigned to T° and the procedure is repeated to progress the solution by a further time step. It can be seen that all coefficients are positive, which makes the implicit scheme unconditionally stable for any size of time step. Since the accuracy of the scheme is only first-order in time, small time steps are needed to ensure the accuracy of results. The implicit method is recommended for general purpose transient calculations because of its robustness and unconditional stability.

Solving transient heat conduction using Finite Difference Method Finite Volume Method (assignment 10)

Heat conduction equation: Explicit, implicit and Crank-Nicolson Method Insulated Hot Cold 8 cm Find the temperature at time t = 0.4 second Assignment 10 Solve the above problem using Finite Volume Method using (a) Explicit method (b) Implicit method ( = ½) and (c)  = 1

Heat conduction equation: Explicit, implicit and Crank-Nicolson Method Insulated Explicit Hot Cold Fourier series expansion and using centered finite difference formulation,  Grid point involved in time difference Grid point involved in space difference i-1,l i,l+1 O(x2) t  l+1 i+1,l  Fourier series expansion and using backward finite difference formulation for time derivative, l i,l i-1 i i+1 0,0 Put in heat conduction equation, x Arranging,

Heat conduction equation: Explicit, implicit and Crank-Nicolson Method  Fourier series expansion and using centered finite difference formulation, Grid point involved in time difference Grid point involved in space difference i,l+1 i-1,l+1 i+1,l+1 O(x2) t  l+1  l Fourier series expansion and using backward finite difference formulation for time derivative, i,l i-1 i i+1 0,0 x Put in heat conduction equation, Arranging,

Comparison between explicit and implicit method Explicit method Implicit method

Assignment 11. Solve above unsteady heat conduction equation for time step t = 10s, 5, 2, 1, 0.5 and 0.2. Compare the results with implicit and explicit method. Analytical solution at t = 10 s is T = 64.8018. Comment on the convergence and stability.

End