arXiv subjects

Thibault Maurel-Oujia

Publications and source records attributed to Thibault Maurel-Oujia.

5 recordsLinked to original sources

arXiv2026

Multiresolution analysis on tessellation graphs for inertial particle dynamics

A multiresolution technique on tessellation graphs for particle dynamics is proposed. This allows to split spatial field data given on millions of discrete particle positions into scale-dependent contributions. The Delaunay tessellation is used to define the graph, and Voronoi cell volumes are used to satisfy volume conservation. Our approach enables computation of the scale-dependent statistics of particle dynamics by leveraging a wavelet transformation of Lagrangian point particle data and is useful for characterizing particle clustering in turbulent flows. The technique is systematically verified by using synthetic data of randomly distributed particles in a two-dimensional plane. Then the applicability of the technique is demonstrated by extracting the scale-dependent particle velocity divergence of inertial particles in homogeneous isotropic turbulence from direct numerical simulation data. The result is verified by comparing the energy spectrum of the divergence with that obtained by a Fourier-based approach. Finally, the wavelet-based filtering to the particle velocity divergence is demonstrated to extract the effect of caustics in inertial particle clustering.

physics.flu-dyn↗

arXiv2024

Singularity formation of vortex sheets in 2D Euler equations using the characteristic mapping method

The goal of this numerical study is to get insight into singular solutions of the two-dimensional (2D) Euler equations for non-smooth initial data, in particular for vortex sheets. To this end high resolution computations of vortex layers in 2D incompressible Euler flows are performed using the characteristic mapping method (CMM). This semi-Lagrangian method evolves the flow map using the gradient-augmented level set method (GALS). The semi-group structure of the flow map allows its decomposition into sub-maps (each over a finite time interval), and thus the precision can be controlled by choosing appropriate remapping times. Composing the flow map yields exponential resolution in linear time, a unique feature of CMM, and thus fine scale flow structures can be resolved in great detail. Here the roll-up process of vortex layers is studied varying the thickness of the layer showing its impact on the growth of palinstrophy and possible blow up of absolute vorticity. The curvature of the vortex sheet shows a singular-like behavior. The self-similar structure of the vortex core is investigated in the vanishing thickness limit. Conclusions on the non-uniqueness of weak solutions of 2D Euler for non-smooth initial data are drawn and the presence of flow singularities is revealed tracking them in the complex plane.

physics.flu-dyn↗

arXiv2024

Synthesizing impurity clustering in the edge plasma of tokamaks using neural networks

This work investigates the behavior of impurities in edge plasma of tokamaks using high-resolution numerical simulations based on Hasegawa--Wakatani equations. Specifically, it focuses on the behavior of inertial particles, which has not been extensively studied in the field of plasma physics. Our simulations utilize one-way coupling of a large number of inertial point particles, which model plasma impurities. We observe that with Stokes number ($St$) which characterizes the inertia of particles being much less than one, such light impurities closely track the fluid flow without pronounced clustering. For intermediate $St$ values, distinct clustering appears, with larger Stokes values, {\it i.e.} heavy impurities even generating more substantial clusters. When $St$ is significantly large, very heavy impurities tend to detach from the flow and maintain their trajectory, resulting in fewer observable clusters and corresponding to random motion. A core component of this work involves machine learning techniques. Applying three different neural networks - Autoencoder, U-Net, and Generative Adversarial Network (GAN) - to synthesize preferential concentration fields of impurities, we use vorticity as input and predict impurity number density fields. GAN outperforms the two others by aligning closely with direct numerical simulation data in terms of probability density functions of the particle distribution and energy spectra. This machine learning technique holds the potential to reduce computational costs by eliminating the need to track millions of particles modeling impurities in simulations.

physics.plasm-ph↗

arXiv2023

Neural network models for preferential concentration of particles in two-dimensional turbulence

Cluster and void formations are key processes in the dynamics of particle-laden turbulence. In this work, we assess the performance of various neural network models for synthesizing preferential concentration fields of particles in turbulence. A database of direct numerical simulations of homogeneous isotropic two-dimensional turbulence with one-way coupled inertial point particles, is used to train the models using vorticity as the input to predict the particle number density fields. We compare autoencoder, U--Net, generative adversarial network (GAN), and diffusion model approaches, and assess the statistical properties of the generated particle number density fields. We find that the GANs are superior in predicting clusters and voids, and therefore result in the best performance. Additionally, we explore a concept of ``supersampling", where neural networks can be used to predict full particle data using only the information of few particles, which yields promising perspectives for reducing the computational cost of expensive DNS computations by avoiding the tracking of millions of particles. We also explore the inverse problem of synthesizing the enstrophy fields using the particle number density distribution as the input at different Stokes numbers. Hence, our study also indicates the potential use of neural networks to predict turbulent flow statistics using experimental measurements of inertial particles.

physics.flu-dyn↗

arXiv2023

Computing differential operators of the particle velocity in moving particle clouds using tessellations

We propose finite-time measures to compute the divergence, the curl and the velocity gradient tensor of the point particle velocity for two- and three-dimensional moving particle clouds. For this purpose, a tessellation of the particle positions is performed to assign a volume to each particle. We introduce a modified Voronoi tessellation which overcomes some drawbacks of the classical construction. Instead of the circumcenter we use the center of gravity of the Delaunay cell for defining the vertices. Considering then two subsequent time instants, the dynamics of the volume can be assessed. Determining the volume change of tessellation cells yields the divergence of the particle velocity. Reorganizing the various velocity coefficients allows computing the curl and even the velocity gradient tensor. The helicity of particle velocity can be likewise computed and swirling motion of particle clouds can be quantified. First we assess the numerical accuracy for randomly distributed particles. We find a strong Pearson correlation between the divergence computed with the the modified tessellation, and the exact value. Moreover, we show that the proposed method converges with first order in space and time in two and three dimensions. Then we consider particles advected with random velocity fields with imposed power-law energy spectra. We study the number of particles necessary to guarantee a given precision. Finally, applications to fluid particles advected in three-dimensional fully developed isotropic turbulence show the utility of the approach for real world applications to quantify self-organization in particle clouds and their vortical or even swirling motion.

math.NA↗