Abstract

Abstract A verification study was conducted for URANS (Unsteady Reynolds-Averaged Navier–Stokes) simulations of flow around a 5:1 rectangular cylinder at a Reynolds number of 56,700 (based on the cylinder depth) using the k–ω SST (shear stress transport) turbulence model and the γ−Reθ transition model for three types of grids (a fully structured grid and two hybrid grids generated using Delaunay and advancing front techniques). The grid convergence index (GCI) and least squares (LS) procedures were employed to estimate discretization error and associated uncertainties. The result indicates that the LS procedure provides the most reliable estimates of discretization error uncertainties for solution variables in the structured grid from the k–ω SST model. From the six solution variables of interest, the highest relative uncertainty was typically observed in the root-mean-square (rms) of lift coefficient, followed by time-averaged reattachment length and peak rms of pressure coefficient on the top and bottom surfaces of the cylinder. The solution variable with the lowest uncertainty was Strouhal number, followed by time-averaged drag coefficient. It is also noted that the GCI and LS procedures produce noticeably different uncertainty estimates, primarily due to inconsistences in their estimated observed orders of accuracy and safety factors. To successfully apply the procedures to practical problems, further research is required to reliably estimate uncertainties in solutions with “noisy” grid convergence behaviors and observed orders of accuracy.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.