A new vortex particle-in-cell (PIC) method is developed for the computation of three-dimensional unsteady, incompressible viscous flow in an unbounded domain. The method combines the advantages of the Lagrangian particle methods for convection and the use of an Eulerian grid to compute the diffusion
A Particle Method and Adaptive Treecode for Vortex Sheet Motion in Three-Dimensional Flow
โ Scribed by Keith Lindsay; Robert Krasny
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 539 KB
- Volume
- 172
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
โฆ Synopsis
A particle method is presented for computing vortex sheet motion in three-dimensional flow. The particles representing the sheet are advected by a regularized Biot-Savart integral in which the exact singular kernel is replaced by the Rosenhead-Moore kernel. New particles are inserted to maintain resolution as the sheet rolls up. The particle velocities are evaluated by an adaptive treecode algorithm based on Taylor approximation in Cartesian coordinates, and the necessary Taylor coefficients are computed by a recurrence relation. The adaptive features include a divide-andconquer evaluation strategy, nonuniform rectangular clusters, variable-order approximation, and a run-time choice between Taylor approximation and direct summation. Tests are performed to document the treecode's accuracy and efficiency. The method is applied to simulate the roll-up of a circular-disk vortex sheet into a vortex ring. Two examples are presented, azimuthal waves on a vortex ring and the merger of two vortex rings.
๐ SIMILAR VOLUMES
We present a comparison of the performance of vortex and pseudospectral methods in two reference flows: a homogeneous turbulent flow at low Reynolds number and a vortex reconnection case at a moderate Reynolds number. The results should contribute to a better understanding of the accuracy of vortex
A flow problem in a complex three-dimensional domain with a free surface and mixed-type boundary conditions is solved by the boundary collocation method. The solution is expressed as a combination of source functions distributed all around the domain close to the boundary, plus a special basis funct