4.5 Article

AN ADAPTIVE NESTED SOURCE TERM ITERATION FOR RADIATIVE TRANSFER EQUATIONS

Journal

MATHEMATICS OF COMPUTATION
Volume 89, Issue 324, Pages 1605-1646

Publisher

AMER MATHEMATICAL SOC
DOI: 10.1090/mcom/3505

Keywords

DPG transport solver; iteration in function space; fast application of scattering operator; Hilbert-Schmidt decomposition; matrix compression; a posteriori bounds; kinetic problems; linear Boltzmann; radiative transfer

Funding

  1. NSF [DMS 1720297]
  2. Williams-Hedberg Foundation
  3. SmartState

Ask authors/readers for more resources

We propose a new approach to the numerical solution of radiative transfer equations with certified a posteriori error bounds for the L-2 norm. A key role is played by stable Petrov-Galerkin-type variational formulations of parametric transport equations and corresponding radiative transfer equations. This allows us to formulate an iteration in a suitable, infinite-dimensional function space that is guaranteed to converge with a fixed error reduction per step. The numerical scheme is then based on approximately realizing this iteration within dynamically updated accuracy tolerances that still ensure convergence to the exact solution. To advance this iteration two operations need to be performed within suitably tightened accuracy tolerances. First, the global scattering operator needs to be approximately applied to the current iterate within a tolerance comparable to the current accuracy level. Second, parameter dependent linear transport equations need to be solved, again at the required accuracy of the iteration. To ensure that the stage dependent error tolerances are met, one has to employ rigorous a posteriori error bounds which, in our case, rest on a Discontinuous Petrov-Galerkin (DPG) scheme. These a posteriori bounds are not only crucial for guaranteeing the convergence of the perturbed iteration but are also used to generate adapted parameter dependent spatial meshes. This turns out to significantly reduce overall computational complexity. Since the global operator is only applied, we avoid the need to solve linear systems with densely populated matrices. Moreover, the approximate application of the global scatterer is accelerated through low-rank approximation and matrix compression techniques. The theoretical findings are illustrated and complemented by numerical experiments with non-trivial scattering kernels.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available