University of Cambridge > > Isaac Newton Institute Seminar Series > Parallel computation of vortex tube reconnection using graphics card and vortex particle methods

Parallel computation of vortex tube reconnection using graphics card and vortex particle methods

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Topological Dynamics in the Physical and Biological Sciences

Understanding the dynamics and mutual interaction among various types of vortical motions is a key ingredient in clarifying and controlling fluid motions . One of the most fundamental 3D vortical interactions related to the vortex tube reconnection. In the paper will be present the numerical results of the vortex tube reconnections for different initial configurations like reconnection o the vortex tube with counter-rotating vortices that are initially parallel and was sinusoidal perturbed (Crow instability), the vortex reconnection of the initially straight offset tube and reconnection of the vortex rings . We try to find and demonstrate some universal process for core reconnections. It will be shown the effect of mixing of the fluid by the reconnection. It was done by tracing the passive markers that were initially placed near the space where the reconnection took place. For numerical simulations we use the vortex particle methods. Due to the large time consuming at single processor unit we constructed the numerical code for multiprocessor unit of graphics card. It was proved that vortex particle method in version Vortex -in Cell are very good suited for parallel computation. We carefully tested the method by comparing the numerical results with some theoretical results (the motion of the vortex ring) and with results that were published in literature. The speed-up which we obtained was nearly 50 times grater with comparison to the single processor.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2022, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity