Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1403.2838

On the Eulerian Large Eddy Simulation of disperse phase flows: an asymptotic preserving scheme for small Stokes number flows

Christophe Chalons·Marc Massot·Aymeric Vié
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the present work, the Eulerian Large Eddy Simulation of dilute disperse phase flows is investigated. By highlighting the main advantages and drawbacks of the available approaches in the literature, a choice is made in terms of modelling: a Fokker-Planck-like filtered kinetic equation proposed by Zaichik et al. 2009 and a Kinetic-Based Moment Method (KBMM) based on a Gaussian closure for the NDF proposed by Vie et al. 2014. The resulting Euler-like system of equations is able to reproduce the dynamics of particles for small to moderate Stokes number flows, given a LES model for the gaseous phase, and is representative of the generic difficulties of such models. Indeed, it encounters strong constraints in terms of numerics in the small Stokes number limit, which can lead to a degeneracy of the accuracy of standard numerical methods. These constraints are: 1/as the resulting sound speed is inversely proportional to the Stokes number, it is highly CFL-constraining, and 2/the system tends to an advection-diffusion limit equation on the number density that has to be properly approximated by the designed scheme used for the whole range of Stokes numbers. Then, the present work proposes a numerical scheme that is able to handle both. Relying on the ideas introduced in a different context by Chalons et al. 2013: a Lagrange-Projection, a relaxation formulation and a HLLC scheme with source terms, we extend the approach to a singular flux as well as properly handle the energy equation. The final scheme is proven to be Asymptotic-Preserving on 1D cases comparing to either converged or analytical solutions and can easily be extended to multidimensional configurations, thus setting the path for realistic applications.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christophe Chalons, Marc Massot, Aymeric Vié. 2014-03-12. On the Eulerian Large Eddy Simulation of disperse phase flows: an asymptotic preserving scheme for small Stokes number flows. https://doi.org/10.1137/140960438

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

KEEP EXPLORING

Related papers

arXiv2026

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA↗
arXiv2026

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA↗
arXiv2026

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA↗