Math 690N - Final Report

Similar documents
The Level Set Method. Lecture Notes, MIT J / 2.097J / 6.339J Numerical Methods for Partial Differential Equations

BACK AND FORTH ERROR COMPENSATION AND CORRECTION METHODS FOR REMOVING ERRORS INDUCED BY UNEVEN GRADIENTS OF THE LEVEL SET FUNCTION

A Toolbox of Level Set Methods

Realistic Animation of Fluids

Numerical Analysis of Shock Tube Problem by using TVD and ACM Schemes

Level set methods Formulation of Interface Propagation Boundary Value PDE Initial Value PDE Motion in an externally generated velocity field

Level Set Method in a Finite Element Setting

The Level Set Method applied to Structural Topology Optimization

Turbulent Premixed Combustion with Flamelet Generated Manifolds in COMSOL Multiphysics

Realistic Animation of Fluids

Overview of Traditional Surface Tracking Methods

The Immersed Interface Method

CS205b/CME306. Lecture 9

Inviscid Flows. Introduction. T. J. Craft George Begg Building, C41. The Euler Equations. 3rd Year Fluid Mechanics

Applying Solution-Adaptive Mesh Refinement in Engine Simulations

Immersed Boundary Method and Chimera Method applied to Fluid-

FEMLAB Exercise 1 for ChE366

Investigating The Stability of The Balance-force Continuum Surface Force Model of Surface Tension In Interfacial Flow

PARAMETRIC SHAPE AND TOPOLOGY OPTIMIZATION WITH RADIAL BASIS FUNCTIONS

Continuum-Microscopic Models

Implicit Surface Reconstruction from 3D Scattered Points Based on Variational Level Set Method

CFD MODELING FOR PNEUMATIC CONVEYING

weighted minimal surface model for surface reconstruction from scattered points, curves, and/or pieces of surfaces.

NUMERICAL VISCOSITY. Convergent Science White Paper. COPYRIGHT 2017 CONVERGENT SCIENCE. All rights reserved.

EXPLICIT AND IMPLICIT TVD AND ENO HIGH RESOLUTION ALGORITHMS APPLIED TO THE EULER AND NAVIER-STOKES EQUATIONS IN THREE-DIMENSIONS RESULTS

REVIEW I MATH 254 Calculus IV. Exam I (Friday, April 29) will cover sections

Math 265 Exam 3 Solutions

(LSS Erlangen, Simon Bogner, Ulrich Rüde, Thomas Pohl, Nils Thürey in collaboration with many more

Solving Partial Differential Equations on Overlapping Grids

Medical Image Segmentation using Level Sets

Gradient Free Design of Microfluidic Structures on a GPU Cluster

CS 231. Fluid simulation

Animation of Fluids. Animating Fluid is Hard

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

An Overview of Computational Fluid Dynamics

Debojyoti Ghosh. Adviser: Dr. James Baeder Alfred Gessow Rotorcraft Center Department of Aerospace Engineering

CGT 581 G Fluids. Overview. Some terms. Some terms

Progress on Engine LES Using STAR-CD

CUDA. Fluid simulation Lattice Boltzmann Models Cellular Automata

Math 213 Calculus III Practice Exam 2 Solutions Fall 2002

Level-set and ALE Based Topology Optimization Using Nonlinear Programming

Modeling and Simulation of Single Phase Fluid Flow and Heat Transfer in Packed Beds

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

Unstructured Mesh Generation for Implicit Moving Geometries and Level Set Applications

Shape optimisation using breakthrough technologies

Introduction to C omputational F luid Dynamics. D. Murrin

Weno Scheme for Transport Equation on Unstructured Grids with a DDFV Approach

f xx (x, y) = 6 + 6x f xy (x, y) = 0 f yy (x, y) = y In general, the quantity that we re interested in is

Introduction to Computer Graphics. Modeling (3) April 27, 2017 Kenshi Takayama

More Animation Techniques

FEM techniques for interfacial flows

Nonoscillatory Central Schemes on Unstructured Triangulations for Hyperbolic Systems of Conservation Laws

Non-Newtonian Transitional Flow in an Eccentric Annulus

Imagery for 3D geometry design: application to fluid flows.

Navier-Stokes & Flow Simulation

1. Suppose that the equation F (x, y, z) = 0 implicitly defines each of the three variables x, y, and z as functions of the other two:

13.1. Functions of Several Variables. Introduction to Functions of Several Variables. Functions of Several Variables. Objectives. Example 1 Solution

Navier-Stokes & Flow Simulation

3. The three points (2, 4, 1), (1, 2, 2) and (5, 2, 2) determine a plane. Which of the following points is in that plane?

A hybrid level-set method in two and three dimensions for modeling detonation and combustion problems in complex geometries

IMAGE ANALYSIS DEDICATED TO POLYMER INJECTION MOLDING

Numerical Methods for PDEs. SSC Workgroup Meetings Juan J. Alonso October 8, SSC Working Group Meetings, JJA 1

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

PHYSICALLY BASED ANIMATION

Evolution, Implementation, and Application of Level Set and Fast Marching Methods for Advancing Fronts

Modelling of Levitation Melting using a Fixed Mesh Method

Parallelization study of a VOF/Navier-Stokes model for 3D unstructured staggered meshes

NIA CFD Seminar, October 4, 2011 Hyperbolic Seminar, NASA Langley, October 17, 2011

A new Eulerian computational method for the propagation of short acoustic and electromagnetic pulses

Navier-Stokes & Flow Simulation

Numerical and theoretical analysis of shock waves interaction and reflection

Multigrid Solvers in CFD. David Emerson. Scientific Computing Department STFC Daresbury Laboratory Daresbury, Warrington, WA4 4AD, UK

Moment of fluid method for multimaterial flows

Math 209, Fall 2009 Homework 3

Efficient Tridiagonal Solvers for ADI methods and Fluid Simulation

Development of a CFD methodology for fuel-air mixing and combustion modeling of GDI Engines

Surface Tension Approximation in Semi-Lagrangian Level Set Based Fluid Simulations for Computer Graphics

Two-Phase flows on massively parallel multi-gpu clusters

Semi-Implicit Level Set Methods for Curvature and Surface Diffusion Motion

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

Adarsh Krishnamurthy (cs184-bb) Bela Stepanova (cs184-bs)

ALE Seamless Immersed Boundary Method with Overset Grid System for Multiple Moving Objects

Prim ary break-up: DNS of liquid jet to improve atomization m odelling

Lecture 1: Finite Volume WENO Schemes Chi-Wang Shu

CONFORMAL MAPPING POTENTIAL FLOW AROUND A WINGSECTION USED AS A TEST CASE FOR THE INVISCID PART OF RANS SOLVERS

Computational Methods for Advancing Interfaces

Solution for Euler Equations Lagrangian and Eulerian Descriptions

A novel model for biolm growth and its resolution by using the hybrid immersed interface-level set method

Applying a new dispersion model to turbulent premixed flames

Moving Interface Problems: Methods & Applications Tutorial Lecture II

Lecture 1.1 Introduction to Fluid Dynamics

Validation of an Automatic Mesh Generation Technique in Engine Simulations

Simulation of Turbulent Axisymmetric Waterjet Using Computational Fluid Dynamics (CFD)

Chapter 24. Creating Surfaces for Displaying and Reporting Data

= w. w u. u ; u + w. x x. z z. y y. v + w. . Remark. The formula stated above is very important in the theory of. surface integral.

Realtime Water Simulation on GPU. Nuttapong Chentanez NVIDIA Research

Computation of Velocity, Pressure and Temperature Distributions near a Stagnation Point in Planar Laminar Viscous Incompressible Flow

Faculty of Mechanical and Manufacturing Engineering, University Tun Hussein Onn Malaysia (UTHM), Parit Raja, Batu Pahat, Johor, Malaysia

A STUDY ON THE UNSTEADY AERODYNAMICS OF PROJECTILES IN OVERTAKING BLAST FLOWFIELDS

Flow Structures Extracted from Visualization Images: Vector Fields and Topology

Transcription:

Math 690N - Final Report Yuanhong Li May 05, 008 Accurate tracking of a discontinuous, thin and evolving turbulent flame front has been a challenging subject in modelling a premixed turbulent combustion. Level set method can be applied to improve the premixed turbulent combustion simulation by providing a better capturing of this highly trasient flame front []. This report presents the application of the level set method derived from the G-equation [] to simulate a flame propagation in premixed internal combustion engine combustions. Problem description In a premixed engine combustion, it is well accepted that a corrugated flame front divides the flow field into a burnt region and an unburnt region []. In the level set method, this flame front corresponds to an iso-scalar surface or zero-level set surface as G(x, t) = G 0. () As shown in Figure, G > G 0 is the region of burnt gas and G < G 0 is that of the unburnt mixture. The choice of G 0 is arbitary but fixed for a particular combustion event. The level set model will be derived from the above equation.

Algorithm description The well-known level-set model (G-equation) was initially introduced by Markstein [] in 964. In 985, Williams [3] introduced the method to describe flame front evolution. Later, Peters [] made significant contributions for modelling turbulent combustion using this approach. In this section, a transport equation for an instantaneous flame location G is first derived from equation (), followed by the derivation of the transport equation for the mean G.. Equation of Motion Differentiating equation () with respect to t results in a transport equation for the scalar G as G t + G d x f = 0, () dt where d x f is the propagation velocity and equals the sum of the flow velocity v dt f at the front and the burning velocity in the normal direction d x f = v f + ns L, (3) dt and the vector normal to the front in the direction of the unburnt gas n is defined by n = G G. (4) Substitution of equation (3) and (4) into equation () gives equation of motion as G t + v f G = s L G. (5). Reformulation The burning velocity s L is usually not well defined since it can be complicated by many factors such as flame stretch and curvature. By taking into account the effects of flame stretch and curvature, the motion equation is reformulated as G t + v f G = s T G Dκ G, (6) where s T is the turbulent turning velocity, D is Markstein diffusivity, and κ is the flame curvature defined by κ = n = ( G ). (7) G.3 Level set description Mean quantities are usually solved in CFD applications, i.e., mean pressure, mean velocities and mean temperature are solved in the averaged Navier-Stokes governing equations. To be consistent with CFD convention, a mean G is sought as well. According to Peters [], the equation for the mean location of turbulent flame front can be written as G t + ( v f v v ) G = ρ u ρ G D t κ G, (8) where v v is the velocity of the moving vertex, ρ u is the unburnt gas density and ρ is the gas density at the mean location of the turbulent flame which is defined by G( x, t) = 0, and κ is mean flame front curvature.

.4 Needed level set techniques The level set equation (8) will not be solved until the fully developed turbulent flame is established as dictated by an ignition kernel length [4]. At this moment, an initial value, G( x, 0), is required, which is computed by using the signed distance from each vertex to the kernel front as follows. When the cell vertex i4 is outside the ignition kernel, G( x, t) = (x(i4) x p (i4)) + (y(i4) y p (i4)) + (z(i4) z p (i4)), (9) and when the cell vertex i4 is inside the ignition kernel, G( x, t) = (x(i4) x p (i4)) + (y(i4) y p (i4)) + (z(i4) z p (i4)), (0) where x(i4),y(i4),and z(i4) are the coordinates of vertex i4, and x p (i4),y p (i4),and z p (i4) are the positions of the ignition marker particles. In addition, reinitialization of the level set function is needed in order to reduce the numerical errors caused by steepening and flattening effects [5]. Also the so-called narrow band concept [6] is employed to reduce computation time where only the vertices near the flame surface is updated and reinitialized. 3 Discretization Solving the level set equation involves the discretizations of a temporal term and several spatial terms. With physics in mind the convection term and diffusion terms must be discretized using different schemes. 3. Discretization schemes Here a second-order ENO [7] is used to discretize the spatial gradients involved in the terms of G and ρū G. Central differences are used to discretize each term of D ρ t κ G. A first-order forward Euler scheme is used for the temporal term. Thus equation (8) can be discretized as follows. G n+ G n t = ( ρ u) n ρ n [max(s 0n t, 0) + + min(s 0n ( D t ) n ( κ) n D 0x + D0y + D0z [max(u n un vertex, 0)A + min(un un vertex, 0)B + max(v n v n vertex, 0)C + min(v n v n vertex, 0)D + max(w n w n vertex, 0)E + min(w n w n vertex, 0)F ], t, 0) ] () 3

where A, B, C, D, E, F are the terms resulting from the nd order ENO scheme as A = D x + x l B = D +x + x r C = D y + y f D = D +y + y d E = D z + z b F = D +z + z t min mod(d x x min mod(d +x+x min mod(d y y min mod(d +y+y min mod(d z z min mod(d +z+z, D+x x, D+x x ), () ), (3), D+y y ), (4), D+y y ), (5), D+z z ), (6), D+z z ), (7) where x l, x r, y f, y d, z b, z t are the distances between vertices i and i,i and i +, j and j, j and j +, k and k, k and k +, respectively, the switch function min mod is given by { sign(x) min( x, y ) if xy > 0, min mod(x, y) = 0 otherwise. and the differencing operators in x coordinate direction are defined by D +x x D x x D +x+x D x = G G i,j,k x l, (8) D +x = G i+,j,k G x r, (9) = G i+,j,k x l G ( x l + x r ) + G i,j,k x r ( x l x r + x l x r ), (0) = G i,j,k ( x l + x l ) G i,j,k x l G x l [ x l ( x, () l + x l ) ( x l + x l ) x l ] = G i+,j,k ( x r + x r ) G i+,j,k x r G x r [ x r ( x. () r + x r ) ( x r + x r ) x r ] Other terms such as D y, D+y, D z, D+z, D+y y, D y y, D+y+y defined similarly. The gradient terms +, are differenced as follows, D+z z, D z z, D+z+z can be + = [min(a, 0) + max(b, 0) + min(c, 0) + max(d, 0) + (3) min(e, 0) + max(f, 0) ], = [min(b, 0) + max(a, 0) + min(d, 0) + max(c, 0) + (4) min(f, 0) + max(e, 0) ]. 4

3. Re-initialization The re-initialization of the level set function is required to reduce the numerical errors caused by steepening and flattening gradient effects [5]. The condition G = is applied to the level sets for G( x, t) 0. The algorithm proposed by Sussman [8] is used to ensure that this condition is satisfied by the level sets for G( x, t) 0. In the algorithm a new level-set functin G ( x, t) is constructed in such a way that its zero level set is the same as the level set function G 0 ( x, t) at the flame front while it is set to be the signed normal distance to the flame front away from the zero level set. Specifically, G ( x, t) is defined as where S( G 0 ) is the sign function designed as G ( x, t) = S( G 0 )( G ( x, t) ), (5) S( G 0 ) = G 0 ( x, t), (6) G 0 ( x, t) + ε where ε is a small number. And at t = 0, G ( x, 0) = G 0 ( x, 0). 4 Test Problems and expected results A simple sphere growth problem [4] is considered to test the numerical schemes used for the level set method. In this experiment the sphere with an initial radius of 0mm grows radially at a prescribed speed of s grow = 0m/s. And no flow convection is considered. So the level set equation reduces to G t = s grow G. (7) To measure the shape change of the sphere during its grow, an effective radius error parameter,r rms,is defined as (r rtheory ) R rms =, (8) n where n is the total number of piercing points of the sphere s surface with cell edges, r is the calculated radius, and r theory is the theoretical radius of the growing sphere. 4. Computational setup The reduced equation is discretized by the schemes described above. To test the effects of grid size on the scheme prediction accuracy, three different meshes with average cell sizes of 6., 3. and.3mm are used. The initial sphere radius of 0mm specifies both the initial and boundary conditions for the calculations. 4. Expected results Since only sphere growth is considered here, the calculated surface would be a nearly perfect sphere surface at any later time if the schemes were accurate. Figure shows the comparison between the calculated radius and the theoretical radius. Only slight differences are seen in the radius. As the sphere grows, the error increases. But the relative error R rms /r theory is still relatively small, as can be seen in Figure 3. The predicted radius for the different grids are shown in Figure 4. For the test case, the numerical schemes are not sensitive to the grid size. 5

6

References [] Peters, N., Turbulent Combustion, Cambridge university press, 000. [] Markstein, G., Nonsteady flame propagation, Pergamon Press,Oxford, 964. [3] Williams, F.A., The Mathematics of Combustion, SIAM, Philadelphia, PA, pp.97-3,985. [4] Tan, Z. and Reitz, R.D., An ignition and combustion model based on the level-set method for spark ignition engine multidimensional modeling, Combustion and Flame, 45, pp.-5,006. [5] Osher, S. and Fedkiw, R., Level Set Methods and Dynamic Implicit Surfaces, Springer-Verlag New York, Inc, 003. [6] Chopp, D.L., Computing minimal-surfaces via level set curvature flow, Journal of Computational Physics, 06, pp.77-9,993. [7] Harten, A., Engquist, B. Osher, S. and Chakravarthy, S., Uniformly high-order accurate essentially nonoscillatory schemes,3, Journal of Computational Physics, 7, pp.3-303,987. [8] Sussman, M., Smereka, and S. Osher, A level set approach for computing solutions to incompressible -phase flow, Journal of Computational Physics, 4, pp.46-59,994. 7