Papers › A fast and efficient tool to study the rheology of dense suspensions
A fast and efficient tool to study the rheology of dense suspensions
Alessandro Monti, Vikram Rathee, Amy Q. Shen, Marco E. Rosti
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
A cutting-edge software is presented to tackle the Newton-Euler equations governing the dynamics of granular flows and dense suspensions in Newtonian fluids. In particular, we propose an implementation of a fixed-radius near neighbours search based on an efficient counting sort algorithm with an improved symmetric search. The adopted search method drastically reduces the computational cost and allows an efficient parallelisation even on a single node through the multi-threading paradigm. Emphasis is also given to the memory efficiency of the code since the history of the contacts among particles has to be traced to model the frictional contributions, when dealing with granular flows of rheological interest that consider non-smooth interacting particles. An effective procedure based on an estimate of the maximum number of the smallest particles surrounding the largest one (given the radii distribution) and a sort applied only to the surrounding particles only is implemented, allowing us to effectively tackle the rheology of non-monodispersed particles with high size-ratio in large domains. Finally, we present validations and verification of the numerical procedure, by comparing with previous simulations and experiments, and present new software capabilities.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections