Theory¶
The Boltzmann equation¶
Particle transport phenomena enjoy rich academic research value and application prospects. A many-particle system can exhibit different behaviors at characteristic different scales. Down to the finest scale of a many-particle system, Newton’s second law depicts particle motions via
which leads
An intuitive numerical solution algorithm is to simulate interactions and track the trajectories of a system of particles. A typical example is the molecular dynamics (MD) method. This is however very computationally expensive since there are more than \(2\times 10^{25}\) molecules per cubic meter in normal atmosphere, and things get extremely complicated if the N-body interactions need to be constantly counted.
Different simplifications have been developed to accelerate numerical computations. As an example, the Monte Carlo method employs certain particle models and conducts the interactions in a stochastic manner. This significantly reduces the computational cost, while the trade-off are artificial fluctuations. Still, many particle realizations have to be simulated successively to average the solutions and reduce the statistical error.
An alternative strategy is derived from ensemble averaging, where the coarse-grained modeling is used to provide a bottom-up view. At the mean free path and collision time scale of particles. Such dynamics can be described using kinetic theory. The Boltzmann equation can be formulated via an operator splitting approach, i.e.
where the left and right hand sides model particle transports and collisions correspondingly. The distribution function \(f\) is the probability of finding a particle with a certain location, and \(\{v, v_*\}\) denotes the velocities of two classes of colliding particles. The collision kernel \(k\) models the strength of collisions at different velocities.
Different collision models can be inserted into the Boltzmann equation.
In the KiT-RT solver, we are interested in the linear Boltzmann equation, where the particles don’t interact with one another, only with the background material. Therefore, the Boltzmann equation can be simplified to a linear equation with respect to \(f\)
For convenience, it is often reformulated with polar coordinates \(\{r, \phi, \theta \}\),
The particle distribution \(\psi(r, \Omega, E, t)\) here is often called angular flux, \(\{\Sigma_s, \Sigma_t \}\) are the differential and total scattering cross sections correspondingly, and \(Q\) denotes a source term.
The continuous slowing down approximation¶
In radiation therapy, the main goal is to compute the radiation dose for a pre-defined set-up accurately. The dose is defined as
Here, \(E\in\mathbb{R}_+\) is the energy, \(\mathbf{x}\in \mathbf{X}\subset\mathbb{R}^3\) denotes the spatial domain, and \(\mathbf{\Omega}\in\mathbb{S}^2\) is the flight direction of particles. Moreover, \(\psi:\mathbb{R}_+\times\mathbb{R}^3\times\mathbb{S}^2\rightarrow\mathbb{R}\) denotes the radiation flux density and \(\rho:\mathbb{R}^3\rightarrow\mathbb{R}\) is the patient tissue density. The stopping power \(S:\mathbb{R}_+\times\mathbb{R}^3 \rightarrow \mathbb{R}\) models the continuous energy loss of particles due to scattering with tissue and is defined as
with the scattering cross section \(\Sigma:\mathbb{R}_+\times \mathbb{R}_+\times \mathbb{R}^3\times[-1,1]\rightarrow \mathbb{R}\). The radiation flux density, which describes the probability of finding a particle at a certain region in phase space, can be computed from the continuous slowing down (CSD) approximation of the energy dependent linear Boltzmann equation
Here \(E\in\mathbb{R}_+\) is energy, \(x\in D\subset \mathbb{R}^3\) is the spatial domain and \(\Omega\in\mathbb{S}^2\) is the direction of travel. This model assumes a continuous energy loss of particles traveling through a background material, which is modeled using the stopping power \(S\). The scattering cross section \(\Sigma_s(E,\mathbf x,\mathbf \Omega\cdot\mathbf \Omega')\) denotes the probability of particles at position \(\mathbf x\) with energy \(E\) changing their flight direction from \(\mathbf \Omega'\) to \(\mathbf\Omega\) due to a collision with the patient tissue. The total cross section \(\Sigma_t\) is given by
Let us assume there are no absorption effects, and thus the total cross section is given by
To simplify the evaluation of material properties, we follow the common assumption that all materials are water-equivalent and differ only in density, i.e.,
Leaving out the superscript \(H_2O\), the CSD equation can be simplified as
Now, we bring this system in a form which resembles the standard Boltzmann equation. Multiplying (1) with \(S(E)\) gives
Then, we substitute
into (2), which yields
Now, to get rid of the stopping power in front of the energy derivative, we make use of the transformation
Now let us change to
In this case, the energy derivative becomes
And by rearranging the terms, we finally get
since \(S(E(\widetilde E))\) is nonzero. Therefore, substituting \(\widetilde E\) in (3) gives
Here, we define \(\widetilde\Sigma_{t}(\widetilde E):=\Sigma_t(E(\widetilde E))\) and \(\widetilde\Sigma_{s}(\widetilde E,\Omega\cdot\Omega'):=\Sigma_s(E(\widetilde E),\Omega\cdot\Omega')\). Finally, to obtain a positive sign in front of the energy derivative, we transform to
Then, with \(\bar{\psi}(\bar{E},x,\Omega):=\widetilde{\widehat{\psi}}(\widetilde{E}(\bar{E}),x,\Omega)\), \(\bar\Sigma_{t}(\bar E):=\widetilde{\Sigma}_t(\widetilde{E}(\bar{E}))\) as well as \(\bar\Sigma_{s}(\bar E,\Omega\cdot\Omega'):=\widetilde{\Sigma}_s(\widetilde{E}(\bar{E}),\Omega\cdot\Omega')\) equation (3) becomes
Dropping the bar notation and treating \(\bar E\) as a pseudo-time \(t\) gives a slightly modified version of the Boltzmann equation
We are interested in computing the dose, which (when again using the original energy \(E\) and angular flux \(\psi\)) reads
So let us check how we can compute the dose from our solution \(\bar \psi(\bar E,x,\Omega)\). For this, let us substitute
We have
which gives
Macroscopic Models¶
This section discusses macroscopic models to (7). These models are derived from nodal and modal discretizations of the directional domain.
Modal discretizations¶
Modal discretizations of (7) can be interpreted as a closure problem [Levermore1996Moment] , [Levermore1996Entropy]. To present the derivation of different closures, we first formulate the moment equations which are not closed. Second, we close these equations with the \(P_N\) closure and third, we derive the \(M_N\) closure.
Moment equations¶
Let us derive an evolution equation to describe the moments of the radiation flux with respect to the real-valued spherical harmonics basis functions. These are defined as the real parts of the spherical harmonics
where \(P_{\ell}^k\) are the associated Legendre polynomials. Then, the real spherical harmonics are given as
where \(i\) is the imaginary unit. Collecting all basis functions up to degree \(N\) in a vector
yields the so-called moments
Evolution equations for the moments can be derived by testing (7) against \(\mathbf{m}_{\ell} = (m_{\ell}^{-\ell},\cdots,m_{\ell}^{\ell})\), which gives
To rewrite this equation, we use the spherical harmonics recursion relation
as well as the fact that there exists a diagonal matrix \(\boldsymbol{\Sigma}_{\ell}(t)\) with entries \(\Sigma_{\ell,kk} = \Sigma_{\ell}^k := 2\pi\int_{[-1,1]}P_{\ell}(\mu)\Sigma_s(t,\mu)\mathrm{d}\mu\) such that
Then, the moment equations at degree \(\ell\) become
Note that the equations for degree \(\ell\) depend on the moments of degree \(\ell+1\). Hence, to obtain a closed system of moments up to a fixed degree \(N\), we need to define a closure relation
\(P_N\) closure¶
The most commonly used closure is the \(P_N\) closure which leads to the spherical harmonics (\(P_N\)) method [Case1967linear]. It expands the solution by spherical harmonics, i.e.,
where \(\mathbf{u}\in\mathbb{R}^{(N+1)^2}\) collects all moments according to \(\mathbf u = \left(u_0^0, u_1^{-1}, u_1^{0}, u_1^{1},\cdots, u_N^{N}\right)^T\in\mathbb{R}^{(N+1)^2}\). Hence, the \(P_N\) closure is simply given as \(\mathcal{U}_{\mathrm{P}_N}\equiv \mathbf 0\). In this case, the moment equations read
where \(\mathbf A\cdot\nabla_{\mathbf{x}} := \mathbf A_1\partial_{x} + \mathbf A_2\partial_y+ \mathbf A_3\partial_z\) with \(\mathbf A_i := \int_{\mathbb{S}^2}\mathbf m\mathbf m^T \Omega_i \mathrm{d} \mathbf{\Omega}\) and \(\boldsymbol \Sigma = \mathrm{diag}\left(\Sigma_0^0, \Sigma_1^{-1}, \Sigma_1^{0}, \Sigma_1^{1},\cdots, \Sigma_N^{N}\right)\). While \(P_N\) is a computationally efficient method (especially for scattering terms), it does not preserve positivity of the radiation flux approximation and can lead to spurious oscillations. A closure which mitigates oscillations and preserves positivity at significantly increased computational costs is the \(M_N\) closure.
\(M_N\) closure¶
The \(M_N\) closure [Levermore1996Moment] , [Levermore1996Entropy] employs the principle of minimal mathematical, i.e., maximal physical entropy to close the moment system. To this end, we define the twice differentiable, strictly convex kinetic entropy density \(\eta:\mathbb{R}_+\rightarrow\mathbb{R}\). Different, problem specific entropy densities can be defined, e.g. the Maxwell-Boltzmann entropy \(\eta(g)=g\log(g)-g\), or a quadratic entropy \(\eta(g)=g^2\), which recovers the \(P_N\) method. Thus, one can close the system by choosing the reconstructed radiation flux density \(\psi_{\mathbf u}\) out of the set of all possible functions
that fulfill the moment condition \(\mathbf u(t,\mathbf{x})=\left<\mathbf m g\right>\) as the one with minimal entropy. The modal basis \(\mathbf m\) can be chosen arbitrarily. Common choices consist of spherical harmonics or other polynomial basis functions. The minimal entropy closure can be formulated as a constrained optimization problem for a given vector of moments \(\mathbf u\),
The minimal value of the objective function is denoted by \(h(u)=\left<\eta(\psi_{\mathbf u})\right>\) and describes the systems minimal entropy depending on time and space. \(\psi_{\mathbf u}\) is the minimizer of (8), which we use to close the moment system
The minimal entropy method preserves important properties of the underlying equation [Alldredge2018regularized] , [Levermore1996Moment] , i.e., positivity of the solution, hyperbolicity of the moment system, dissipation of mathematical entropy and the H-Theorem. The minimal entropy closed moment system is invariant under Galilean transforms. Lastly, if collision invariants of the Boltzmann equations are used as modal basis functions, then the moment system yields a local conservation law.
The set of all moments corresponding to a radiation flux density \(\psi_{\mathbf u}>0\) is called the realizable set
Outside \(\mathcal{R}\) the minimal entropy closure problem has no solution. At the boundary \(\partial \mathcal{R}\), the optimization problem becomes singular and \(\psi_{\mathbf u}\) consists of a linear combination of dirac distributions. Near \(\partial \mathcal{R}\) the entropy closure becomes ill conditioned and thus, a numerical optimizer requires a large amount of iterations to compute a solution.
To mitigate this issue, a regularized version of the entropy closure problem has been proposed by [Alldredge2018regularized] ,
where \(\gamma\) is the regularization parameter. Generally, moments of the regularized reconstructed radiation flux density \(\int_{\mathbb{S}^2}\mathbf m\psi_{\mathbf u}\mathrm{d} \mathbf{\Omega}\) deviate from the non-regularized moments. For \(\gamma\rightarrow 0\), we recover the original entropy closure of (8) and the moments coincide again. The regularized entropy closure is solvable for any \(\mathbf u\in\mathbb{R}^{(N+1)^2}\) and preserves all structural properties of the non-regularized entropy closure [Alldredge2018regularized]. One can also choose to regularize only parts of the entropy closure, e.g. to preserve moments of specific interest. Then the partially regularized entropy closure reads
where \(\mathbf u^{nr}\) denotes non-regularized moment elements and \(\mathbf u^{r}\) denotes regularized elements of the moment vector.
Recently, structure preserving deep neural networks have been successfully employed to approximate the entropy closure [Schotthoefer2021structurepreserving] to accelerate the \(M_N\) method. The authors leverage convexity of the optimization problem and use corresponding input convex neural networks [AmosICNN] to preserve structural properties of the closure in the neural network based approximation.
Nodal discretizations¶
The \(S_N\) method [Lewis1984computational] employs a nodal discretization for the directional domain. To facilitate the computation of integral terms that arise due to scattering, the nodal point sets are commonly chosen according to a quadrature rule.
In the application case of radiative transport, the directional domain is assumed to be the unit sphere \(\mathbb{S}^2\subset\mathbb{R}^3\), thus a suitable parametrization is given by spherical coordinates
Note, that we can allow different particle velocities by scaling the unit sphere with a given maximum velocity. The implementation assumes a slab geometry setting, i.e., lower dimensional velocity spaces are described by a projection of \(\mathbb{S}^2\) onto \(\mathbb{R}^2\) and \(\mathbb{R}\), respectively. Thus, the parametrization of the two-dimensional slab geometry is given by
and the one dimensional case is described by
Hence the task is to derive a quadrature formula for the direction of travel. The perhaps most common approach is the product quadrature rule. Here, a Gauss quadrature is used for \(\mu\) and equally weighted and spaced points for \(\varphi\), i.e., when using \(N_q\) points, we have
If the Gauss quadrature for \(\mu\) uses \(N_q\) points, then we obtain a total of \(Q = N_q^2\) possible directions. Denoting the Gauss weights as \(w^G_k\) with \(k = 1,\cdots,N_q\), we obtain the product quadrature weights
and points
Other implemented quadrature methods include spherical Monte Carlo, Levelsymmetric [Longoni2004PhDT], LEBEDEV [Lebedev1986numerical] and LDFESA [Jarrel2011discrete] . A comparison of different quadrature sets and their approximation behaviour for \(S_N\) methods can be found in [Camminady2021highly].
The evolution equations for \(\psi_q(t,\mathbf x):= \psi(t,\mathbf x,\mathbf \Omega_q)\) are then given by
A main disadvantage of \(S_N\) methods are so called ray-effects [Lathrop1968ray] , [Morel2003analysis] , [Mathews1999propagation] , which are spurious artifacts that stem from the limited number of directions in which particles can travel. Moreover, radiation therapy applications exhibit forward-peaked scattering, which cannot be well-captured by classical quadrature rules.
To allow for moderate computational costs when computing scattering terms and to efficiently treat forward-peaked scattering, we transform the nodal solution to a modal description and apply the more efficient \(P_N\) methodology for scattering terms. For this, we define a truncation order \(N\) and construct the matrices \(\mathbf{O}\in\mathbb{R}^{Q \times (N+1)^2}\) which maps the modal onto its nodal representation and \(\mathbf{M}\in\mathbb{R}^{(N+1)^2\times Q}\) which maps the nodal onto its modal representation. Such matrices can be constructed by
In this case, we can replace the scattering term on the right-hand side of (12) by its \(P_N\) counterpart. Collecting the nodal solution in the vector \(\boldsymbol{\psi}\) then gives
References¶
Graham W. Alldredge, Martin Frank, and Cory D. Hauck. 2018. A regularized entropy-based moment method for kinetic equations. arXiv:1804.05447 [math.NA]
Brandon Amos, Lei Xu, and J. Zico Kolter. 2016. Input Convex Neural Networks. CoRR abs/1609.07152 (2016). arXiv:1609.07152 http://arxiv.org/abs/1609.07152
Thomas Camminady, Martin Frank, and Jonas Kusch. 2021. Highly uniform quadrature sets for the discrete ordinates method. Nuclear Science and Engineering (2021).
Kenneth M Case and Paul Frederick Zweifel. 1967. Linear transport theory. (1967)
J.J. Jarrel and M.L. Adams. 2011. Discrete-ordinates quadrature sets based on linear discontinuous finite elements. Proc. International Conference on Mathematics and Computational Methods applied to Nuclear Science and Engineering (2011)
Kaye D Lathrop. 1968. Ray effects in discrete ordinates equations. Nuclear Science and Engineering 32, 3 (1968), 357–369.
G Marchuk and V I Lebedev. 1986. Numerical methods in the theory of neutron transport. (1986). https://www.osti.gov/biblio/7057084
Levermore. 1996. Moment closure hierarchies for kinetic theories. Journal of Statistical Physics 83 (1996), 1021–1065.
David Levermore. 1997. Entropy-based moment closures for kinetic equations. Transport Theory and Statistical Physics 26, 4-5 (1997), 591–606
Elmer Eugene Lewis and Warren F Miller. 1984. Computational methods of neutron transport. (1984).
Gianluca Longoni. 2004. Advanced quadrature sets and acceleration and preconditioning techniques for the discrete ordinates method in parallel computing environments. Ph. D. Dissertation. University of Florida.
Kirk A Mathews. 1999. On the propagation of rays in discrete ordinates. Nuclear science and engineering 132, 2 (1999), 155–180.
JE Morel, TA Wareing, RB Lowrie, and DK Parsons. 2003. Analysis of ray-effect mitigation techniques. Nuclear science and engineering 144, 1 (2003), 1–22.
Steffen Schotthöfer, Tianbai Xiao, Martin Frank, and Cory D. Hauck. 2022. Neural network-based, structure-preserving entropy closures for the Boltzmann moment system. https://doi.org/10.48550/ARXIV.2201.10364