Search arXiv⌕ Search

arXiv · 2610.23087

Geometry-Aware Latent Representation Learning for Drag Coefficient Prediction of Irregular Particles

Abstract

Predicting the drag coefficient $C_\mathrm{d}$ of irregular particles requires representing their complex three-dimensional geometry in a form suitable for predictive models. Empirical drag correlations and many data-driven models represent particle geometry through a small set of hand-crafted shape descriptors. Geometric differences omitted by these descriptors are unavailable to the predictor. We propose a variational autoencoder-multilayer perceptron (VAE-MLP) framework that learns a latent representation directly from voxelized particle geometry. Geometry reconstruction and drag coefficient prediction jointly guide the learning of this representation. We compare VAE-MLP with a descriptor-based MLP (Descriptor-MLP) and established empirical correlations using CFD data for synthetic particle geometries at Reynolds numbers of 10--200. When the evaluated geometric variations are represented in the training data, the two learned models achieve comparable accuracy for regular ellipsoids, while VAE-MLP yields lower errors for irregular particles. When high-order surface perturbations are excluded from training, VAE-MLP achieves lower overall mean absolute relative error in all five training runs. At the strongest tested perturbation, the mean errors across these runs are 4.97% for VAE-MLP and 9.88% for Descriptor-MLP. These results support learning geometric representations directly from particle geometry to improve drag prediction for the irregular geometries and unseen surface perturbations examined here.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zihao Li, Shota Deguchi, Mitsuteru Asai, Shunhua Chen, Naoto Mitsume. 2026-10-16. Geometry-Aware Latent Representation Learning for Drag Coefficient Prediction of Irregular Particles. https://arxiv.org/abs/2610.23087

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

KEEP EXPLORING

Related papers

Optimization of gridding algorithms for FFT by vector optimization

The Fast Fourier Transform (FFT) is widely used in applications such as MRI, CT, and interferometry; however, because of its dependence on uniformly sampled data, it requires the use of gridding techniques for practical implementation. The performance of these algorithms strongly depends on the choice of the gridding kernel, with the first prolate spheroidal wave function (PSWF) regarded as optimal. This work redefines kernel optimality through the lens of vector optimization (VO), introducing a rigorous framework that characterizes optimal kernels as Pareto-efficient solutions of an error shape operator. We establish the continuity of such operator, study the existence of solutions, and propose a novel methodology to construct kernels tailored to a desired target error function. The approach is implemented numerically via interior-point optimization. Comparative experiments demonstrate that the proposed kernels outperform both the PSWF and the state-of-the-art methods (MIRT-NUFFT) in specific regions of interest, achieving orders-of-magnitude improvements in mean absolute errors. These results confirm the potential of VO-based kernel design to provide customized accuracy profiles aligned with application-specific requirements. Future research will extend this framework to multidimensional cases and relative error minimization, with potential integration of machine learning for adaptive target error selection.

math.NA↗

On the convergence rates of generalized conditional gradient method for fully discretized Mean Field Games

We study convergence rates of the generalized conditional gradient (GCG) method applied to fully discretized Mean Field Games (MFG) systems. While explicit convergence rates of the GCG method have been established at the continuous PDE level, a rigorous analysis that simultaneously accounts for time-space discretization and iteration errors has been missing. In this work, we consider an MFG system with a quadratic Hamiltonian including an advection term. We employ the GCG method to construct an iterative algorithm in which the HJB and FP equations are solved separately. At each iteration, we apply the Cole--Hopf transformation to linearize these equations and discretize the resulting linear PDEs using a finite difference method. We then analyze the resulting fully discrete GCG scheme. Under suitable structural assumptions on coupling terms, we establish discrete maximum principles and derive explicit error estimates that quantify both discretization errors and iteration errors within a unified framework. Our estimates show how the convergence rates depend on the mesh sizes and the iteration number, and they reveal a non-uniform behavior with respect to the iteration. Moreover, we prove that higher convergence rates can be achieved under additional regularity assumptions on the solution. Numerical experiments are presented to illustrate the theoretical results and to confirm the predicted convergence behavior.

math.NA↗

Dynamic inverse problems: Online regularisation theory

We develop regularisation theory for dynamic inverse problems, solved using online methods with an infinite time horizon. Using concepts of subregularity to treat nonsmooth regularisers, we prove that time-averaged reconstruction errors converge to zero as noise, algorithmic errors, and regularisation vanish as the horizon grows. We illustrate the theory numerically with a dynamic electrical impedance tomography example.

math.NA↗