International Journal for Numerical Methods in Fluids · 2010 · 166 citations · 37 references
Numerical AnalysisNear-field HydrodynamicsComputational ScienceEngineeringDynamic UpdatingPhysicsFluid MechanicsHydrodynamicsNumerical SimulationComputer EngineeringParticle MethodSimulationSph CodesComputer ScienceMultiphase FlowNeighbour ListsNeighbour ListParticle-laden Flow
Smoothed particle hydrodynamics relies on interactions with nearby particles, making efficient construction and use of neighbor lists essential for high code performance. The study analyzes existing neighbor-search algorithms for SPH and proposes a dynamic Verlet-list updating procedure. The authors evaluate gridding, particle reordering, cell-linked and Verlet-list methods, assessing their computational time and memory efficiency. © 2010 John Wiley & Sons, Ltd.
Abstract Since smoothed particle hydrodynamics (SPH) is based on interactions with the closer neighbouring particles, implementing the neighbour list is a key point in terms of the high performance of the code. The efficiency of the method depends directly on how to build and use the neighbour list. In the present work, the available searching algorithms for SPH codes are analyzed. Different gridding algorithms are evaluated, the gains in efficiency obtained from reordering of particles is investigated and the cell‐linked list and Verlet list methods are studied to create the neighbour list. Furthermore, an innovative searching procedure based on a dynamic updating of the Verlet list is proposed. The efficiency of the algorithms is analyzed in terms of computational time and memory requirements. Copyright © 2010 John Wiley & Sons, Ltd.
37
A numerical approach to the testing of the fission hypothesis
L. B. Lucy · The Astronomical Journal · 1977 · 5.9K citations
Nuclear Decay, Engineering, Physics +14
Simulating Free Surface Flows with SPH
J. J. Monaghan · Journal of Computational Physics · 1994 · 3.2K citations