Please use this identifier to cite or link to this item:
|Title:||Euler solution using cartesian grid with least squares technique||Authors:||Koh, E.P.C.
|Issue Date:||2003||Citation:||Koh, E.P.C.,Tsai, H.M.,Liu, F. (2003). Euler solution using cartesian grid with least squares technique. 41st Aerospace Sciences Meeting and Exhibit. ScholarBank@NUS Repository.||Abstract:||This paper discusses an approach that uses "gridless" or "meshless" methods to address the boundary or interface while standard structured grid methods are used everywhere else. The present method uses the Cartesian grid to specify and distribute the computational points on the boundary surface but not to define the geometrical properties. Euler fluxes for the neighbors of cut cells are computed using the gridless method involving a local least-squares curve fit to a "cloud" of grid points. The boundary conditions implemented on the surface points are automatically satisfied in the process of evaluating the surface values in a similar least-squares fashion. No halo points are needed. The overall scheme is robust, stable and converges well for a range of Mach numbers tested. Solutions from the proposed approach are computed for the NACA 0012 and RAE 2822 airfoils and the results are compared with those obtained by a standard Euler solver using body-fitted grids. For grids with equal resolution the method is less accurate for capturing shocks but an improvement in resolution of 60% gives a sharper shock front. The approach offers a number of advantages and its extension to three dimensions is straightforward. © 2003 by the American Institute of Aeronautics and Astronautics, Inc. All rights reserved.||Source Title:||41st Aerospace Sciences Meeting and Exhibit||URI:||http://scholarbank.nus.edu.sg/handle/10635/117246||ISBN:||9781624100994|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 1, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.