Ramesh, V and Deshpande, SM (2006) Unsteady flow computations for flow past multiple moving boundaries. Technical Report. National Aerospace Laboratories, Bangalore, India.
![]() |
PDF
pd-cf-0606.pdf Restricted to Repository staff only Download (930kB) |
![]() |
Indexer Terms (Generate index codes conversion from application/pdf to indexcodes)
indexcodes.txt Restricted to Repository staff only Download (7kB) |
Abstract
We present the latest developments in the Least Squares Kinetic Upwind Method (LSKUM) a kinetic theory based grid free approach for the solution of Euler equations.13; A single step higher order scheme through Modified CIR splitting is presented A new weighted least squares method has been used in the present work which simplifies the 2-D formulae to an equivalent 1-D form. This is achieved through digitalization of the least squares matrix through suitable choices of the weights. All these developments have been extended to problems with moving nodes and boundaries. A 2-D unsteady Euler code has been developed incorporating all the above ideas along; with the well known dual time stepping procedure. The code has been verified and validated for the standard test case AGARD CT(5) which corresponds to unsteady flow past oscillating NAC AGO 12 airfoil pitching about quarter chord. Good comparisons with the experimental values have been obtained in order to demonstrate the ability of the method to handle multiple moving bodies we have computed unsteady flow past two oscillating NACA0012 airfoils one behind the other. Some interesting results are presented for this case.
Item Type: | Monograph (Technical Report) |
---|---|
Uncontrolled Keywords: | Gridless kinetic upwind scheme;Unsteady flows;Modified CIR splitting;Eigenvector based weights;Dual time stepping |
Subjects: | ENGINEERING > Fluid Mechanics and Thermodynamics |
Depositing User: | Mrs Manoranjitha M D |
Date Deposited: | 16 Jan 2009 |
Last Modified: | 24 May 2010 04:20 |
URI: | http://nal-ir.nal.res.in/id/eprint/2615 |
Actions (login required)
![]() |
View Item |