An improved known vicinity algorithm based on geometry test for particle localization in arbitrary grid

DOI10.1016/j.jcp.2009.09.003zbMath1375.76196OpenAlexW1991980565MaRDI QIDQ1037755

Chunxin Yang, Peng Ke, Shuguang Zhang, Jiang-Hao Wu

Publication date: 16 November 2009

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcp.2009.09.003

zbMATH Keywords

unstructured gridbinary searchparticle localizationEulerian-Lagrangian simulationknown vicinity algorithm

Mathematics Subject Classification ID

Particle methods and lattice-gas methods (76M28) Liquid-gas two-phase flows, bubbly flows (76T10)

Related Items (1)

An optimal \(\mathcal{O}(N)\) scheme for simulations of colliding, particle-laden flows on unstructured grids

Cites Work

• Particle host cell determination in unstructured grids
• Localization schemes in 2D boundary-fitted grids
• Robust, vectorized search algorithms for interpolation on unstructured grids
• An efficient and robust particle-localization algorithm for unstructured grids
• A vectorized particle tracer for unstructured grids
• Large-eddy simulation of swirling particle-laden flows in a coaxial-jet combustor
• An efficient particle-locating algorithm for application in arbitrary 2D and 3D grids
• An improved particle-locating algorithm for Eulerian-Lagrangian computations of two-phase flows in general coordinates
• On the Kunneth Formula and Functorial Dependence in Algebraic Topology
• Nonlinear particle tracking for high-order elements.
• An effective particle tracing scheme on structured/unstructured grids in hybrid finite volume/PDF Monte Carlo methods

This page was built for publication: An improved known vicinity algorithm based on geometry test for particle localization in arbitrary grid