Abstract

A vectorized particle tracer for unstructured grids is described. The basic approach is to use elementary properties of the linear basis functions to search for particles on the grid using the element last occupied as an initial guess. To permit vectorization, a simple binary sort of the particles is performed every timestep such that all particles that have as yet not found their host element remain at the top of the list. In this way, vector-loops can be easily formed. Timings taken from a numerical example indicate that speed-ups of the order of 1:14 can be obtained on vector-machines when using this algorithm.

Back to Top

Document information

Published on 01/01/1990

DOI: 10.1016/0021-9991(90)90002-1
Licence: CC BY-NC-SA license

Document Score

0

Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?