z-logo
Premium
A study of gridless method with dynamic clouds of points for solving unsteady CFD problems in aerodynamics
Author(s) -
Wang Hong,
Chen HongQuan,
Periaux Jacques
Publication year - 2010
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.2145
Subject(s) - transonic , aerodynamics , computational fluid dynamics , airfoil , euler equations , computer science , euler's formula , flow (mathematics) , delaunay triangulation , mathematics , mathematical optimization , algorithm , aerospace engineering , geometry , mathematical analysis , engineering
Abstract When solving unsteady computational fluid dynamics problems in aerodynamics with a gridless method, a cloud of points is usually required to be regenerated due to its accommodation to moving boundaries. In order to handle this problem conveniently, a fast dynamic cloud method based on Delaunay graph mapping strategy is proposed in this paper. A dynamic cloud method makes use of algebraic mapping principles and therefore points can be accurately redistributed in the flow field without any iteration. In this way, the structure of the gridless clouds is not necessarily changed so that the clouds regeneration can be avoided successfully. The spatial derivatives of the mathematical modeling of the flow are directly determined by using weighted least‐squares method in each cloud of points, and then numerical fluxes can be obtained. A dual time‐stepping method is further implemented to advance the two‐dimensional Euler equations in arbitrary Lagarangian–Eulerian formulation in time. Finally, unsteady transonic flows over two different oscillating airfoils are simulated with the above method and results obtained are in good agreement with the experimental data. Copyright © 2009 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here