Please use this identifier to cite or link to this item:
|Title:||A local domain-free discretization method to simulate three-dimensional compressible inviscid flows|
Compressible inviscid flows
|Citation:||Zhou, C.H., Shu, C. (2009-11). A local domain-free discretization method to simulate three-dimensional compressible inviscid flows. International Journal for Numerical Methods in Fluids 61 (9) : 970-986. ScholarBank@NUS Repository. https://doi.org/10.1002/fld.1992|
|Abstract:||In this paper, the domain-free discretization method (DFD) is extended to simulate the three-dimensional compressible inviscid flows governed by Euler equations. The discretization strategy of DFD is that the discrete form of governing equations at an interior point may involve some points outside the solution domain. The functional values at the exterior-dependent points are updated at each time step by extrapolation along the wall normal direction in conjunction with the wall boundary conditions and the simplified momentum equation in the vicinity of the wall. Spatial discretization is achieved with the help of the finite element Galerkin approximation. The concept of 'osculating plane' is adopted, with which the local DFD can be easily implemented for the three-dimensional case. Geometry-adaptive tetrahedral mesh is employed for three-dimensional calculations. Finally, we validate the DFD method for threedimensional compressible inviscid flow simulations by computing transonic flows over the ONERA M6 wing. Comparison with the reference experimental data and numerical results on boundary-conforming grid was displayed and the results show that the present DFD results compare very well with the reference data. Copyright © 2009 John Wiley & Sons, Ltd.|
|Source Title:||International Journal for Numerical Methods in Fluids|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 19, 2018
WEB OF SCIENCETM
checked on Sep 10, 2018
checked on Jul 27, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.