1 / 13

Objective

This text provides an overview of the numerical methods and discretization techniques used for solving unsteady state problems in computational fluid dynamics (CFD), using a 1D example with 60,000 elements. It covers the equation matrix, iteration methods, and alternative solutions. It also discusses the Navier-Stokes equations, continuity equation, momentum equations, and the SIMPLE algorithm.

nealb
Télécharger la présentation

Objective

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Objective • Unsteady state • Discretization • Numerical methods • CFD specifics

  2. 1D example multiple (N) volumes N unknowns i N 1 2 N-1 3 Equation for volume 1 N equations Equation for volume 2 …………………………… Equation matrix: For 1D problem 3-diagonal matrix

  3. 3D problem Equation in the general format: H N W E P S L Wright this equation for each discretization volume of your discretization domain A F 60,000 elements 60,000 cells (nodes) N=60,000 = x 60,000 elements 7-diagonal matrix This is the system for only one variable ( ) When we need to solve p, u, v, w, T, k, e, C system of equation is larger

  4. Iteration method Alternative to use matrix solver tool is to use iterations You can use excel if you are not familiar with matrix solver tools General Iteration Procedure: 1) Express equation in explicit form 2) Guess initial values 3) Substitute initial values and calculate new values 4) Substitute new values and calculate newer values 6) Repeat step 4) until convergence is achieved example Iterations -residual 2 2 2 Difference of value between two iteration 2 2

  5. Numerical instabilitydivergency divergence variable solution convergence iteration

  6. Navier Stokes Equations Continuity equation This velocities that constitute advection coefficients: F=rV Momentum x Momentum y Momentum z Pressure is in momentum equations which already has one unknown • In order to use linear equation solver we need to solve two problems: • find velocities that constitute in advection coefficients • 2) link pressure field with continuity equation

  7. Pressure and velocities in NS equations How to find velocities that constitute in advection coefficients? For the first step use Initial guess And for next iterative steps use the values from previous iteration

  8. Pressure and velocities in NS equations How to link pressure field with continuity equation? SIMPLE (Semi-Implicit Method for Pressure-Linked Equations ) algorithm Dx Dx P E W Dx Ae Aw Aw=Ae=Aside We have two additional equations for y and x directions The momentum equations can be solved only when the pressure field is given or is somehow estimated. Use * for estimated pressure and the corresponding velocities

  9. SIMPLE algorithm(Semi-Implicit Method for Pressure Linked Equations.) Guess pressure field: P*W, P*P, P*E, P*N , P*S, P*H, P*L 1) For this pressure field solve system of equations: x: ……………….. y: ……………….. z: Solution is: 2)The pressure and velocity correction P = P* + P’ P’ – pressure correction For all nodes E,W,N,S,… V = V* + V’ V’ – velocity correction Substitute P=P* + P’ into momentum equations (simplify equation) and obtain V’=f(P’) V = V* + f(P’) 3) Substitute V = V* + f(P’) into continuity equation solve P’ and then V 4) Solve T , k , e equations

  10. SIMPLE algorithm start Guess p* p=p* Step1: solve V* from momentum equations Step2: introduce correction P’ and express V = V* + f(P’) Step3: substitute V into continuity equation solve P’ and then V Step4: Solve T , k , e equations no Converged (residual check) yes end

  11. Other methods SIMPLER SIMPLEC variation of SIMPLE PISO COUPLED - use Jacobeans of nonlinear velocity functions to form linear matrix ( and avoid iteration )

  12. Relaxation Relaxation with iterative solvers: When the equations are nonlinear it can happen that you get divergency in iterative procedure for solving considered time step divergence variable solution convergence Solution is Under-Relaxation: Y*=f·Y(n)+(1-f)·Y(n-1) Y – considered parameter , n –iteration , f – relaxation factor For our example Y*in iteration101=f·Y(100)+(1-f) ·Y(99) f = [0-1] – under-relaxation -stabilize the iteration f = [1-2] – over-relaxation - speed-up the convergence iteration Value which is should be used for the next iteration Under-Relaxation is often required when you have nonlinear equations!

  13. Example of relaxation Example: Advection diffusion equation, 1-D, steady-state, 4 nodes 1) Explicit format: 4 3 1 2 2) Guess initial values: 3) Substitute and calculate: Substitute and calculate: 4) Substitute and calculate: ………………………….

More Related