Type of Document Master's Thesis Author Spitz, Nicolas Author's Email Address nspitz@vt.edu URN etd-05122005-135518 Title Prediction of Trailing Edge Noise from Two-Point Velocity Correlations Degree Master of Science Department Aerospace and Ocean Engineering Advisory Committee

Advisor Name Title Devenport, William J. Committee Chair Glegg, Stewart A. L. Committee Member Simpson, Roger L. Committee Member Keywords

- Compact Eddy Structures
- DNS
- Cross Spectrum
- Proper Orthogonal Decomposition
- Trailing Edge Noise
- Two-Point Correlation Function
Date of Defense 2005-05-04 Availability unrestricted AbstractThis thesis presents the implementation and validation of a new methodology developed by Glegg et al. (2004) for solving the trailing edge noise problem. This method is based on the premises that the noise produced by a surface can be computed by the integral of the cross product between the velocity and vorticity fields, of the boundary layer and shed vorticity (Howe (1978)). To extract the source terms, proper orthogonal decomposition is applied to the velocity cross spectrum to extract modes of the unsteady velocity and vorticity.The new formulation of the trailing edge noise problem by Glegg et al. (2004) is attractive because it applies to the high frequencies of interest but does not require an excessive computational effort. Also, the nature of the formulation permits the identification of the modes producing the noise and their associated velocity fluctuations as well as the regions of the boundary layer responsible for the noise production.

The source terms were obtained using the direct numerical simulation of a turbulent channel flow by Moser et al. (1998). Two-point velocity and vorticity statistics of this data set were obtained by averaging 41 instantaneous fields. For comparisons purposes, experimental boundary layer data by Adrian et al. (2000) was chosen. Statistical reduction of 50 velocity fields obtained by particle image velocimetry was performed and analysis of the two-point correlation function showed features similar to the DNS data case. Also, proper orthogonal decomposition revealed identical dominant modes and eddy structures in the flow, therefore justifying considering the channel flow as an external boundary layer for noise calculations.

Comparison of noise predictions with experimental data from Brooks et al. (1989) showed realistic results with the largest discrepancies, on the order of 5 dB, occurring at the lowest frequencies. The DNS results are least applicable at these frequencies, since these correspond to the longest streamwise lengthscales, which are the most affected by the periodicity conditions used in the DNS and also are the least representative of the turbulence in an external boundary layer flow. Most of the noise was shown to be produced by low-frequency streamwise velocity modes in the bottom 10% of the boundary layer and locations closest to the wall. Only 6 modes were required to obtain noise levels within 1 dB of the total noise.

Finally, the method for predicting spatial velocity correlation from Reynolds stress data in wake flows, originally developed by Devenport et al. (1999, 2001) and Devenport and Glegg (2001), was adapted to boundary-layer type flows. This method, using Reynolds stresses and the prescription of a lengthscale to extrapolate the full two-point correlation, was shown to produce best results for a lengthscale prescribed as proportional to the turbulent macroscale.

Noise predictions using modeled two-point statistics showed good agreement with the DNS inferred data in all but frequency magnitude, a probable consequence of the modeling of the correlation function in the streamwise direction. Other quantities associated to noise were seen to be similar to the ones obtained using the DNS.

Files

Filename Size Approximate Download Time (Hours:Minutes:Seconds)

28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access NS_Thesis.pdf3.76 Mb 00:17:24 00:08:57 00:07:49 00:03:54 00:00:20

Browse All Available ETDs by
( Author |
Department )

If you have questions or technical problems, please Contact DLA.