Adaptive unstructured grid generation for engineering computation of aerodynamic flows

A. Jahangirian and Y. Shoraka

Mathematics and Computers in Simulation (MATCOM), 2008, vol. 78, issue 5, 627-644

Abstract: A unified framework is presented for automatic unstructured grid generation and grid flow adaptation. The method can simultaneously refine and coarsen the grid cells, a capability that is heavily required in transient flow problems. The proposed method includes a Cartesian grid generation approach in the first stage that enables an automatic field discretization without need to explicitly define the surface grid. The Cartesian grid cells are then subdivided in such a way that prevents the existence of hanging nodes. This allows the application of efficient fully unstructured flow solvers. The capabilities of the method are demonstrated by flow computation around a maneuver wing-flap geometry (SKF 1.1) at transonic flow conditions. An explicit finite volume cell-centered scheme is used for numerical solution of compressible inviscid flow equations. Results show the efficiency and applicability of the method.

Keywords: Unstructured grid generation; Grid adaptation; Cartesian grid (search for similar items in EconPapers)
Date: 2008
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475408001614
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:78:y:2008:i:5:p:627-644

DOI: 10.1016/j.matcom.2008.04.004

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().