×

An efficient moving grid algorithm for large deformation. (English) Zbl 1137.65411

Summary: 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.

MSC:

65M50 Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs
76D05 Navier-Stokes equations for incompressible viscous fluids
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] George P. L., Comput. Methods Appl. Mech. Eng. 33 pp 975–
[2] DOI: 10.2514/3.10583 · doi:10.2514/3.10583
[3] DOI: 10.1016/S0045-7825(98)00016-4 · Zbl 0961.76070 · doi:10.1016/S0045-7825(98)00016-4
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.