A vectorized particle tracer for unstructured grids (Q2639617)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4184975
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A vectorized particle tracer for unstructured grids |
scientific article; zbMATH DE number 4184975 |
Statements
A vectorized particle tracer for unstructured grids (English)
0 references
1990
0 references
The paper deals with the analysis of a vectorized particle tracer for unstructured grids by using the elementary properties of the linear basis function to search for particles on the grid using the element last occupied as an initial guess. The vector-loops become easily obtainable permitting vectorization by a simple binary sort of the particle every timestep such that all particles that have as yet not found their host element remain at the top of the list. By this algorithm speed-ups of the order 1:14 can be obtained on vector machines. The proposed algorithm may be directly generalized to three-dimensional problems too.
0 references
particle-mesh techniques
0 references
vectorized particle tracer
0 references
unstructured grids
0 references
vector-loops
0 references
algorithm
0 references
0 references
0.8895911
0 references
0.88721126
0 references
0.87422484
0 references
0.8722646
0 references
0.8655247
0 references
0.8597934
0 references
