Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2412.03041 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Tabla de Contenidos:
- 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.