Abstract

We study, by computer simulations, the roles of different dissipation forces in the rheological properties of highly dense particle-laden flows. In particular, we are interested in the close-packing limit (jamming) and the question of whether "universal" observables can be identified that do not depend on the details of the dissipation model. To this end, we define a simplified lubrication force and systematically vary the range h(c) of this interaction. For fixed h(c) a crossover is seen from a Newtonian flow regime at small strain rates to inertia-dominated flow at larger strain rates. The same crossover is observed as a function of the lubrication range h(c). At the same time, but only at high densities close to jamming, single-particle velocities as well as local density distributions are unaffected by changes in the lubrication range--they are candidates for universal behavior. At densities away from jamming, this invariance is lost: short-range lubrication forces lead to pronounced particle clustering, while longer-ranged lubrication does not. These findings highlight the importance of "geometric" packing constraints for particle motion--independent of the specific dissipation model. With the free volume vanishing at random close packing, particle motion is more and more constrained by the ever smaller amount of free space. On the other hand, macroscopic rheological observables as well as higher-order correlation functions retain the variability of the underlying dissipation model.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.