Efficiency of particle search methods in smoothed particle hydrodynamics: a comparative study (part I) Online publication date: Mon, 25-Jan-2021
by E. Plaza; Leonardo Di G. Sigalotti; Luis Pérez; Jorge Troconis; Wilfredo Angulo; María Castro
Progress in Computational Fluid Dynamics, An International Journal (PCFD), Vol. 21, No. 1, 2021
Abstract: Nearest neighbour searching is central to the efficiency of smoothed particle hydrodynamics (SPH). Here the performance of the brute force (BF) or direct search (DS), the cell-linked list (CLL), and the KD-tree (KDT) methods in vectorised form are analysed. The results indicate that the efficiency of the SPH calculations is improved with the vectorised cell-linked list (VCLL) and the vectorised KD-tree (VKDT). However, the VKDT approach is more efficient than the VCLL method for N ≤ 105 in two dimensions (2D) and N ≤ 106 in three dimensions (3D). For larger N, the time duration of the SPH calculations with the VKDT method grows steeply while a linear trend is maintained with the VCLL. The complexity here is measured not only for early events but also close to the point of hardware limit, in which the complexity has a different behaviour, which can be measured and compared using a power fit.
Online publication date: Mon, 25-Jan-2021
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the Progress in Computational Fluid Dynamics, An International Journal (PCFD):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com