2021 article

Solution of the Neutron Transport Equation on Unstructured Grids Using the Parallel Block Jacobi-Integral Transport Matrix Method via the Novel Green's Function ITMM Construction Algorithm on Massively Parallel Computer Systems

Hoagland, D. S., Yessayan, R. A., & Azmy, Y. Y. (2021, May 10). *NUCLEAR SCIENCE AND ENGINEERING*.

author keywords: Neutron transport; massively parallel; unstructured grids; Parallel Block Jacobi

UN Sustainable Development Goal Categories

11. Sustainable Cities and Communities
(Web of Science)

Source: Web Of Science

Added: June 10, 2021

The Parallel Block Jacobi (PBJ) spatial domain decomposition is well suited for implementation on massively parallel computers to solve the neutron transport equation on unstructured grids due to the simple scheduling policy that arises from the PBJ’s iterative asynchronicity. The Parallel Block Jacobi-Integral Transport Matrix Method (PBJ-ITMM) is an iterative method that utilizes the PBJ decomposition and resolves local within-group scattering in a single iteration, but requires a matrix-vector iterative solution. This work details the development, implementation, and testing of the novel Green’s Function ITMM Construction (GFIC) algorithm. The GFIC constructs the matrices required for the PBJ-ITMM’s iterative solution on unstructured grids, utilizing the physical interpretation of these matrices as discretized response functions to create a local problem with a Green’s Function–like source. Conducting a set of mesh sweeps over all angles on this local problem yields the ITMM matrix elements. On unstructured grids, this approach utilizes the kernel calculation and fundamental solution algorithm present in an existing transport code, thus avoiding reimplementation of code functionality. Using the GFIC, the PBJ-ITMM is implemented in THOR, a tetrahedral mesh transport code, along with the Inexact Parallel Block Jacobi (IPBJ) method for performance comparison. This comparison involves strong and weak scaling studies of the Godiva and C5G7 benchmark problems using up to 32 768 processors. These studies establish that the PBJ-ITMM executes faster than the IPBJ when the number of cells per subdomain falls below a problem-dependent threshold, ~128 cells for Godiva, >256 cells for C5G7. The largest problem tested, comprising more than 6.8 billion unknowns, solves in <30 min with the IPBJ and <20 min with the PBJ-ITMM, using 32 768 processors. These results demonstrate the PBJ-ITMM as a viable approach for solving neutron transport problems on unstructured grids using massively parallel computers. Additionally, this study illustrates the range of number of cells per subdomain over which this method is favorable.