Abstract:

A new dynamic grid algorithm is proposed in this article. It is based on a Delauney map, out of which deformation is carried out. Firstly, the Delauney map is generated; secondly, the mapping coefficients are calculated and the deformation is done on the Delauney map; finally, the grid points are relocated on the deformed Delauney map, and the final dynamic grid is obtained. This dynamic algorithm is noniterative, therefore it is highly efficient and it also offers cell topological flexibility. Several unsteady cases are computated to demonstrate its roboustness, including a deformed wingbody combination and the unsteady flows during the deforming of the body of the flyingwing.

Key words: dynamic , grid,  , unsteady , flow,  , computational , fluid , dynamics,  , flying , wing,  , Delauney , map