Article information

2008 , Volume 13, Special issue, p.9-13

Afanasiev K.E., Makarchuk R.S., Popov A.Y.

Nearest neighbor search algorithm and its parallel implementation in the SPH method

This work addresses an optimization of the SPH program realization. The nearest neighbor search algorithm and its parallel implementation are discussed. The results on acceleration of the algorithms taken from numerical simulations of real problems are presented.

[full text]
Keywords: Smoothed Particle Hydrodynamics, SPH, grid algorithm, nearest neighbor search, parallel implementation

Author(s):
Afanasiev Konstantin Evgenievich
Dr. , Professor
Position: Vice-Rector
Office: Kemerovo State University, Computer Centre
Address: 650043, Russia, Kemerovo, Krasnaya str. 6
Phone Office: (3842) 58 33 41
E-mail: keafa@kemsu.ru

Makarchuk Roman Sergeevich
Position: Assistent
Office: Kemerovo State University
Address: 650043, Russia, Kemerovo, Krasnaya str. 6
Phone Office: (3842) 58 44 03
E-mail: mak@kemsu.ru

Popov Andrei Yurievich
Position: Student
Office: Kemerovo State University
Address: 650043, Russia, Kemerovo, Krasnaya str. 6
Phone Office: (3842) 58 44 03
E-mail: a_popov@kemsu.ru


Bibliography link:
Afanasiev K.E., Makarchuk R.S., Popov A.Y. Nearest neighbor search algorithm and its parallel implementation in the SPH method // Computational technologies. 2008. V. 13. Special issue 5. P. 9-13
Home| Scope| Editorial Board| Content| Search| Subscription| Rules| Contacts
ISSN 1560-7534
© 2024 FRC ICT