Low-memory, discrete ordinates, discontinuous Galerkin methods for radiative transport
Abstract
The discrete ordinates discontinuous Galerkin (-DG) method is a well-established and practical approach for solving the radiative transport equation. In this paper, we study a low-memory variation of the upwind -DG method. The proposed method uses a smaller finite element space that is constructed by coupling spatial unknowns across collocation angles, thereby yielding an approximation with fewer degrees of freedom than the standard method. Like the original -DG method, the low memory variation still preserves the asymptotic diffusion limit and maintains the characteristic structure needed for mesh sweeping algorithms. While we observe second-order convergence in scattering dominated, diffusive regime, the low-memory method is in general only first-order accurate. To address this issue, we use upwind reconstruction to recover second-order accuracy. For both methods, numerical procedures based on upwind sweeps are proposed to reduce the system dimension in the underlying Krylov solver strategy.
Keywords
Cite
@article{arxiv.1907.01027,
title = {Low-memory, discrete ordinates, discontinuous Galerkin methods for radiative transport},
author = {Zheng Sun and Cory D. Hauck},
journal= {arXiv preprint arXiv:1907.01027},
year = {2019}
}
Comments
24 pages