期刊
NUCLEAR SCIENCE AND ENGINEERING
卷 193, 期 7, 页码 746-759出版社
TAYLOR & FRANCIS INC
DOI: 10.1080/00295639.2018.1562778
关键词
Transport; discrete ordinates; high order; sweep; unstructured
资金
- U.S. Department of Energy (DOE) by Lawrence Livermore National Laboratory (LLNL) [DE-AC52-07NA27344]
- LLNL Laboratory Directed Research and Development Program [18-ERD-002]
- DOE by LLNL [DE-AC52-07NA27344]
- Lawrence Livermore National Security, LLC [B614452, B627942]
- National Nuclear Security Administration [DE-NA0002376]
We propose a graph-based sweep algorithm for solving the steady-state, monoenergetic discrete ordinates on meshes of high-order (HO) curved mesh elements. Our spatial discretization consists of arbitrarily HO discontinuous Galerkin finite elements using upwinding at mesh element faces. To determine mesh element sweep ordering, we define a directed, weighted graph whose vertices correspond to mesh elements and whose edges correspond to mesh element upwind dependencies. This graph is made acyclic by removing select edges in a way that approximately minimizes the sum of removed edge weights. Once the set of removed edges is determined, transport sweeps are performed by lagging the upwind dependency associated with the removed edges. The proposed algorithm is tested on several two-dimensional and three-dimensional meshes composed of HO curved mesh elements.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据