Tree Code Based Neighborhood Algorithms for Discrete Element Methods
| Autor: | Watanabe, Yuki, Krengel, Dominik, Matuttis, Hans-Georg |
|---|---|
| Rok vydání: | 2024 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | 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. Comment: Preprint. Under Review for the CCP2023 Proceedings |
| Databáze: | arXiv |
| Externí odkaz: |
|