arXiv · 2412.03041
Tree Code Based Neighborhood Algorithms for Discrete Element Methods
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Yuki Watanabe, Dominik Krengel, Hans-Georg Matuttis. 2024-12-04. Tree Code Based Neighborhood Algorithms for Discrete Element Methods. https://arxiv.org/abs/2412.03041
Cite the original work for its findings. Save a collection to share your selection of sources.