Tree Code Based Neighborhood Algorithms for Discrete Element Methods

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Watanabe, Yuki, Krengel, Dominik, Matuttis, Hans-Georg
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866910726631718912
author Watanabe, Yuki
Krengel, Dominik
Matuttis, Hans-Georg
author_facet Watanabe, Yuki
Krengel, Dominik
Matuttis, Hans-Georg
contents We report our experiences for the development of a neighborhood algorithm implemented via tree-codes to optimize the performance of a discrete element method (DEM) for convex polytopes. Our implementation of the two-dimensional tree code needs $N\log N$, as does the sort and sweep approach. For our choice of boundary conditions (a rotating drum) and system sizes (up to several thousand particles), the performance of the tree-code is slightly better, but the algorithm is considerably more complicated than the sort and sweep approach.
format Preprint
id arxiv_https___arxiv_org_abs_2412_03041
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Tree Code Based Neighborhood Algorithms for Discrete Element Methods
Watanabe, Yuki
Krengel, Dominik
Matuttis, Hans-Georg
Computational Physics
We report our experiences for the development of a neighborhood algorithm implemented via tree-codes to optimize the performance of a discrete element method (DEM) for convex polytopes. Our implementation of the two-dimensional tree code needs $N\log N$, as does the sort and sweep approach. For our choice of boundary conditions (a rotating drum) and system sizes (up to several thousand particles), the performance of the tree-code is slightly better, but the algorithm is considerably more complicated than the sort and sweep approach.
title Tree Code Based Neighborhood Algorithms for Discrete Element Methods
topic Computational Physics
url https://arxiv.org/abs/2412.03041