An efficient moving grid algorithm for large deformation

Qin, N, Liu, X and Xia, H (2005) An efficient moving grid algorithm for large deformation. Modern Physics Letters B, 19 (28-29). pp. 1499-1502. ISSN 0217-9849

Full text not available from this repository.


A simple and efficient moving grid technique is proposed for computing unsteady flow problems with geometrical deformation, relative body movement or shape changes due to aerodynamic optimisation and fluid-structure interaction. A Delaunay graph of the solution domain is first generated, which can be moved easily during the geometric dynamic deformation, even for very large distortion. A one to one mapping between the Delaunay graph and the computational grid is maintained during the movement. The new computational grid after the dynamic movement can be generated efficiently through the mapping while maintaining the primary qualities of the grid. While most dynamic grid deformation techniques are iterative based on the spring analogy, the present method is non-iterative and much more efficient. On the other hand, in comparison with dynamic grid techniques based on transfinite interpolation for structured grids, it offers both geometric and cell topology flexibility, which is crucial for many unsteady flow problems involving geometric deformation and relative motions. Comparison with the popular spring analogy method for a wing-body combination is demonstrated regarding their efficiency and grid quality.

Item Type: Article
Keywords: Moving mesh; deforming mesh; Delaunay graph
Schools and Departments: School of Engineering and Informatics > Engineering and Design
Depositing User: Hao Xia
Date Deposited: 06 Feb 2012 20:13
Last Modified: 27 Jun 2012 09:53
📧 Request an update