Scholarlink

<p>We introduce a novel property of bounded Voronoi tessellations that enables cycle-free mesh sweeping algorithms. We prove that a topological sort of the dual graph of any Voronoi tessellation is feasible in any flow direction and dimension, allowing straightforward application to discontinuous Galerkin (DG) discretisations of first-order hyperbolic partial differential equations and the Boltzmann Transport Equation (BTE) without requiring flux-cycle corrections. We also present an efficient algorithm to perform the topological sort on the dual mesh nodes, ensuring a valid sweep ordering. This result expands the applicability of DG methods for transport problems on polytopal meshes by providing a robust framework for scalable, parallelised solutions. To illustrate its effectiveness, we conduct a series of computational experiments showcasing a DG scheme for BTE, demonstrating both computational efficiency and adaptability to complex geometries.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Cycle-free polytopal mesh sweeping for Boltzmann transport

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年5月2日

查看全文
  • Ansar Calloo,
  • Matthew Evans,
  • Henry Lockyer,
  • François Madiot,
  • Tristan Pryer,
  • Luca Zanetti

摘要

We introduce a novel property of bounded Voronoi tessellations that enables cycle-free mesh sweeping algorithms. We prove that a topological sort of the dual graph of any Voronoi tessellation is feasible in any flow direction and dimension, allowing straightforward application to discontinuous Galerkin (DG) discretisations of first-order hyperbolic partial differential equations and the Boltzmann Transport Equation (BTE) without requiring flux-cycle corrections. We also present an efficient algorithm to perform the topological sort on the dual mesh nodes, ensuring a valid sweep ordering. This result expands the applicability of DG methods for transport problems on polytopal meshes by providing a robust framework for scalable, parallelised solutions. To illustrate its effectiveness, we conduct a series of computational experiments showcasing a DG scheme for BTE, demonstrating both computational efficiency and adaptability to complex geometries.