A hybrid TT/QTT discontinuous Galerkin method with fixed-matrix upwinding for three-dimensional transient multigroup neutron transport
Abstract
We develop a hybrid tensor-train/quantized tensor-train (TT/QTT) upwind discontinuous Galerkin method for three-dimensional transient multigroup neutron transport. The central contribution is a fixed-matrix upwind construction: two spatial DG matrices serve all directions and energy groups, with signed and absolute direction-cosine factors preserving Kronecker structure. For homogeneous materials on uniform Cartesian grids, operator rank bounds are independent of mesh size, group count and direction count at fixed scattering order. We derive a conditional global step-defect bound and enforce group-integrated balance of the compressed system. Crank-Nicolson tests show second-order convergence on a separable manufactured solution whose finest final state occupies 13 kB instead of 35 TB, a compression factor of 2.7×109. A modified rank-adaptive basis-update and Galerkin integrator (TT-BUG) advances passive and active bursts with approximately half a billion unknowns. Selected runs are 15-20 times faster than AMEn at comparable verified scalar-flux errors. In the reported anisotropic active-burst configurations, TT-BUG takes 14.3 s on one processor versus 716 s for OpenSn on 24 processors: approximately 50 times less wall time and 1200 times less allocated processor-time cost. This compares reported configurations rather than matched physical errors. OpenSn provides an independent discretization check. The modified TT-BUG source-onset and saturation treatment is tested numerically; its order, convergence and general tolerance-to-error relation remain unproved.
Related
- The discontinuous Galerkin method for solving the two-dimensional transport equation with distributed-order memory kernel on triangular meshes
- The sharp CFL condition of the piecewise constant sparse grid discontinuous Galerkin method for high-dimensional transport equations
- Domain-decomposed Evolutional Deep Neural Network with Random Features for Transient Pressure Diffusion with Discontinuous and High-Contrast Coefficients
- Transport-Matched Penalties for Diffusion Synthetic Acceleration of Polytopic Discontinuous Galerkin Discretisations
- Discontinuous phase transitions in the one-dimensional pair and triplet creation processes
BibTeX
@misc{adak2026hybrid,
title = {{A hybrid TT/QTT discontinuous Galerkin method with fixed-matrix upwinding for three-dimensional transient multigroup neutron transport}},
author = {Dibyendu Adak and Radoslav Vuchkov and Oleg Korobkin and Ted Sariyski and Boian S. Alexandrov},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.04360},
eprint = {2611.04360},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.04360},
}
RIS
TY - UNPB
TI - A hybrid TT/QTT discontinuous Galerkin method with fixed-matrix upwinding for three-dimensional transient multigroup neutron transport
AU - Dibyendu Adak
AU - Radoslav Vuchkov
AU - Oleg Korobkin
AU - Ted Sariyski
AU - Boian S. Alexandrov
PY - 2026
DA - 2026/11/03
PB - arXiv
DO - 10.48550/arxiv.2611.04360
UR - https://arxiv.org/abs/2611.04360
AB - We develop a hybrid tensor-train/quantized tensor-train (TT/QTT) upwind discontinuous Galerkin method for three-dimensional transient multigroup neutron transport. The central contribution is a fixed-matrix upwind construction: two spatial DG matrices serve all directions and energy groups, with signed and absolute direction-cosine factors preserving Kronecker structure. For homogeneous materials on uniform Cartesian grids, operator rank bounds are independent of mesh size, group count and direction count at fixed scattering order. We derive a conditional global step-defect bound and enforce group-integrated balance of the compressed system. Crank-Nicolson tests show second-order convergence on a separable manufactured solution whose finest final state occupies 13 kB instead of 35 TB, a compression factor of 2.7×10^9. A modified rank-adaptive basis-update and Galerkin integrator (TT-BUG) advances passive and active bursts with approximately half a billion unknowns. Selected runs are 15-20 times faster than AMEn at comparable verified scalar-flux errors. In the reported anisotropic active-burst configurations, TT-BUG takes 14.3 s on one processor versus 716 s for OpenSn on 24 processors: approximately 50 times less wall time and 1200 times less allocated processor-time cost. This compares reported configurations rather than matched physical errors. OpenSn provides an independent discretization check. The modified TT-BUG source-onset and saturation treatment is tested numerically; its order, convergence and general tolerance-to-error relation remain unproved.
ER -