Abstract
Meshfree particle methods are being increasingly employed in solving problems in automotive, aeronautics and oil industries, environmental and geophysical problems, biomechanics and medicine, hydraulic erosion, sediment transport, physics and astronomy, among other areas. Regardless of the application of the particle method, the search for neighbour particles must be done at each numerical iteration (especially in dynamic cases). In 2-D studies, the neighbour lists (linked and Verlet) are techniques commonly used in simulations. This paper presents an investigation of the computational efficiency of the linked list technique through comparison with results of simulations of the direct search (the simplest neighbour search technique). Different numbers of particles and interpolation functions have been used in the tests. By using a simple matrix in the storage of neighbour particles, an improvement in the computational efficiency (in comparison with the direct search’s time processing) has not been seen when the linked list algorithm has been utilised. A similar performance between linked list and direct search has been achieved when the neighbour particles have been stored in pairs (even though the cell-linked list has been updated at each numerical iteration). From the analyses of the CPU processing times found in the problems simulated in this work, in which the efficiency of the linked list was only similar to the direct search, it was concluded that is necessary the implementation of a optimisation technique for computational time saving. The Verlet list is a linked list optimisation proposal in which the neighbour list is not update at each numerical iteration. Through an appropriate choice of the cutoff radius, it is ensured that there is no loss in accuracy in the location of neighbouring particles. Optimisation attempts using the Verlet list have been performed but the improvement in the computational efficiency are not satisfactory in all cases.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Broadly speaking, the meshfree particle methods discretise the continuum domain in a set of particles (or nodal points) aiming to obtain a computational solution of Partial Differential Equations (PDE’s) [1]. In this class of methods are included: Smoothed Particle Hydrodynamics (SPH), Moving Particle Semi-Implicit (MPS), Moving Least Square (MLS), Reproducing Kernel Particle (RKPM), Finite Point (FPM), Particle-in-Cell (PI), Particle Finite Element (PFEM) and Molecular Dynamics (MD) methods, among others. Different techniques in the searching of neighbour particles (or nodes) and atoms (in the MD specific case) [1,2,3,4,5,6,7,8,9,10,11,12,13,14] can be employed.
The neighbouring search procedure must be performed at each numerical iteration in dynamic cases, and that has a direct influence on the simulation time. In two-dimensional analyses, neighbour lists (linked and Verlet) are commonly employed in meshfree particle methods [15,16,17,18].
The cell-linked or the Verlet list divide the physical domain into a regular grid of congruent rectangles (2-D domain) or rectilinear parallelepipeds (3-D) whose sides measure a cutoff radius. Particles are simply assigned to cells according to their spatial coordinates. Each cell contains a number of particles that can vary during the numerical simulation.
Currently, the octree technique [19, 20] has been applied in conjunction with parallelization, or CUDA GPU processing, in 3-D problems.
In particular, SPH and MPS methods are currently being applied to diverse areas, such as automotive, aeronautics and oil industries, engineering, biomechanics and medicine, geosciences, environmental sciences, oceanography, tribology, applied mathematics, physics and astronomy. The applications of those meshfree particle methods are increasing (some of them are listed below) and the computational efficiency—related to the neighbouring search technique employed—is an aspect that deserves attention.
-
Aerospace and aeronautics, automotive and energy production industries, marine and costal engineering, environmental and geophysical problems [21,22,23,24].
-
Oil flow in porous rocks [41].
-
Multiphase flow and reactive transport in porous media [42].
Abdelrazek et al. [46] presented a brief comparison between MPS and SPH characteristics.
This paper presents an evaluative investigation of the computational efficiency of the neighbour lists (especially the linked list) in SPH applications. From the literature results obtained in previous studies [47, 48] of our research group, and validated from the comparison with experimental/literature data, it was possible to conclude on the efficiency of the linked list technique in two benchmark engineering problems: lid-driven cavity flow and dam breaking.
The contributions of this work lie on the presentation of the numerical implementation of a linked list, in providing computational efficiency results using or not the neighbours storage in pairs, and in the discussion on the linked list optimization using the Verlet list.
2 Presentation of the Neighbour Search Techniques
2.1 Direct Search
The direct search is the simplest search technique employed in particle methods. Through the simple comparison between the distance of two particles (a fixed and other in any position of the domain), the neighbour particles are found—if the distance is smaller than the cutoff radius (kh)—and stored in a matrix. Figure 1 presents the flowchart of the direct search algorithm and the neighbourhood of a fixed particle.
The storage of the particles and their neighbours is performed in a matrix, basically in two forms. Figure 2 shows the simplest storage form: a matrix whose number of rows is equal to the number of particles used in the discretization of the domain and number of columns is equal to the largest number of neighbours of each particle that can be found at each numerical iteration. At the beginning of the simulation all the matrix is initialised with a zero value and as neighbours are found, their numbers are written in matrix positions. In the solution of the conservation physics laws by the meshfree particle method, the location of the first zero in a matrix line informs that there are no longer neighbours for a specific reference particle (identified by the number in the first column of that line).
Figure 3 shows the storage of neighbour particles in pairs [18]. This storage method optimises the interpolation process performed by the meshfree particle method (in the solution of physical conservation equations). The information about a pair of neighbouring particles is used in the interpolations performed for both particles, reducing the number of computational operations.
2.2 Linked List
In the linked list technique, the domain is divided into a grid containing a certain number of cells. Each cell contains a number of particles that can vary during the numerical simulation. The neighbour search is limited to the cells (8 in 2-D and 26 in 3-D) that are in the vicinity of the cell that contains the reference particle. A cell-linked list with informations on the cell that contains the reference particle and those cells in which the neighbouring particles can be located is created. This procedure is performed for each particle at the domain. The calculations of the distances between the reference particle and the others particles at domain are reduced to the region with linked cells (Fig. 4). Figure 5 presents the linked list algorithm implemented for solving a science/engineering problem. The cell-linked list needs to be updated each numerical iteration, due to migration of the particles to other cells.
2.3 Verlet List
Domínguez et al. [15] and Viccione et al. [16] performed the optimization of the linked list using the Verlet list, whose creation requires the calculations needed to generate the cell-linked list.
In this technique, the neighbour list is built with probable neighbouring particles of each reference particle at the domain, inside a cutoff radius (kh + L) slighter higher than the support radius (kh) used in the linked list.
The definition of the cutoff radius takes into account the maximum possible displacement of the reference particle during a simulation time (related to a certain number of numerical iterations) in which the neighbour list will not be updated [16].
In the Verlet list technique, all particles within the cutoff radius (kh + L), as shown in Fig. 6, will be added to a list of potential neighbour particles, but only those whose distances for the reference particle are less than or equal to kh will be used in the interpolations of the particle method. The neighbour list is not update at the numerical iteration, which results in processing time saving.
In a first analysis, there are no losses in the accuracy in the location of neighbour particles. However, the choice of the cell size must be done carefully in order to guarantee the accuracy and the advantages of the technique.
3 Algorithmic Implementations
3.1 Direct Search
As explained earlier, the direct search is a technique of simple implementation. Through the simple comparison between the distance of two particles (a fixed and other in any position of domain) the neighbour particles are found and stored in a matrix, as shown in Figs. 2 and 3.
3.2 Linked List
In the linked list, there are more complex operations. The following will be presented a concise description of the algorithm implementation, in FORTRAN Programming Language.
Step 1. Firstly, the limits of the spatial region that will receive particles along the simulation must be provided and the coordinates of each cell must be defined.
Step 2. A routine used in the identification of the cells that contains particles at each numerical iteration needs to be implemented. This procedure reduces the computational processing time, since neighbouring particles search is performed in a reduced domain. In problems where the domain is large, there may be a considerable number of empty cells at each numerical iteration.
Step 3. The particles inside each cell must be identified, from the comparison of their coordinates with the coordinates of each cell in the grid.
Step 4. The neighbours cells of each cell in the grid are identified. This allows that the neighbouring particle search are performed only on the neighbouring cells of a given cell (containing the fixed particle) and not in the whole domain, as in the direct search. During the simulations, the grid remained static. Thus, these operations run only once, at the first iteration.
Step 5. It is necessary to determine the cell in which the reference particle is located. A scan on the non-empty cells is performed until the fixed particle is found, at this moment this procedure finishes. The algorithm below present the operations performed.
Step 6. After the cell A—in which is located the reference particle—has been found, the neighbours search is finally carried out. The search for neighbours cells of the cell A has been done previously, in the grid generation, and the result is stored in the matrix cell_v. Thus, it is enough to check which particles (inside the neighbours cells of A) are neighbours of the reference particle. This checking is performed by calculating the interparticles distances (which must be lower than kh). The excerpt of the algorithm is shown below.
As final result, the neighbours of each particle of the domain are stored in the neighbours_matrix.
4 Lagrangian Particle Modelling
The essence of the particle methods is the discretization of the continuum domain in a finite number of particles and, from interpolations, obtain approximations for physical quantities for each particle of the domain. Only the particles in the vicinity of each particle fixed for study (which are within the domain of influence of the first, that is, within the space region with radius equals to kh, in which k is a scaling factor that depends on the kernel used), will contribute to the prediction of the physical properties of the reference particle. The contribution given by each neighbouring particle to the value of the physical quantity is inversely proportional to its distance to the reference particle. Smoothing functions (kernels) are used in the interpolations of the particle method. The kernels used in this work can be found in [18], and are presented below.
Cubic spline:
Gaussian:
New quartic:
Quintic spline:
where
-
\( W \) is the interpolation function (kernel).
-
\( r \) is the position occupied by the particle at the domain.
-
\( h \) is the smoothing length.
-
\( a \) and \( b \) are subscripts referring to the reference particle and the neighbouring particle respectively.
Figure 7 shows a continuous smoothing function and its utilisation in the interpolations at the domain discretised by particles.
According to a general analysis, the modelling of fluid flow and energy transport is carried out by the physical conservations laws of mass, momentum and energy. In this work, two hydrodynamic cases were studied in a 2-D domain: dam breaking and lid-driven cavity flow. The fluid has been considered as Newtonian, incompressible and isothermal. The mass conservation and Navier–Stokes equations have been discretised and solved by the Smoothed Particle Hydrodynamics method in both problems (Eqs. (5)–(6)):
where d/dt is the material derivative, \( m \) is the mass, \( n \) is the number of neighbouring particles within the influence domain, \( {\mathbf{v}} \) is the velocity, t is the time, \( \nabla \) is the mathematical nabla operator, \( W \) is the kernel, \( \varvec{X} \) is the particle position, \( h \) is the smoothing length, \( P \) is the absolute pressure, \( \upsilon \) is the kinematic viscosity, \( \rho \) is the density, \( {\mathbf{g}} \) is the gravity, the subscripts \( a \) and \( b \) refer to the reference particle and the neighbouring particle, respectively.
For an incompressible and isothermal flow, the rate of change of the internal energy in time is null. Due to this, the energy conservation equation was not solved in the cases presented in this work.
4.1 Dam Breaking
The studies of dam breaks are of great importance in the prevention of accidents, which can cause serious environmental consequences, besides being a risk to the resident populations in the vicinity of the dams.
The 2-D geometry simulated was a tank with a height a length of 0.420 m and a height of 0.440 m, as shows Fig. 8. The damned water, located at the right side of the reservoir, had a height of 0.114 m height and a width of 0.114 m (aspect ratio equals 1).
A static grid of 52 cells along the length of the tank and 15 cells arranged in the y direction (up to the dammed water line) was defined. At each numerical iteration, the cells containing particles were identified. Thus, the neighbour search operations were performed in a reduced domain (see Step 2 in Sect. 3.2). Cubic spline, new quartic and quintic spline kernels [16] have been used in the SPH interpolations. The timestep was 1.0 × 10−5 s. 30,000 numerical iterations were performed in the simulations. Figure 8 shows the initial setup of the particles used in the discretization of the damned water.
Figure 9 presents the evolution of the dam breaking flow in different instants of time. Complete simulation results and validation of the collapse of dammed water can be found in [47].
The simulations (using the direct search and the linked list techniques) finished when the wave achieved the left wall of the reservoir (t = 0.30 s) The storage of the neighbouring particles was carried out in the simple form possible, using a matrix as that shown in Fig. 2. The simulation processing times for different combinations of interpolation function/number of particles are shown in Table 1.
Considering the surprising results found in the first simulations, with lower performance of the linked list, more studies were carried out aiming to optimise the first algorithm implemented.
Literature [18] presented another form of neighbouring particles storage—(in pairs)—as shows Fig. 3. By using this technique, fewer computational operations are performed and it is expected that there will be a decrease in CPU time. New simulations have been performed for the 2-D lid-driven cavity flow, as presented in the next subsection.
4.2 2-D Lid-Driven Cavity Flow
Cavities are seen in engineering problems related to environmental and atmosphere. Depressions and valleys, dynamics of lakes, fuselage and wings of airplanes, boat hulls and car bodies, sports stadiums, systems for the continuous deposition of photosensitive films on substrates and photographic papers, material processing, metal casting and galvanizing are situations in which fluid flows in cavities are found [48].
The sides of the square cavity simulated were 1.0 × 10−3 m. Grids of 12 × 12 cells, 16 × 16 cells and 20 × 20 cells, disposed in x and y directions respectively, were used in simulations (when employed 30 × 30, 40 × 40 and 50 × 50 particles per side of the cavity, respectively). The constant velocity of the box cover was 1.0 × 10−4 m. Cubic and quintic spline kernels have been used in the SPH interpolations. The timestep was 5.0 × 10−5 s and 30,000 numerical iterations were performed.
Figure 10 shows streamlines inside the square cavity and the formation the primary vortex when the steady state has been reached. A more complete analysis of this problem can be found in [48]. The simulation processing times are shown in Table 2 and Figs. 11, 12, and 13.
The storage in pairs of the neighbouring particles promoted an improvement in the computational efficiency of the linked list. The differences between the simulation times provided by this technique and the direct search decresead significantly (which is in accordance with the conclusions presented in [18]). Even so, after the CPU times analysis it was verified that the computational efficiency of the linked list technique was only similar to that of the direct search.
5 Concluding Remarks
From the analysis of the results it is possible to conclude that the simple use of the linked list technique is not sufficient for the best efficiency of the neighbouring particle searching. The use of the storage of neighbouring particles in pairs was very important for the reduction of computational time, but it was not enough for a great improvement in the linked list simulation time. It was verified that a linked list optimisation method could improve performance.
The Verlet list is an optimisation technique proposed, that uses calculations required in the generation of the cell-linked list. Despite the advantages of not updating the list of neighbours at each numerical iteration can provide, the choice of an appropriate cutoff radius is fundamental to ensure the good performance of this technique.
Literature shows, however, that the choice of the appropriate neighbour list technique (linked or Verlet) is not so simple. The comparative advantage of the cell-linked list increases with the reduction of the cells size, to the point which the Verlet list approach is practically useless [16].
The CPU simulations of a 3-D collapse of a dam break and its interaction with a rectangular structure, using the SPH particle method, are presented in [15]. Analysing the memory requirements, Verlet was less efficient than linked list. The performance of the Verlet list dependent on the number of steps (ns) that the list kept unaltered. For low and high values of ns, the linked list method was faster than the Verlet list. Only in an intermediate region, the Verlet list was faster, with a maximum improvement close to 6%, for ns equal to 7 timesteps. The runtime improvement is rather moderate, especially when considering the memory requirements of the Verlet list: higher than the requirements of the linked list. An improvement in runtime higher than 8% was obtained when a change in the formulation of the SPH method (using a kernel gradient correction) was used.
In summary, the Verlet list is a linked list optimisation attempt which results are not the best in all cases. From the literature results [15], it is conclude that a wise choice of some parameters, such as cell size and number of timesteps in which the neighbours list will remain unchanged, is necessary so that a reasonable improvement in the processing time (below 10%) is reached. In addition, the memory requirement in the Verlet list was higher than in the linked list in CPU simulations.
Recently, the literature [49] presented a parallel fast neighbour search method and communication strategy for meshless particle methods. An algorithm with a multi-resolution-based hierarchical data structure is employed to construct ghost buffer particles (neighbour particles on remote processor nodes). Cell-linked and Verlet lists were applied in this search technique. Two applications of the parallel algorithm in fluid dynamics simulations using SPH method were performed: (a) with an adaptive smoothing-length and (b) employing a new physics-driven partitioning method [50]. The results achieved demonstrated accuracy and efficiency in the process of construction of the buffer ghost particles and that the new partitioning method is promising.
References
Li S, Liu WK (2002) Meshfree and particle methods and their applications. Appl Mech Rev 55(1):1–34. https://doi.org/10.1115/1.1431547
Huerta A, Belytschko T, Fernandez-Méndez S, Rabczuk T (2004) Meshfree methods. Encyclopedia of computational mechanics. Wiley, New York
Idelsohn SR, Oñate E, Becker P (2018) Particle methods in computational fluid dynamics. In: Stein E, de Borst R, Hughes TJR (eds) Encyclopedia of computational mechanics, 2nd edn. Wiley, Chichester, pp 1–41
Onderik J, Ďurikovič R (2007) Efficient neighbor search for particle-based fluids. J Appl Math Stat Inform (JAMSI), 2(3). http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.105.6732&rep=rep1&type=pdf. Accessed 19 April 2019
Fraga Filho CAD (2019) Smoothed particle hydrodynamics: fundamentals and basic applications in continuum mechanics. Springer Nature, Basel
Olliff J, Alford B, Simkins DC Jr (2018) Efficient searching in meshfree methods. Comput Mech 62(6):1461–1483. https://doi.org/10.1007/s00466-018-1574-9
Koshizuka S, Nobe A, Oka Y (1998) Numerical analysis of breaking waves using the moving particle semi-implicit method. Int J Numer Methods Fluids 26(7):751–769. https://doi.org/10.1002/(SICI)1097-0363(19980415)26:7%3c751:AID-FLD671%3e3.0.CO;2-C
Slattery SR, Hamilton SP, Evans TM (2015) A modified moving least square algorithm for solution transfer on a spacer grid surface. In: Proceedings of ANS AMC2015—join international conference in mathematics and computation, Nashville, Tenessee, 2015. https://www.casl.gov/sites/default/files/docs/CASL-U-2015-0177-000.pdf. Accessed 19 April 2019
Jun S, Liu WK, Belytschko T (1998) Explicit reproducing kernel particle methods for large deformation problems. Int J Numer Methods Eng 41(1):137–166. https://doi.org/10.1002/(SICI)1097-0207(19980115)41:1%3c137:AID-NME280%3e3.0.CO;2-A
Wu N, Chen BS, Tsay T (2014) A review on the modified finite point method. Math Probl Eng 1–29:2014. https://doi.org/10.1155/2014/350364
Samuel H (2018) A deformable particle-in-cell method for advective transport in geodynamic modelling. Geophys J Int 214(3):1744–1773. https://doi.org/10.1093/gji/ggy231
Wang D, Hsiao F, Chuang C, Lee Y (2007) Algorithm optimization in molecular dynamics simulation. Comput Phys Commun 177(7):551–559. https://doi.org/10.1016/j.cpc.2007.05.009
Howard MP, Anderson JA, Nikoubashmana A, Glotzerb SC, Panagiotopoulos AZ (2016) Efficient neighbor list calculation for molecular simulation of colloidal systems using graphics processing units. Comput Phys Commun 203:45–52. https://doi.org/10.1016/j.cpc.2016.02.003
Oñate E, Idelsohn SR, Del Pin F, Aubry R (2004) The particle finite element method. An overview. Int J Computat Methods 1(2):267–307. https://doi.org/10.1142/s0219876204000204
Domínguez JM, Crespo AJC, Gómez-Gesteira M, Marongiu JC (2011) Neighbour lists in smoothed particle hydrodynamics. Int J Numer Methods Fluids 67(12):2026–2042. https://doi.org/10.1002/fld.2481
Viccione G, Bovolin V, Carratelli EP (2008) Defining and optimizing algorithms for neighbouring particle identification in SPH fluid simulations. Int J Numer Methods Fluids 58(6):625–638. https://doi.org/10.1002/fld.1761
Winchenbach R, Hochstetter H, Kolb A (2016) Constrained neighbor lists for SPH-based fluid simulations. In: Proceedings of eurographics/ACM SIGGRAPH symposium on computer animation, pp 49–56, Zurich, Switzerland, 2016. https://pdfs.semanticscholar.org/a7ef/0a369943a4cf616d96ccc85480de07606e69.pdf. Accessed 19 April 2019
Liu GR, Liu MB (2003) Smoothed particle hydrodynamics: a meshfree particle method. World Scientific, Singapore
Rajasekaran S, Reif J (2007) Handbook of parallel computing: models, algorithms and applications. Chapmann and Hall/CRC, Boca Raton
Jahanbakhsh E, Pacot O, Avellan F (2012) Implementation of a parallel SPH-FPM solver for fluid flows. Zetta Numer Simul Sci Technol 1:16–20
Shadloo MS, Oger G, Le Touzé D (2016) Smoothed particle hydrodynamics method for fluid flows, towards industrial applications: motivations, current state, and challenges. Comput Fluids 136(10):11–34. https://doi.org/10.1016/j.compfluid.2016.05.029
Leroy A (2014) Un nouveau modèle SPH incompressible: vers l’application à des cas industriels. Ph.D. Thesis, Université Paris-Est, France, 2014. http://www.theses.fr/2014PEST1065. Accessed 20 July 2018
Smojvera I, Ivančevića D (2017) Application of numerical methods in the improvement of safety of aeronautical structures. Transport Res Procedia 28:164–172. https://doi.org/10.1016/j.trpro.2017.12.182
Koshizuka S (2012) Current achievements and future perspectives on particle simulation technologies for fluid dynamics and heat transfer. J Nucl Sci Technol 48(2):155–168. https://doi.org/10.1080/18811248.2011.9711690
Cleary P, Joseph H, Vladimir A, Nguyen T (2002) Flow modelling in casting processes. Appl Math Model 26(2):171–190. https://doi.org/10.1016/S0307-904X(01)00054-3
Cleary PW, Savage G, Ha J, Prakash M (2014) Flow analysis and validation of numerical modelling for a thin walled high pressure die casting using SPH. Computat Particle Mech 1(3):229–243. https://doi.org/10.1007/s40571-014-0025-4
He Y, Zhou Z, Cao W, Chen W (2011) Simulation of mould filling process using smoothed particle hydrodynamics. Trans Non-Ferrous Met Soc China 21:2684–2692. https://doi.org/10.1016/S1003-6326(11)61111-4
Lluch E., Doste R., Giffard-Roisin S., This A., Sermesant M., Camara O., De Craene M., Morales H. Smoothed particle hydrodynamics for electrophysiological modeling: an alternative to finite element methods. In: Proceedings of the 9th international conference on functional imaging and modelling of the heart—FIMH 2017, Toronto, Canada, vol 141, pp 333–343. Springer, Berlin
Toma M (2018) The emerging use of SPH in biomedical applications. Signif Bioeng Biosci 1(1). https://pdfs.semanticscholar.org/bb44/ee090961aff9f80787ffdab66ae2558e6552.pdf. Accessed 20 July 2018
Shahriari S, Kadem L, Rogers BD, Hassan I (2012) Smoothed particle hydrodynamics method applied to pulsatile flow inside a rigid two-dimensional model of left heart cavity. Int J Numer Methods Biomed Eng 28(11):1121–1143. https://doi.org/10.1002/cnm.2482
Al-Saad M, Kulasegaram S, Bordas S (2018) Blood flow simulation using smoothed particle hydrodynamics. In: Proceedings of the VII European congress on computational methods in applied sciences and engineering—ECCOMAS Congress 2016, Vol 4, pp 8241–8246, Crete Island, Greece, 2016. https://www.eccomas2016.org. Accessed 20 July 2018
Hieber SE, Walther JH, Koumoutsakos P (2004) Remeshed smoothed particle hydrodynamics simulation of the mechanical behavior of human organs. Technol Health Care 12(4):305–314. https://content.iospress.com/articles/technology-and-health-care/thc00339. Accessed 19 April 2019
Gómez-Gesteira M, Rogers BD, Dalrymple RA, Crespo AJC (2010) State-of-the-art of classical SPH for free-surface flows. J Hydraul Res 48:6–27. https://doi.org/10.1080/00221686.2010.9641242
Xu X, Ouyang J, Yang B, Liu Z (2013) SPH simulations of three-dimensional non-Newtonian free surface flows. Comput Methods Appl Mech Eng 256:101–116. https://doi.org/10.1016/j.cma.2012.12.017
Ataie-Ashtiani B, Farhadi L (2006) A stable moving-particle semi-implicit method for free surface flows. Fluid Dyn Res 38(4):241–256. https://doi.org/10.1016/j.fluiddyn.2005.12.002
Gómez-Gesteira M, Dalrymple RA (2003) Using a three-dimensional smoothed particle hydrodynamics method for wave impact on a tall structure. J Waterw Port Coast Ocean Eng 130(2):63–69. https://doi.org/10.1061/(ASCE)0733-950X(2004)130:2(63)
Didier E, Neves DRCB, Martins R, Neves MG (2014) Wave interaction with a vertical wall: SPH numerical and experimental modelling. Ocean Eng 88:330–341. https://doi.org/10.1016/j.oceaneng.2014.06.029
Vacondio R, Rogers BD, Stansby PK, Mignosa P (2013) Shallow water SPH for flooding with dynamic particle coalescing and splitting. Adv Water Resour 58:10–23. https://doi.org/10.1016/j.advwatres.2013.04.007
Liang Q, Xia X, Hou J (2015) Efficient urban flood simulation using a GPU-accelerated SPH model. Environ Earth Sci 74(11):7285–7294. https://doi.org/10.1007/s12665-015-4753-4
Murotani K, Koshizuka S, Tasuku T, Shibata K, Mitsume N, Yoshimura S, Tanaka S, Hasegawa K, Nagai E, Fujisawa T (2014) Development of hierarchical domain decomposition explicit MPS method and application to large-scale tsunami analysis with floating objects. J Adv Simul Sci Eng 1(1):16–35. https://doi.org/10.15748/jasse.1.16
Tilke PG, Holmes DW, Williams JR (2010) Characterizing flow in oil reservoir rock using smooth particle hydrodynamics. In: AIP conference proceedings, vol 1254, p 278. https://doi.org/10.1063/1.3453824
Tartakovsky AM, Trask N, Pan K, Jones B, Pan W, Williams JR (2016) Smoothed particle hydrodynamics and its applications for multiphase flow and reactive transport in porous media. Comput Geosci 20(4):807–834. https://doi.org/10.1007/s10596-015-9468-9
Schnabel D, Özkaya E, Biermann D, Eberhard P (2018) Modeling the motion of the cooling lubricant in drilling processes using the finite volume and the smoothed particle hydrodynamics methods. Comput Methods Appl Mech Eng 329:369–395. https://doi.org/10.1016/j.cma.2017.09.015
Liu H, Arfaoui G, Stanic M, Montigny L, Jurkschat T, Lohner T, Stahl K (2018) Numerical modelling of oil distribution and churning gear power losses of gearboxes by smoothed particle hydrodynamics. In: Proceedings of the institution of mechanical engineers, part J: journal of engineering tribology. https://doi.org/10.1177/1350650118760626
Dong XW, Liu GR, Li Z, Zeng W (2016) A smoothed particle hydrodynamics (SPH) model for simulating surface erosion by impacts of foreign particles. Tribol Int 95:267–278. https://doi.org/10.1016/j.triboint.2015.11.038
Abdelrazek AM, Kimura I, Shimizu Y (2014) Comparison between SPH and MPS methods for numerical simulations of free surface flow problems. J Jpn Soc Civ Eng Ser. B1 (Hydraul Eng) 70(4):I_67–I_72. https://doi.org/10.2208/jscejhe.70.i_67
Fraga Filho CAD, Chacaltana JTA (2015) Study of fluid flows using Smoothed Particle Hydrodynamics: the modified pressure concept applied to quiescent fluid and dam breaking. In: Proceedings of the XXXVI Iberian Latin American congress on computational methods in engineering—CILAMCE 2015, Rio de Janeiro, Brazil. https://doi.org/10.20906/cps/cilamce2015-0071
Fraga Filho C, Chacaltana JTA, Pinto WJN (2018) Meshless Lagrangian SPH method applied to isothermal lid-driven cavity flow at low-Re numbers. Comput Part Mech. https://doi.org/10.1007/s40571-018-0183-x
Fu L, Ji Z, Hu XY, Adams NA (2019) Parallel fast-neighbor-searching and communication strategy for particle-based methods. Eng Comput. https://doi.org/10.1108/ec-05-2018-0226
Fu L, Litvinov S, Hu XY, Adams NA (2017) A novel partitioning method for block-structured adaptive meshes. J Comput Phys 341:447–473. https://doi.org/10.1016/j.jcp.2016.11.016
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors certify that they have no affiliation with or involvement in any organization or entity with any financial or non-financial interest in the subject matter or materials discussed in this manuscript.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Fraga Filho, C.A.D., Schuina, L.L. & Porto, B.S. An Investigation into Neighbouring Search Techniques in Meshfree Particle Methods: An Evaluation of the Neighbour Lists and the Direct Search. Arch Computat Methods Eng 27, 1093–1107 (2020). https://doi.org/10.1007/s11831-019-09345-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11831-019-09345-9