A class of Galerkin schemes for time-dependent radiative transfer

The numerical solution of time-dependent radiative transfer problems is challenging, both, due to the high dimension as well as the anisotropic structure of the underlying integro-partial differential equation. In this paper we propose a general framework for designing numerical methods for time-dependent radiative transfer based on a Galerkin discretization in space and angle combined with appropriate time stepping schemes. This allows us to systematically incorporate boundary conditions and to preserve basic properties like exponential stability and decay to equilibrium also on the discrete level. We present the basic a-priori error analysis and provide abstract error estimates that cover a wide class of methods. The starting point for our considerations is to rewrite the radiative transfer problem as a system of evolution equations which has a similar structure like first order hyperbolic systems in acoustics or electrodynamics. This analogy allows us to generalize the main arguments of the numerical analysis for such applications to the radiative transfer problem under investigation. We also discuss a particular discretization scheme based on a truncated spherical harmonic expansion in angle, a finite element discretization in space, and the implicit Euler method in time. The performance of the resulting mixed PN-finite element time stepping scheme is demonstrated by computational results

Spatial adaptivity of the SAAF and Weighted Least Squares (WLS) forms of the neutron transport equation using constraint based, locally refined, isogeometric analysis (IGA) with dual weighted residual (DWR) error measures

This paper describes a methodology that enables NURBS (Non-Uniform Rational B-spline) based Isogeometric Analysis (IGA) to be locally refined. The methodology is applied to continuous Bubnov-Galerkin IGA spatial discretisations of second-order forms of the neutron transport equation. In particular this paper focuses on the self-adjoint angular flux (SAAF) and weighted least squares (WLS) equations. Local refinement is achieved by constraining degrees of freedom on interfaces between NURBS patches that have different levels of spatial refinement. In order to effectively utilise constraint based local refinement, adaptive mesh refinement (AMR) algorithms driven by a heuristic error measure or forward error indicator (FEI) and a dual weighted residual (DWR) or goal-based error measure (WEI) are derived. These utilise projection operators between different NURBS meshes to reduce the amount of computational effort required to calculate the error indicators. In order to apply the WEI to the SAAF and WLS second-order forms of the neutron transport equation the adjoint of these equations are required. The physical adjoint formulations are derived and the process of selecting source terms for the adjoint neutron transport equation in order to calculate the error in a given quantity of interest (QoI) is discussed. Several numerical verification benchmark test cases are utilised to investigate how the constraint based local refinement affects the numerical accuracy and the rate of convergence of the NURBS based IGA spatial discretisation. The nuclear reactor physics verification benchmark test cases show that both AMR algorithms are superior to uniform refinement with respect to accuracy per degree of freedom. Furthermore, it is demonstrated that for global QoI the FEI driven AMR and WEI driven AMR produce similar results. However, if local QoI are desired then WEI driven AMR algorithm is more computationally efficient and accurate per degree of freedom

Neutron die-away experiment for remote analysis of the surface of the moon and the planets, phase 3

Continuing work on the two die-away measurements proposed to be made in the combined pulsed neutron experiment (CPNE) for analysis of lunar and planetary surfaces is described. This report documents research done during Phase 3. A general exposition of data analysis by the least-squares method and the related problem of the prediction of variance is given. A data analysis procedure for epithermal die-away data has been formulated. In order to facilitate the analysis, the number of independent material variables has been reduced to two: the hydrogen density and an effective oxygen density, the latter being determined uniquely from the nonhydrogeneous elemental composition. Justification for this reduction in the number of variables is based on a set of 27 new theoretical calculations. Work is described related to experimental calibration of the epithermal die-away measurement. An interim data analysis technique based solely on theoretical calculations seems to be adequate and will be used for future CPNE field tests

Numerical analysis of a spherical harmonic discontinuous Galerkin method for scaled radiative transfer equations with isotropic scattering

In highly diffusion regimes when the mean free path $\varepsilon$ tends to zero, the radiative transfer equation has an asymptotic behavior which is governed by a diffusion equation and the corresponding boundary condition. Generally, a numerical scheme for solving this problem has the truncation error containing an $\varepsilon^{-1}$ contribution, that leads to a nonuniform convergence for small $\varepsilon$. Such phenomenons require high resolutions of discretizations, which degrades the performance of the numerical scheme in the diffusion limit. In this paper, we first provide a--priori estimates for the scaled spherical harmonic ($P_N$) radiative transfer equation. Then we present an error analysis for the spherical harmonic discontinuous Galerkin (DG) method of the scaled radiative transfer equation showing that, under some mild assumptions, its solutions converge uniformly in $\varepsilon$ to the solution of the scaled radiative transfer equation. We further present an optimal convergence result for the DG method with the upwind flux on Cartesian grids. Error estimates of $\left(1+\mathcal{O}(\varepsilon)\right)h^{k+1}$ (where $h$ is the maximum element length) are obtained when tensor product polynomials of degree at most $k$ are used

Self-adaptive isogeometric spatial discretisations of the first and second-order forms of the neutron transport equation with dual-weighted residual error measures and diffusion acceleration

As implemented in a new modern-Fortran code, NURBS-based isogeometric analysis (IGA) spatial discretisations and self-adaptive mesh refinement (AMR) algorithms are developed in the application to the first-order and second-order forms of the neutron transport equation (NTE). These AMR algorithms are shown to be computationally efficient and numerically accurate when compared to standard approaches. IGA methods are very competitive and offer certain unique advantages over standard finite element methods (FEM), not least of all because the numerical analysis is performed over an exact representation of the underlying geometry, which is generally available in some computer-aided design (CAD) software description. Furthermore, mesh refinement can be performed within the analysis program at run-time, without the need to revisit any ancillary mesh generator. Two error measures are described for the IGA-based AMR algorithms, both of which can be employed in conjunction with energy-dependent meshes. The first heuristically minimises any local contributions to the global discretisation error, as per some appropriate user-prescribed norm. The second employs duality arguments to minimise important local contributions to the error as measured in some quantity of interest; this is commonly known as a dual-weighted residual (DWR) error measure and it demands the solution to both the forward (primal) and the adjoint (dual) NTE. Finally, convergent and stable diffusion acceleration and generalised minimal residual (GMRes) algorithms, compatible with the aforementioned AMR algorithms, are introduced to accelerate the convergence of the within-group self-scattering sources for scattering-dominated problems for the first and second-order forms of the NTE. A variety of verification benchmark problems are analysed to demonstrate the computational performance and efficiency of these acceleration techniques.Open Acces