Year: 2016
Communications in Computational Physics, Vol. 19 (2016), Iss. 3 : pp. 770–800
Abstract
Neighbour search (NS) is the core of any implementations of smoothed particle hydrodynamics (SPH). In this paper, we present an efficient $\mathcal{O}$($N$log$N$) neighbour search method based on the plane sweep (PW) algorithm with $N$ being the number of SPH particles. The resulting method, dubbed the PWNS method, is totally independent of grids (i.e., purely meshfree) and capable of treating variable smoothing length, arbitrary particle distribution and heterogenous kernels. Several state-of-the-art data structures and algorithms, e.g., the segment tree and the Morton code, are optimized and implemented. By simply allowing multiple lines to sweep the SPH particles simultaneously from different initial positions, a parallelization of the PWNS method with satisfactory speedup and load-balancing can be easily achieved. That is, the PWNS SPH solver has a great potential for large scale fluid dynamics simulations.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/10.4208/cicp.010415.110915a
Communications in Computational Physics, Vol. 19 (2016), Iss. 3 : pp. 770–800
Published online: 2016-01
AMS Subject Headings: Global Science Press
Copyright: COPYRIGHT: © Global Science Press
Pages: 31
-
Computational Fluid Dynamics - Basic Instruments and Applications in Science
Free-Surface Flow Simulations with Smoothed Particle Hydrodynamics Method using High-Performance Computing
Altomare, Corrado | Viccione, Giacomo | Tagliafierro, Bonaventura | Bovolin, Vittorio | Domínguez, José Manuel | Crespo, Alejandro Jacobo Cabrera2018
https://doi.org/10.5772/intechopen.71362 [Citations: 5] -
SPH Modeling of Water-Related Natural Hazards
Manenti, Sauro | Wang, Dong | Domínguez, José M. | Li, Shaowu | Amicarelli, Andrea | Albano, RaffaeleWater, Vol. 11 (2019), Iss. 9 P.1875
https://doi.org/10.3390/w11091875 [Citations: 37] -
Efficient searching in meshfree methods
Olliff, James | Alford, Brad | Simkins, Daniel C.Computational Mechanics, Vol. 62 (2018), Iss. 6 P.1461
https://doi.org/10.1007/s00466-018-1574-9 [Citations: 11] -
Parallel Tree Algorithms for AMR and Non-Standard Data Access
Burstedde, Carsten
ACM Transactions on Mathematical Software, Vol. 46 (2020), Iss. 4 P.1
https://doi.org/10.1145/3401990 [Citations: 9]