Scholarlink

<p>This paper shows that lumped directed-area vectors at edges and dual volumes required to implement the edge-based discretization can be computed without explicitly&#xa0;forming the dual control volume around each node for triangular and tetrahedral grids. It is a simpler implementation because there is no need to form a dual control volume by connecting edge-midpoints, face centroids, and element centroids, and it&#xa0;also reduces the time for computing lumped directed-area vectors for a given grid, especially for tetrahedral grids. The speed-up achieved by the proposed algorithm may not be large enough to greatly impact the overall simulation time, but the proposed algorithm is expected to serve as a major stepping stone towards extending the edge-based discretization to four dimensions and beyond (e.g., space-time simulations). Efficient algorithms for computing lumped directed-area vectors and dual volumes without forming dual control&#xa0;volumes are presented, and their implementations are described and compared with traditional algorithms in terms of complexity as well as actual computing time for a given grid.</p>

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

An efficient implementation of edge-based discretization without forming dual control volumes

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年8月6日

查看全文
  • Hiroaki Nishikawa

摘要

This paper shows that lumped directed-area vectors at edges and dual volumes required to implement the edge-based discretization can be computed without explicitly forming the dual control volume around each node for triangular and tetrahedral grids. It is a simpler implementation because there is no need to form a dual control volume by connecting edge-midpoints, face centroids, and element centroids, and it also reduces the time for computing lumped directed-area vectors for a given grid, especially for tetrahedral grids. The speed-up achieved by the proposed algorithm may not be large enough to greatly impact the overall simulation time, but the proposed algorithm is expected to serve as a major stepping stone towards extending the edge-based discretization to four dimensions and beyond (e.g., space-time simulations). Efficient algorithms for computing lumped directed-area vectors and dual volumes without forming dual control volumes are presented, and their implementations are described and compared with traditional algorithms in terms of complexity as well as actual computing time for a given grid.