Date of Award:
Master of Science (MS)
Mechanical and Aerospace Engineering
The strand-Cartesian grid approach is a unique method of generating and computing fluid dynamic simulations. The strand-Cartesian approach provides highly desirable qual- ities of fully-automatic grid generation and high-order accuracy. This thesis focuses on the implementation of the Spalart-Allmaras turbulence model to the strand-Cartesian grid framework. Verification and validation is required to ensure correct implementation of the turbulence model.
Mathematical code verification is used to ensure correct implementation of new algo- rithms within the code framework. The Spalart-Allmaras model is verified with the Method of Manufactured Solutions (MMS). MMS shows second-order convergence, which implies that the new algorithms are correctly implemented.
Validation of the strand-Cartesian solver is completed by simulating certain cases for comparison against the results of two independent compressible codes; CFL3D and FUN3D. The NASA-Langley turbulence resource provided the inputs and conditions required to run the cases, as well as the case results for these two codes. The strand solver showed excellent agreement with both NASA resource codes for a zero-pressure gradient flat plate and bump- in-channel. The treatment of the sharp corner on a NACA 0012 airfoil is investigated, resulting in an optimal external sharp corner configuration of strand vector smoothing with a base Cartesian grid and telescoping Cartesian refinement around the trailing edge. Results from the case agree well with those from CFL3D and FUN3D. Additionally, a NACA 4412 airfoil case is examined, and shows good agreement with CFL3D and FUN3D, resulting in validation for this case.
tong, Oisin, "Verification and Validation of the Spalart-Allmaras Turbulence Model for Strand Grids" (2013). All Graduate Theses and Dissertations. Paper 2050.
Copyright for this work is retained by the student. If you have any questions regarding the inclusion of this work in the Digital Commons, please email us at .