2010
DOI: 10.1002/fld.2481
|View full text |Cite
|
Sign up to set email alerts
|

Neighbour lists in smoothed particle hydrodynamics

Abstract: SUMMARYSince 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 c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
85
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 136 publications
(85 citation statements)
references
References 41 publications
(53 reference statements)
0
85
0
Order By: Relevance
“…For a particle that is located inside a cell, only the interactions with particles of neighboring cells must be In each step of the SPH method, the interactions between different particles are calculated using traversal paired searches for certain particles in the computation domain, and this leads to an increased computation time. In this paper, a cell-linked list search method is used to construct the computation framework, and the computation domain is divided into "background cells" shown in Figure 2 [34].…”
Section: Model Framework and Simulation Methodsmentioning
confidence: 99%
“…For a particle that is located inside a cell, only the interactions with particles of neighboring cells must be In each step of the SPH method, the interactions between different particles are calculated using traversal paired searches for certain particles in the computation domain, and this leads to an increased computation time. In this paper, a cell-linked list search method is used to construct the computation framework, and the computation domain is divided into "background cells" shown in Figure 2 [34].…”
Section: Model Framework and Simulation Methodsmentioning
confidence: 99%
“…The cell-linked list described in Ref. [54] is implemented in DualSPHysics. This approach is preferred to the traditional approach, named Verlet list [101] that implies higher memory requirements than the cell-linked list.…”
Section: The Dualsphysics Codementioning
confidence: 99%
“…This approach is preferred to the traditional approach, named Verlet list [101] that implies higher memory requirements than the cell-linked list. Besides, [54] proposed an innovative searching procedure based on a dynamic updating of the Verlet list and analyzed the efficiency of all the algorithms in terms of computational time and memory requirements.…”
Section: The Dualsphysics Codementioning
confidence: 99%
“…Note that the neighbor list is updated every time step while the potential neighbor list is updated every N time steps. The value of N was suggested to be taken as 7, r c and r s can be taken as 2.5r and 3.2r respectively, where r is the radius of the interacting particles (Verlet, 1967;Dominguez et al, 2011).…”
Section: Neighboring Particle Searching Algorithmmentioning
confidence: 99%