• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Cartesian grid methods for the compressible Navier-Stokes equations

Skøien, Are Arstad January 2012 (has links)
A Cartesian grid method has been developed for solving the 2D Euler and Navier-Stokes equations for viscous and inviscid compressible flow, respectively. Both steady and unsteady flows have been considered. Using a simplified ghost point treatment, we consider the closest grid points as mirror points of the ghost points. Wall boundary conditions are imposed at the ghost points of the immersed boundary. The accuracy of the method has been investigated for various test cases. We show computed examples of supersonic flow past a diamond-wedge airfoil and compare with analytical results. Further we compute time accurate solutions of the compressible Euler equations for an incident shock over a cylinder and compare the pressure time history with other work. The supersonic viscous flow around a NACA0012 airfoil is computed, and the lift and drag coefficients along with the pressure coefficient profile are compared with the literature. The method is also tested for supersonic flow over a cylinder, and the computed skin friction profiles have been used to assess the accuracy. Lastly the supersonic flow around a 2D F-22 fighter aircraft with simulated jet engine outflow is shown to illustrate the flexibility of the method. The present method is built on a previously established simplified ghost point treatment, but performs better. The results are comparable, although not as accurate as other more complex methods.

Page generated in 0.0092 seconds