Module 1: Introduction to Finite Difference Method and Fundamentals of CFD Lecture 6:

Similar documents
Module 1: Introduction to Finite Difference Method and Fundamentals of CFD Lecture 5:

1.2 Numerical Solutions of Flow Problems

Module 1: Introduction to Finite Difference Method and Fundamentals of CFD Lecture 13: The Lecture deals with:

PTE 519 Lecture Note Finite Difference Approximation (Model)

Module 2: Single Step Methods Lecture 4: The Euler Method. The Lecture Contains: The Euler Method. Euler's Method (Analytical Interpretations)

1\C 1 I)J1mptMIll 'betl~flbejlli

Lecture 3.2 Methods for Structured Mesh Generation

Driven Cavity Example

INTERNATIONAL JOURNAL OF CIVIL AND STRUCTURAL ENGINEERING Volume 2, No 3, 2012

Optimised corrections for finite-difference modelling in two dimensions

An Investigation into Iterative Methods for Solving Elliptic PDE s Andrew M Brown Computer Science/Maths Session (2000/2001)

Mathematics for chemical engineers

The Immersed Interface Method

FOURTH ORDER COMPACT FORMULATION OF STEADY NAVIER-STOKES EQUATIONS ON NON-UNIFORM GRIDS

Natural Quartic Spline

Chapter 6. Petrov-Galerkin Formulations for Advection Diffusion Equation

COMPUTER VISION > OPTICAL FLOW UTRECHT UNIVERSITY RONALD POPPE

Simulation in Computer Graphics. Particles. Matthias Teschner. Computer Science Department University of Freiburg

Euler s Methods (a family of Runge- Ku9a methods)

Consider functions such that then satisfies these properties: So is represented by the cubic polynomials on on and on.

Lecture 2.2 Cubic Splines

Introduction to Computer Graphics

Comparison of different solvers for two-dimensional steady heat conduction equation ME 412 Project 2

Module 7 VIDEO CODING AND MOTION ESTIMATION

Digital Image Processing. Prof. P. K. Biswas. Department of Electronic & Electrical Communication Engineering

Truncation Errors. Applied Numerical Methods with MATLAB for Engineers and Scientists, 2nd ed., Steven C. Chapra, McGraw Hill, 2008, Ch. 4.

Fault Tolerant Domain Decomposition for Parabolic Problems

CS205b/CME306. Lecture 9

Math background. 2D Geometric Transformations. Implicit representations. Explicit representations. Read: CS 4620 Lecture 6

MA 323 Geometric Modelling Course Notes: Day 10 Higher Order Polynomial Curves

x n x n stepnumber k order r error constant C r+1 1/2 5/12 3/8 251/720 abs. stab. interval (α,0) /11-3/10

Numerical Aspects of Special Functions

Geometric Modeling of Curves

Math 225 Scientific Computing II Outline of Lectures

Mid-Year Report. Discontinuous Galerkin Euler Equation Solver. Friday, December 14, Andrey Andreyev. Advisor: Dr.

Gradient and Grid Perturbation. 1. Finite Difference Method 2. Complex-Step Method 3. Grid Perturbation

Chapter 4. Matrix and Vector Operations

ODE IVP. An Ordinary Differential Equation (ODE) is an equation that contains a function having one independent variable:

We will load all available matrix functions at once with the Maple command with(linalg).

Computational Acceleration of Image Inpainting Alternating-Direction Implicit (ADI) Method Using GPU CUDA

lecture 8 Groundwater Modelling -1

Three dimensional meshless point generation technique for complex geometry

AM205: lecture 2. 1 These have been shifted to MD 323 for the rest of the semester.

Stability Assessment of Electric Power Systems using Growing Neural Gas and Self-Organizing Maps

Fluent User Services Center

(Part - 1) P. Sam Johnson. April 14, Numerical Solution of. Ordinary Differential Equations. (Part - 1) Sam Johnson. NIT Karnataka.

Prof. B.S. Thandaveswara. The computation of a flood wave resulting from a dam break basically involves two

Lecture 9: Introduction to Spline Curves

An introduction to mesh generation Part IV : elliptic meshing

course outline basic principles of numerical analysis, intro FEM

Handout 4 - Interpolation Examples

Chapter 13. Boundary Value Problems for Partial Differential Equations* Linz 2002/ page

Modern Methods of Data Analysis - WS 07/08

Computational Fluid Dynamics

Efficient Tridiagonal Solvers for ADI methods and Fluid Simulation

Finite Element Analysis Prof. Dr. B. N. Rao Department of Civil Engineering Indian Institute of Technology, Madras. Lecture - 24

Numerical Methods in Physics Lecture 2 Interpolation

CS 4495 Computer Vision Motion and Optic Flow

Computer Project 3. AA Computational Fluid Dyanmics University of Washington. Mishaal Aleem March 17, 2015

Four equations are necessary to evaluate these coefficients. Eqn

Chapter 3 Numerical Methods

Login your clickers & NO calculators. Get the 4.1 checkpoint from the brown table and answer the questions.

Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Video 11.1 Vijay Kumar. Property of University of Pennsylvania, Vijay Kumar

Mechanical Vibrations Chapter 8

EFFICIENT SOLUTION ALGORITHMS FOR HIGH-ACCURACY CENTRAL DIFFERENCE CFD SCHEMES

Abstract. Introduction

Numerical Methods for PDEs : Video 9: 2D Finite Difference February 14, Equations / 29

An Adaptive Stencil Linear Deviation Method for Wave Equations

Multiple View Geometry in Computer Vision

Computational Fluid Dynamics for Engineers

Ordinary Differential Equations

99 International Journal of Engineering, Science and Mathematics

53:244 (58:254) Energy Principles in Structural Mechanics. virtual work, principles of stationary and minimum potential energy;

DLD VIDYA SAGAR P. potharajuvidyasagar.wordpress.com. Vignana Bharathi Institute of Technology UNIT 3 DLD P VIDYA SAGAR

Lecture 7. Transform-and-Conquer

Learning from Data Linear Parameter Models

Finite Math - J-term Homework. Section Inverse of a Square Matrix

lecture 10: B-Splines

AMS527: Numerical Analysis II

x = 12 x = 12 1x = 16

Solve Non-Linear Parabolic Partial Differential Equation by Spline Collocation Method

ADAPTIVE APPROACH IN NONLINEAR CURVE DESIGN PROBLEM. Simo Virtanen Rakenteiden Mekaniikka, Vol. 30 Nro 1, 1997, s

Computational Methods. Sources of Errors

Chapter 6. Semi-Lagrangian Methods

An Adaptive Eigenshape Model

Numerical Linear Algebra

A Modified Spline Interpolation Method for Function Reconstruction from Its Zero-Crossings

Finite Element Analysis Prof. Dr. B. N. Rao Department of Civil Engineering Indian Institute of Technology, Madras. Lecture - 36

16.69 TAYLOR: Manipulation of Taylor series

Graphics Pipeline 2D Geometric Transformations

Using Algebraic Geometry to Study the Motions of a Robotic Arm

Today s class. Roots of equation Finish up incremental search Open methods. Numerical Methods, Fall 2011 Lecture 5. Prof. Jinbo Bi CSE, UConn

Manipulator trajectory planning

Chapter 18. Geometric Operations

The WENO Method in the Context of Earlier Methods To approximate, in a physically correct way, [3] the solution to a conservation law of the form u t

Adaptive numerical methods

Application of Finite Volume Method for Structural Analysis

Lax-Hopf-based LWR solver. Matlab implementation: Manual

The goal is the definition of points with numbers and primitives with equations or functions. The definition of points with numbers requires a

Transcription:

file:///d:/chitra/nptel_phase2/mechanical/cfd/lecture6/6_1.htm 1 of 1 6/20/2012 12:24 PM The Lecture deals with: ADI Method

file:///d:/chitra/nptel_phase2/mechanical/cfd/lecture6/6_2.htm 1 of 2 6/20/2012 12:25 PM ADI Method The difficulties described in the earlier section, which occur when solving the two-dimensional equation by conventional algorithms, can be removed by alternating direction implicit (ADI) methods. The usual ADI method is a two-step scheme given by (6.1) and (6.2) The effect of splitting the time step culminates in two sets of systems of linear algebraic equations. During step 1, we get the following or (6.3) Now for each j rows( j = 2,3...)we can formulate a tridiagonal matrix, for the varying i index and obtain the values from i=2 to (imax-1) at (n+1/2) level Fig.6.1 (a).

file:///d:/chitra/nptel_phase2/mechanical/cfd/lecture6/6_2.htm 2 of 2 6/20/2012 12:25 PM Figure 6.1(a) Similarly, in step-2, we get or Now for each i rows ( i = 2,3...) we can formulate a tridiagonal matrix for the varying j index and obtain the values from j =2 to (jmax-1) at nth level Fig. 2.5 (b).

file:///d:/chitra/nptel_phase2/mechanical/cfd/lecture6/6_3.htm 1 of 1 6/20/2012 12:25 PM With a little more effort, it can be shown that the ADI method is also second- order accurate in time. If we use Taylor series expansion around on either direction, we shall obtain and Subtracting the latter from the former, one obtains or (6.5) The procedure above reveals that the ADI method is second-order accurate with a truncation error of

file:///d:/chitra/nptel_phase2/mechanical/cfd/lecture6/6_4.htm 1 of 1 6/20/2012 12:25 PM Major advantages and disadvantages of explicit and implicit methods Advantages Disadvantages Explicit Method The solution algorithm is simple to set up for a given must be less than a specific limit imposed by stability constraints. This requires many time steps to carry out the calculations over a given interval of t. Implicit Method Stability can be maintained over much larger values of. Fewer time steps are needed to carry out the calculations over a given interval. More involved producer is needed for setting up the solution algorithm than that for explicit method. Since matrix manipulations are usually required at each time step, the computer time per time step is larger than that of the explicit approach. Since larger can be taken, the truncation error is often large, and the exact transients (time variations of the dependent variable for unsteady flow simulation) may not be captured accurately by the implicit scheme as compared to an explicit scheme. Apparently finite-difference solutions seem to be straightforward. The overall procedure is to replace the partial derivatives in the governing equations with finite difference approximations and then finding out the numerical value of the dependent variables at each grid point. However, this impression is needed incorrect! For any given application, there is no assurance that such calculations will be accurate or even stable! We shall soon discuss about accuracy and stability.

file:///d:/chitra/nptel_phase2/mechanical/cfd/lecture6/6_5.htm 1 of 2 6/20/2012 12:25 PM Polynomial-fitting Approach: By assuming a polynomial variation of the field variable in the neighborhood of the point of interest, it is possible to obtain the difference expressions for the derivatives. For instance, degree polynomial can be fitted between n nodes, for the field variable and this polynomial can be used for evaluating upto the derivative. Using two points, say i and i+1, a linear variation can be assumed for the variable and this leads to (6.6) For linear variation between i and (6.7) Similarly, the central difference expression (6.8) can be obtained by using a linear variation between and For parabolic variation between points, and one can set: (6.9) where, a, b, c, are obtained from (6.10) (6.11) (6.12) In matrix form, (6.13)

file:///d:/chitra/nptel_phase2/mechanical/cfd/lecture6/6_5.htm 2 of 2 6/20/2012 12:25 PM Inversion of Eqn. (6.13) leads to the values of a, b, c in terms of and. Having obtained the values of these coefficients, the derivative can be evaluated as: (6.14) where, The second derivative at i can also be evaluated from the polynomial expression of (2.32) and this is given by: (6.15) The polynomial fitting procedure can thus be extended for obtaining difference expressions for higher order derivatives also. By considering neighboring point in addition to i, derivatives upto th order can be calculated. The polynomial fitting technique is very useful when the boundary conditions of the problem are of a very complex nature and involve various derivatives of the unknown dependent variable. Congratulations! You have finished Lecture 6. To view the next lecture select it from the left hand side menu of the page or click the next button.