An efficient particle-locating algorithm for application in arbitrary 2D and 3D grids

DOI10.1016/S0301-9322(02)00045-9MaRDI QIDQ5451286zbMATH OpenOpenAlexFDO

Authors R. Chordá, J. A. Blasco, Norberto Fueyo

Publication date 27 March 2008

Published in International Journal of Multiphase Flow (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0301-9322(02)00045-9

zbMATH Keywords

algorithmjoint composition PDFLagrangianlocatingMonte Carloparticlesturbulent flameunstructured grid

Mathematics Subject Classification ID

Multiphase and multicomponent flows (76Txx)

Recommendations

• An efficient and robust particle-localization algorithm for unstructured grids
• A set of particle locating algorithms not requiring face belonging to cellconnectivity data
• A generalized particle search-locate algorithm for arbitrary grids
• An improved particle-locating algorithm for Eulerian-Lagrangian computations of two-phase flows in general coordinates
• An improved known vicinity algorithm based on geometry test for particle localization in arbitrary grid

Cited in

(13)

• An improved known vicinity algorithm based on geometry test for particle localization in arbitrary grid
• Localization schemes in 2D boundary-fitted grids
• A generalized particle search-locate algorithm for arbitrary grids
• A particle tracking algorithm for parallel finite element applications
• An optimal \(\mathcal{O}(N)\) scheme for simulations of colliding, particle-laden flows on unstructured grids
• A two-way coupled Euler-Lagrange method for simulating multiphase flows with discontinuous Galerkin schemes on arbitrary curved elements
• An efficient and robust particle-localization algorithm for unstructured grids
• Particle host cell determination in unstructured grids
• An efficient and robust method for Lagrangian magnetic particle tracking in fluid flow simulations on unstructured grids
• An improved particle-locating algorithm for Eulerian-Lagrangian computations of two-phase flows in general coordinates
• A particle localization algorithm on unstructured curvilinear polynomial meshes
• An efficient particle locating method on unstructured meshes in two and three dimensions based on patch searching
• A set of particle locating algorithms not requiring face belonging to cellconnectivity data

This page was built for publication: An efficient particle-locating algorithm for application in arbitrary 2D and 3D grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451286)