The INI has a new website!

This is a legacy webpage. Please visit the new site to ensure you are seeing up to date information.

Skip to content

TOD

Seminar

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

Kudela, H; Kosior, A (Wrocław University of Technology , Poland)
Thursday 26 July 2012, 15:10-15:30

Seminar Room 1, Newton Institute

Abstract

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.

Video

The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.

Back to top ∧