DOE OSTI · 23178737
Parallel transport sweeps on two-dimensional cartesian and hexagonal grids
Abstract
This paper aims to provide a proof of concept for parallel transport sweeps on two-dimensional hexagonal grids for the discrete ordinates transport equation. While the method is an extension of the popular and well-established Koch-Baker-Alcoulffe (KBA) algorithm, there are significant differences between the cartesian and hexagonal grid and thereafter sweep. The most important is the three-way connectivity of hexagons within the grid which creates greater dependencies between the elements. The KBA method in structured orthogonal grids was first implemented in the DRAGON5 code and the method is first described here. The differences in implementation for the hexagonal grid are also described. Benchmark results are also presented, showing roughly 10 times speedup in computational times with roughly 100 processors, in both cases. (authors)
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Calloo, Atyab A., Hebert, A.. 2022-07-01. Parallel transport sweeps on two-dimensional cartesian and hexagonal grids. https://www.osti.gov/biblio/23178737
Cite the original work for its findings. Save a collection to share your selection of sources.