A tracking algorithm for finite-size particles

Aryan Mehboudi; Shrawan Singhal; S. V. Sreenivasan

Home/Archive/arXiv

arXiv · 2503.11887

A tracking algorithm for finite-size particles

Aryan Mehboudi·Shrawan Singhal·S. V. Sreenivasan

View original source ↗Read source document ↗Export metadata ↓

Abstract

Particle-wall interactions play a crucially important role in various applications such as microfluidic devices for cell sorting, particle separation, entire class of hydrodynamic filtration and its derivatives, etc. Yet, accurate implementation of interactions between wall and finite-size particle is not trivial when working with the currently available particle tracking algorithms/packages as they typically work with point-wise particles. Herein, we report a particle tracking algorithm that takes into account interactions between particles of finite size and solid objects existing inside computational domain. A particle is modeled as a set of circumferential points on its perimeter. While fluid-particle interactions are captured during the track of particle center, interactions between particle and nearby solid objects are modeled explicitly by examining circumferential points and applying a reflection scheme as needed to ensure impenetrability of solid objects. We also report a modified variant of auxiliary structured grid method to locate hosting cells, which in conjunction with a boundary condition scheme enables the capture of interactions between particle and solid objects. As a proof-of-concept, we numerically and experimentally study the motion of particles within a microfluidic deterministic lateral displacement device. The modeling results successfully demonstrate the zig-zag and bumping displacement modes observed in our experiments. We also study a microfluidic device with pinched flow numerically and validate our results against experimental data from the literature. By demonstrating an almost 8x speedup on a system with 8 Performance threads, our investigations suggest that the particle tracking algorithm and its implementation code can benefit from parallel processing on multi-thread systems by using the OpenMP application programming interface.

Explore related subjects

physics.flu-dyn

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Aryan Mehboudi, Shrawan Singhal, S. V. Sreenivasan. 2025-03-14. A tracking algorithm for finite-size particles. https://arxiv.org/abs/2503.11887

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Kinetic closure of turbulence

This letter presents a kinetic closure of the filtered Boltzmann--BGK equation, paving the way toward an alternative description of turbulence. The closure retains the turbulent subfilter stress tensor without a separate Smagorinsky-type ansatz for its structure, unlike classical filtered Navier--Stokes closures. In contrast, it accounts for the subfilter turbulent diffusion in the nonconserved moments by generalizing the BGK collision operator. The model does not require scale separation between resolved and unresolved scales. The Chapman--Enskog analysis shows how its hydrodynamic limit can converge to the filtered Navier--Stokes equations, with velocity gradients isolating subfilter contributions. Numerical tests on the Taylor--Green vortex and the turbulent mixing layer show improved stability and reduced dissipation in the reported cases, benchmarked against the Smagorinsky model.

physics.flu-dyn↗

arXiv2026

Kinetic closure of turbulence: collision-side modeling beyond the filtered Boltzmann equation

This article extends a recently introduced kinetic closure of turbulence by developing its theoretical framework, operational realizations, and validation. In contrast with filtered Navier--Stokes formulations, filtering the Boltzmann equation retains subgrid transport under the linear streaming operator, so that unresolved physics is concentrated on the collision side. We show that in dilute-gas large-eddy simulation, the main limitation of Bhatnagar--Gross--Krook (BGK)-type collision models is not the breakdown of molecular chaos, but the retention of a Markovian collision at a scale where filtering can induce finite temporal correlations in the collision product. In a BGK-type framework, the closure problem is dual: one must infer the filtered fine-grained equilibrium, not computable from filtered moments alone, and model the non-Markovian collision dynamics generated by the collision-product covariance. The present framework makes this dual structure explicit and represents the resulting collision-covariance source term through a BGK-like closure built from the equilibrium commutation residual, with the turbulent relaxation frequency given by a first phenomenological realization. The framework relies on a Chapman--Enskog analysis organized by the reference timescale ratio emerging from the nondimensionalization of the kinetic equation, performed in the classical sense, thereby avoiding artificial turbulent scale separations. We show that the Chapman--Enskog structure is not a pure one-parameter Knudsen scaling: the primary ordering is set by the kinetic-to-macroscopic timescale ratio, while higher moments retain an additional Mach dependence through the mixed scaling of particle velocity. The resulting kinetic closures are validated through lattice Boltzmann simulations and compared with the Smagorinsky model and regularization-based collision models.

physics.flu-dyn↗

arXiv2026

Deep Koopman Sensing

Real-time reconstruction of fluid flows from sparse sensor measurements is important for both physical understanding and flow control. When first-principles models are too expensive for online data assimilation (DA), learned reduced-order models provide an efficient alternative, but are commonly optimized for forward prediction rather than state estimation. We propose Deep Koopman Sensing, a data-driven reduced-order DA framework that combines a nonlinear autoencoder with parameter-conditioned linear latent dynamics approximating the Koopman operator. We compare the proposed model with parametric dynamic mode decomposition (pDMD), a multilayer perceptron (MLP), and xLSTM across four benchmarks: 1D viscous Burgers, 2D flow past a cylinder, 2D dambreak, and 3D flow past a sphere. Our results reveal a marked distinction between forecasting and sensing: open-loop accuracy does not reliably predict assimilation performance, while Deep Koopman Sensing achieves the lowest assimilation error across all four benchmarks. More importantly, with an extended Kalman filter, incorporating sensor measurements improves the estimates of both linear latent models across all four benchmarks, whereas it degrades the nonlinear models, despite their strong open-loop performance. With ensemble filtering, the nonlinear models are no longer degraded by assimilation, while the Koopman model still attains the lowest assimilation error. These results show that latent dynamics should be designed for the downstream estimation task rather than selected solely for forecast accuracy, and demonstrate Koopman-based reduced-order modeling as an effective approach for real-time flow reconstruction from sparse, streaming measurements.

physics.flu-dyn↗