Abstract
The main purpose of this paper is to develop a gridless method for unsteady flow simulation. A quadrantal point infilling strategy is developed to generate point and combine clouds of points automatically. A point-moving algorithm is introduced to ensure the clouds of points following the movements of body boundaries. A dual time method for solving the two-dimensional Euler equations in Arbitrary Lagrangian-Eulerian (ALE) formulation is presented. Dual time method allows the real-time step to be chosen on the basis of accuracy rather than stability. It also permits the acceleration techniques, which are commonly used to speed up steady flow calculations, to be used when marching the equations in pseudo time. The spatial derivatives, which are used to estimating the inviscid flux, are directly approximated by using local least-squares curve method. An explicit multistage Runge-Kutta algorithm is used to advance the flow equations in pseudo time. In order to accelerate the solution to convergence, local time stepping technique and residual averaging are employed. The results of NACA0012 airfoil in transonic steady flow are presented to verify the accuracy of the present spatial discretization method. Finally, two AGARD standard test cases in which NACA0012 airfoil and NACA64A010 airfoil oscillate in transonic flow are simulated. The computational results are compared with the experimental data to demonstrate the validity and practicality of the presented method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Similar Papers
More From: Chinese Journal of Aeronautics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.