Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > physics > arXiv:2501.05340

Help | Advanced Search

Physics > Computational Physics

arXiv:2501.05340 (physics)
[Submitted on 9 Jan 2025 ]

Title: Efficient computation of particle-fluid and particle-particle interactions in compressible flow

Title: 可压缩流中粒子-流体和粒子-粒子相互作用的高效计算

Authors:Anna Schwarz, Patrick Kopper, Emilian De Staercke, Andrea Beck
Abstract: Particle collisions are the primary mechanism of inter-particle momentum and energy exchange for dense particle-laden flow. Accurate approximation of this collision operator in four-way coupled Euler-Lagrange approaches remains challenging due to the associated computational cost. Adopting a deterministic collision model and a hard-sphere approach eases time step constraints but imposes non-locality on distributed memory architectures, necessitating the inclusion of collision partners from each grid element in the vicinity. Retaining high-order accuracy and parallel efficiency also ties into the correct and compact treatment of the particle-fluid coupling, where adequate kernels are required to effectively project the work of the particles to the Eulerian grid. In this work, we present an efficient particle collision and projection operator based on an MPI+MPI hybrid approach to enable time-resolved and high-order accurate simulations of compressible, four-way coupled particle-laden flows at dense concentrations. A distinct feature of the proposed particle collision algorithm is the efficient calculation of exact binary inter-particle collisions on arbitrary core counts. Combining the particle operator with a hybrid discretization operator based on a high-order discontinuous Galerkin method and a localized low-order finite volume operator allows an accurate treatment of highly compressible particle-laden flows. The approach is extensively validated against a range of benchmark problems. Contrary to literature, the scaling properties are demonstrated on state-of-the-art high performance computing systems. Finally, the proposed algorithm is compatible with unstructured, curved high-order grids which permits the handling of complex geometries as is emphasized by application of the framework to large-scale application cases.
Abstract: 粒子碰撞是密集颗粒载流中颗粒间动量和能量交换的主要机制。 在四向耦合的欧拉-拉格朗日方法中,对这种碰撞算子的准确近似仍然具有挑战性,这是由于相关的计算成本较高。 采用确定性碰撞模型和硬球方法可以缓解时间步长的约束,但在分布式内存架构上会引入非局部性,需要将每个网格单元附近的碰撞伙伴包含进来。 保持高阶精度和平行效率也与正确的和紧凑的颗粒-流体耦合处理有关,其中需要适当的核函数来有效地将颗粒的工作投影到欧拉网格上。 在本工作中,我们提出了一种基于MPI+MPI混合方法的高效粒子碰撞和投影算子,以实现对高密度下可压缩的四向耦合颗粒载流的时间分辨和高阶精确模拟。 所提出的粒子碰撞算法的一个显著特点是能够在任意核心数量上高效计算精确的二元颗粒间碰撞。 将粒子算子与基于高阶不连续伽辽金方法和局部低阶有限体积算子的混合离散化算子相结合,可以准确处理高度可压缩的颗粒载流。 该方法经过了多种基准问题的广泛验证。 与文献不同,该方法的扩展特性是在最先进的高性能计算系统上进行演示的。 最后,所提出的算法兼容非结构化、曲面高阶网格,这使得能够处理复杂几何结构,如框架应用于大规模应用案例时所强调的那样。
Subjects: Computational Physics (physics.comp-ph)
Cite as: arXiv:2501.05340 [physics.comp-ph]
  (or arXiv:2501.05340v1 [physics.comp-ph] for this version)
  https://doi.org/10.48550/arXiv.2501.05340
arXiv-issued DOI via DataCite

Submission history

From: Anna Schwarz [view email]
[v1] Thu, 9 Jan 2025 16:10:36 UTC (4,017 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
view license
Current browse context:
physics.comp-ph
< prev   |   next >
new | recent | 2025-01
Change to browse by:
physics

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号