Multigroup Thermal Radiation Transport with Tensor Trains
Aditya S. Deshpande, Patrick D. Mullen, Alex A. Gorodetsky, Joshua C. Dolence, Chad D. Meyer, Jonah M. Miller, Luke F. Roberts
TL;DR
This paper introduces a tensor-train (TT) based solver for multigroup thermal radiation transport (MRT), extending a previously gray TT method to include frequency groups by merging space and frequency into a single spatio-spectral TT core. Across a suite of challenging tests (Hohlraum, thermal relaxation with small and large $N_ u$, Gaussian diffusion, Graziani prompt spectrum with varying opacities, and stellar irradiation), the TT approach achieves substantial storage compression (often >$10^3$–$10^5$) and significant speedups (often >$10^2$), while preserving accuracy through energy conservation and to within prescribed tolerances. The study analyzes the internal structure of the merged core, defines internal ranks $r_{ u x}$ and $r_{x u}$, and compares TT topologies that separate space and frequency; results show that compression gains depend on problem regime, with certain problems favoring frequency- or space-angle-proximate decompositions. The work discusses binwise vs full multigroup TT representations, observes pointwise errors from rank truncation, and highlights practical trade-offs, suggesting avenues for future enhancements such as alternate TT topologies and randomized SVD techniques to further exploit low-rank structure in MRT. Overall, the method enables high-fidelity MRT computations with many frequency groups that were previously intractable on single nodes, offering a path toward scalable, non-gray radiative transfer simulations in complex physics.
Abstract
We investigate the application of tensor train (TT) algorithms to multigroup thermal radiation transport (i.e., photon radiation transport). The TT framework enables simulations at discretizations that might otherwise be computationally infeasible on conventional hardware. We show that solutions to certain multigroup problems possess an intrinsic low-rank structure, which the TT representation leverages effectively. This enables us to solve problems where the discretized solution size exceeds a trillion parameters on a single node. We consistently achieve compression factors $>$100$\times$ and speedups $>$2$\times$. The solver is evaluated across a range of test problems with varying levels of complexity. In addition, we further analyze the low-rank structure of the merged spatio-spectral core to evaluate the potential for additional compression via more advanced TT decompositions.
