Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 40 views

    Unit 3 Discritization: Dr. Naveen G Patil Ajeekya Dy Patil Univrsity School of Engineering

    Uploaded by

    Shreeyash Jadhav
     Discretization methods such as the finite difference method (FDM), finite volume method (FVM), and finite element method (FEM) are used to approximate solutions to differential equations. These methods involve chopping continuous functions into discrete functions defined at spaced points.  The FDM describes unknown variables using point samples at node points, using Taylor series expansions to approximate derivatives. The FVM rigorously enforces conservation and is flexible for complex geometries. The FEM uses piecewise functions defined on individual elements to describe local variations.  Explicit methods have simple implementation but restricted time steps. Implicit methods allow larger time steps but require solving systems of equations at each step

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    Unit 3 Discritization: Dr. Naveen G Patil Ajeekya Dy Patil Univrsity School of Engineering

    Uploaded by

    Shreeyash Jadhav
    40 views104 pages
     Discretization methods such as the finite difference method (FDM), finite volume method (FVM), and finite element method (FEM) are used to approximate solutions to differential equations. These methods involve chopping continuous functions into discrete functions defined at spaced points.  The FDM describes unknown variables using point samples at node points, using Taylor series expansions to approximate derivatives. The FVM rigorously enforces conservation and is flexible for complex geometries. The FEM uses piecewise functions defined on individual elements to describe local variations.  Explicit methods have simple implementation but restricted time steps. Implicit methods allow larger time steps but require solving systems of equations at each step

    Original Title

    Unit 3 Discritization

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

     Discretization methods such as the finite difference method (FDM), finite volume method (FVM), and finite element method (FEM) are used to approximate solutions to differential equations. These methods involve chopping continuous functions into discrete functions defined at spaced points.  The FDM describes unknown variables using point samples at node points, using Taylor series expansions to approximate derivatives. The FVM rigorously enforces conservation and is flexible for complex geometries. The FEM uses piecewise functions defined on individual elements to describe local variations.  Explicit methods have simple implementation but restricted time steps. Implicit methods allow larger time steps but require solving systems of equations at each step

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    40 views104 pages

    Unit 3 Discritization: Dr. Naveen G Patil Ajeekya Dy Patil Univrsity School of Engineering

    Uploaded by

    Shreeyash Jadhav
     Discretization methods such as the finite difference method (FDM), finite volume method (FVM), and finite element method (FEM) are used to approximate solutions to differential equations. These methods involve chopping continuous functions into discrete functions defined at spaced points.  The FDM describes unknown variables using point samples at node points, using Taylor series expansions to approximate derivatives. The FVM rigorously enforces conservation and is flexible for complex geometries. The FEM uses piecewise functions defined on individual elements to describe local variations.  Explicit methods have simple implementation but restricted time steps. Implicit methods allow larger time steps but require solving systems of equations at each step

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    You are on page 1of 104

    Unit 3

    Discritization

    DR. NAVEEN G PATIL


    AJEEKYA DY PATIL UNIVRSITY
    SCHOOL OF ENGINEERING
    Course content

    Discretization: Basic aspects, Techniques –


    Introduction to FDM, FVM and FEM, Finite
    differences, Explicit and Implicit approaches,
    Thomas algorithms –Numerical
    Finite Volume Method:
    Domain discretization, types of mesh and quality of
    mesh, SIMPLE, pressure velocity coupling,
    Checkerboard pressure field and staggered grid
    approach Numerical. TDMA algorithm or Thomas
    algorithms
    Taylors series

    Lets us considered the fluid particles moving with velocity u in directions x with
    small distances dx .
    In order to find the fluid properties at distance dx can be determine by using
    Taylors series
     Discretization methods are used to chop a continuous
    function (i.e., the real solution to a system of differential
    equations in CFD) into a discrete function, where the
    solution values are defined at each point in space and
    time. 
     Discretization simply refers to the spacing between each
    point in your solution
    a) Finite Difference Method (FDM): Describes an unknown
    variable ϕ by means of point samples at node points.
     Truncated Taylor series expansions are used to generate finite
    difference approximations to the derivatives of ϕ at each grid
    point and its immediate neighbours.
     This method is discussed in more depth in future posts.
     Advantages: ease of implementation.
    Disadvantages: restricted to simple grids and does not conserve
    momentum, energy, and mass on coarse grids.
     b) Finite Element Method (FEM): Uses simple piece-wise function (A piece-wise function is a
    function whose definition changes depending on the value of the independent variable), valid on
    individual elements to describe the local variation of ϕ. The governing equations are precisely satisfied
    by the exact solution of ϕ
     The main application of FEM is in solid mechanics (structural/stress analysis) because it
    has considerable geometric flexibility and general-purpose codes can be used for a wide
    variety of physical problems. Some CFD codes (approx. 15%) also make use of this method
    too.
     FEM uses a series of point called nodes which make the mesh. In structural analysis for
    example, this mesh is programmed to contain the material and structural properties
    which define how the structure will react to certain loading conditions
     Nodes are assigned at a certain density throughout the material depending on the
    anticipated stress levels of a particular area. Regions which will receive large amounts of
    stress usually have a higher node density than those which experience little or no stress.
    Points of interest may consist of: fracture point of previously tested material, fillets,
    corners, complex detail, and high stress areas.
     The mesh acts like a spider web in that from each node, there extends a mesh element to
    each of the adjacent nodes.
    Advantages: highest accuracy on coarse grids.
    Excellent for diffusion dominated problems (viscous
    flow) and viscous, free surface problems.
    - Disadvantages: long processing time for large
    problems and not well suited for turbulent flow
     Finite Volume Method (FVM): Developed as a variant of the finite difference
    formulation. This is a common method adopted and will be discussed in more
    depth later on. The FVM is popular in fluid mechanics because it rigorously
    enforces conservation and it is flexible in terms of both geometry and the variety
    of fluid, therefore most of CFD codes (including the ones mentioned earlier –
    approx. 80%) are based on finite volume method.
     - Advantages: basic FV control volume balance does not limit cell shape; mass,
    momentum, energy conserved even on coarse grids; efficient, iterative solvers well
    developed.
     - Disadvantages: false diffusion when simple numerics are used.
    Domain Discritization
    Let us consider uij is velocity component along x direction, then find first
    order first order first degree forward method velocity (ui+1, j) component

    First order forward difference method


     Let us consider uij is velocity component along x direction, then find first
    order first degree backward method first degree velocity (ui-1, j) component
    Let us considered Taylors series
    First order FDM equation along x marching
    First order FDM equation along Y marching
    Mixed derivative
    P+Q-1 central diffence =2+6-1=7

    P+Q for one side diffence=2+6=8

    P=order of the equation =2


    Q = at accuracy of the solution=6
    Example 2

    Derive the third order accurate FDM equation in one sided difference
    in y marching
    Meshing

    A Mesh is a network that is formed of cells and points.


    Meshing is a part of the engineering simulation manner
    Where complex geometries and models are divided into
    simple elements that can be used as discrete local
    approximations of the larger domain.
    The Mesh can be resembled into any shape and size
    depending upon the geometry and is used to resolve
    Partial Differential Equations.
    Why meshing ????
    Why it is required

    In any continuous object which is considered for


    analysis has an infinite number of points, making it
    practically not possible to obtain a finite number of
    equations and converge to a solution.
    Finite number of points and then interpolate the
    obtained results for the entire domain.
    The Finite element Method reduces the number of
    nodes/points from infinite into a finite number with
    the help of discretization or meshing.
    Classification of mesh Elements.
    Based on Type of Grids
     Based on the types of grids, the mesh can be classified into structured and
    unstructured mesh depending on the layout of the mesh. 

    Unstructured Mesh
     Unstructured meshes are meshes with general connectivity whose structure is
    arbitrary (random) and hence the connectivity between the elements must be
    defined and stored. The unstructured element types have triangular elements (2D)
    or tetrahedral (3D) elements
    Structured Mesh
     Structured meshes are meshes with implicit (absolute) connectivity whose
    structure allows for easy identification of elements and nodes. In General, the
    structured meshes have quadrilateral elements (2D) or hexahedral (3D) elements. 
     Local meshing control: Only the portion of the scoped face or body within
     Global mesh control :A “default” mesh is automatically generated during a
    solution
     It is generally recommended that additional controls be added to the default
    mesh before solving.
     A finer mesh produces more precise answers but also increases CPU time and
    memory requirements.
    How to decide the Element type for Meshing 
     The element type for meshing mainly depends on
    three factors. The following are discussed below
     Geometry Shape and size.
     Type of Analysis.
     Time Allotted for the project.
    Introduction to Explicit Schemes
    One dimensional unsteady state heat conduction
    equation

    In th above equation one marching is there time factor (t) is marching along x
    direction
    Let us considered eq 1 substitute eq 2 and eq 3 in eq 1
    The above eq 6 is called as T is known at
    time interval all grid points n
    Explicit and Implicit

    Let us considered the eq 5


    Difference between Implicit and Explicit Method

    Explicit Implicit
    Time set up is very less Maintain the larger values
    time step
    Only one parameter is More than one parameter
    unknown is unknown

    Relatively simple to the More complex is set the


    program problem
    Numerical on Explicit method

    The temperature of the of the left and right side of the


    stainless steel rod 50 C and 25 C respectively .The length
    rod will be 1m . Initial temperature of the rod inner node
    will 0C . Determine the temperature distribution of rod
    after 5 sec.
    Given Data: α=1 x 10-7, delt t=1 sec ,
    delt x=1mm= 1x10-3m
    Example 2
    The temperature of the of the left and right side of the stainless steel rod 75 C and 30 C
    respectively .The length rod will be 1m . Initial temperature of the rod inner node will
    0C . Determine the temperature distribution of rod after 12 sec.
    Introduction to Implicit Scheme
    Note:
    1. More than one unknown is present in the equation
    that time u can solve using implicit scheme
    2. The time step will not be small u can give any
    arbitrary time step
    Tri-diagonal Matrix algorithms-(TDMA) or Thomas algorithms

    What is TDMA??
    A tridiagonal matrix is a band matrix that has nonzero
    elements only on the main diagonal, the first diagonal
    below this, and the first diagonal above the main
    diagonal.
     The matrix can be symmetric, having the same number of
    sub- and super diagonals. If a matrix has only one sub-
    and one super-diagonal, we have a tri-diagonal matrix etc.
     The number of super-diagonals is called the upper
    bandwidth (two in the example), and the number of sub-
    diagonals is the lower bandwidth (three in the
    example).
     The total number o f diagonals, six in the example, is the
    bandwidth.
    Tri-diagonal Matrix algorithms-(TDMA)

    A band matrix is a sparse matrix whose non-zero


    entries are confined to a diagonal band,
    comprising the main diagonal and zero or more
    diagonals on either side.
    Numerical on Implicit scheme

    The temperature of the of the left and right side of the


    stainless steel rod 50 C and 25 C respectively .The length
    rod will be 1m . Initial temperature of the rod inner node
    will 0C . Determine the temperature distribution of rod
    after 5 sec.
    Correlations

    Nodes βj Dj αj Cj Aj Cj’

    n
    Introduction to Semi-Impilict or Crank-Nicolsons
    The general form of equation

    Node 1:

    Node 2:

    Node 3:

    Node 4:

    Node 5:
    Steps in Thomas algorithms

    Aj and Cj’ can be start from


    the j=1

    But φj is always start from


    j=5 after finding the Aj and
    Cj’

    Φj is unknow parameter of
    the any fluid flow (
    temp, pressure etc)
    Numerical Example 2
    Numerical Example 2

    You might also like