z-logo
Premium
BILU implicit multiblock Euler/Navier–Stokes simulation for rotor tip vortex and wake convection
Author(s) -
Zhong Bowen,
Shaw Scott,
Qin Ning
Publication year - 2007
Publication title -
international journal for numerical methods in fluids
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.938
H-Index - 112
eISSN - 1097-0363
pISSN - 0271-2091
DOI - 10.1002/fld.1455
Subject(s) - wake , multigrid method , vortex , solver , euler's formula , mathematics , euler equations , acceleration , mechanics , classical mechanics , physics , mathematical analysis , mathematical optimization , partial differential equation
In this paper, a block incomplete lower–upper (BILU) decomposition method is incorporated with a multiblock three‐dimensional Euler/Navier–Stokes solver for simulation of hovering rotor tip vortices and rotor wake convection. Results of both Euler and Navier–Stokes simulations are obtained and compared with experimental observations. The comparisons include surface pressure distributions and tip vortex trajectories. The comparisons suggest that resolution of the boundary layer is important for the accurate evaluation of the blade surface loading, but is less so for the correct prediction of the vortex trajectory. Numerical tests show that, using Courant–Friedrichs–Lewy (CFL) number of 10 or 30 with the developed BILU implicit scheme can be 6–7 times faster than an explicit scheme. The importance of solution acceleration schemes that increase the permitted time‐step is illustrated by comparing the evolving wake structures at different stages of the calculation. In contrast to fixed wing simulations, the extent of the wake structures is shown to require resolution of large physical time. This observation explains the poor performance that is obtained when employing convergence acceleration strategies originally intended for solution of equilibrium problems, such as the multigrid methods. Copyright © 2007 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here