An Investigation into Neighbouring Search Techniques in Meshfree Particle Methods: An Evaluation of the Neighbour Lists
- PDF / 4,904,483 Bytes
- 15 Pages / 595.276 x 790.866 pts Page_size
- 85 Downloads / 198 Views
ORIGINAL PAPER
An Investigation into Neighbouring Search Techniques in Meshfree Particle Methods: An Evaluation of the Neighbour Lists and the Direct Search C. A. D. Fraga Filho1 · L. L. Schuina1 · B. S. Porto1 Received: 24 December 2018 / Accepted: 26 May 2019 © CIMNE, Barcelona, Spain 2019
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.
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
* C. A. D. Fraga Filho [email protected] 1
Federal Institute of Education, Science and Technology of Espírito Santo, Vitória, ES, Brazil
nodes) and atoms (in the MD specific cas
Data Loading...
