Abstract
The present paper is a report on progress in the simulation of turbulent flames using the Cray T3D and T3E at the Edinburgh parallel computing centre, using codes developed in Cambridge. Two combustion DNS codes are described, ANGUS and SENGA, which solve incompressible and fully compressible reacting flows respectively. The technical background to combustion DNS is presented, and the resource requirements explained in terms of the physics and chemistry of the problem. Results for flame turbulence interaction studies are presented and discussed in terms of their relevance to modelling. Recent work on the fully compressible problem is highlighted and future directions are outlined.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bray, K.N.C., Libby, P.A., Moss, J.B., 1985, “Unified Modelling Approach for Premixed Turbulent Combustion Part 1: General Formulation”, Combust Flame 61, 87–102.
Bushe, W.K., Cant, R.S., 1996, “Results of Direct Numerical Simulations of Premixed Turbulent Combustion”, CUED Report CUED/A-THERMO/TR63, Cambridge University Engineering Department.
Lele, S., 1992, “Compact Finite Difference Schemes with Spectral like Resolution” J. Comp. Phys. 103, 16–42.
Poinsot, T.J., Lele, S., 1992, “Boundary Conditions for Direct Simulations of compressible Viscous Flows”, J. Comp. Phys. 101. 124–129.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Jenkins, K.W., Bushe, W.K., Leboucher, L.L., Cant, R.S. (1999). Direct Numerical Simulation of Turbulent Flames. In: Allan, R.J., Guest, M.F., Simpson, A.D., Henty, D.S., Nicole, D.A. (eds) High-Performance Computing. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4873-7_43
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4873-7_43
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7211-0
Online ISBN: 978-1-4615-4873-7
eBook Packages: Springer Book Archive