A Multigroup Moment-Accelerated Deterministic Particle Solver for Time-dependent Thermal Radiative Transfer Problems
H. Park, L. Chacon, A. Matsekh, G. Chen

TL;DR
This paper introduces a novel Lagrangian particle-based solver for time-dependent thermal radiative transfer that combines advantages of particle and deterministic methods, enabling accurate results with large time steps.
Contribution
It presents a new characteristic-based transport algorithm within a moment-accelerated framework, improving efficiency and robustness for TRT simulations.
Findings
Achieves accurate results with fewer particles and larger time steps.
Combines benefits of particle and grid-based methods.
Handles stiff absorption and reemission self-consistently.
Abstract
We propose an efficient, robust, Lagrangian (characteristic-based) transport solver for the time-dependent thermal radiative Transfer (TRT) applications within the context of a moment-accelerated (High-Order/Low-Order, HOLO) algorithm. This novel transport algorithm inherits the best features of both particle methods (e.g., time accuracy, phase-space adaptivity, positivity) and deterministic, grid-based methods (e.g., no stochastic noise). Particles are evolved by the method of characteristics, with a time-dependent weight that accounts for stiff absorption and reemission process self-consistently. As a result, this approach is able to obtain accurate results while employing large time steps and a moderate number of particles (compared to Implicit Monte Carlo).
Click any figure to enlarge with its caption.
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Figure 11
Figure 12
Figure 13
Figure 14
Figure 15
Figure 16
Figure 17
Figure 18
Figure 19| Problem 1 | Problem 2 | |
| (Thick) | (Thin) | |
| [cm] | 0.25 | 2.0 |
| [s] | ||
| [g/] | 1.0 | 1.0 |
| [erg/g-eV] | ||
| [eV] | 1000 | 150 |
| [eV] | 0.025 | 0.025 |
| [/g] | ||
| [cm] | 0.005 | 0.025 |
| # of particles | LO CPU time [s] | HO CPU time [s] |
|---|---|---|
| 8 | 7.1 (65.6) | 3.7 (34.4) |
| 16 | 7.1 (48.9) | 7.4 (51.1) |
| 32 | 7.2 (32.6) | 14.9 (67.4) |
| 64 | 7.2 (19.4) | 29.7 (80.6) |
| 128 | 7.2 (10.8) | 59.5 (89.2) |
| 512 | 7.3 (2.9) | 241.3 (97.1) |
| 2048 | 7.4 (0.7) | 858.3 (99.3) |
| # of particles | LO CPU time [s] | HO CPU time [s] |
|---|---|---|
| 8 | 10.5 (76.4) | 3.3 (23.6) |
| 16 | 10.5 (59.7) | 7.1 (40.3) |
| 32 | 10.7 (45.3) | 12.9 (54.7) |
| 128 | 10.5 (17.0) | 51.4 (83.0) |
| 512 | 10.7 (4.9) | 206.5 (85.1) |
| 2048 | 10.8 (1.3) | 850.2 (98.7) |
| [cm] | 10.0 |
|---|---|
| [s] | |
| [g/] | 1.0 |
| [erg/g-eV] | |
| [eV] | 1000 |
| [eV] | 10.0 |
| [/g] |
| # of particles | LO CPU time [s] | HO CPU time [s] |
|---|---|---|
| 8 | 5.7 (54.6) | 4.7 (45.4) |
| 16 | 5.7 (41.5) | 8.0 (58.5) |
| 32 | 5.8 (28.6) | 14.4 (71.4) |
| 128 | 6.0 (10.0) | 55.4 (90.0) |
| 512 | 6.0 (2.7) | 217.8 (97.3) |
| 2048 | 6.1 (0.7) | 867.8 (99.3) |
| NG | IMC | DP total | DP HO | DP LO |
|---|---|---|---|---|
| 4 | 3.4 | 1.3 | 1.8 | 1.1 |
| 8 | 6.9 | 1.5 | 2.9 | 1.1 |
| 16 | 13.9 | 2.1 | 5.2 | 1.1 |
| 32 | 27.5 | 3.1 | 9.7 | 1.1 |
| 64 | 54.6 | 5.2 | 18.5 | 1.1 |
| NG | IMC | DP total | DP HO | DP LO |
|---|---|---|---|---|
| 4 | 61.2 | 1.2 | 1.9 | 1.0 |
| 8 | 58.4 | 1.8 | 3.5 | 1.3 |
| 16 | 89.1 | 2.1 | 5.4 | 1.2 |
| 32 | 167.5 | 3.2 | 10.0 | 1.4 |
| 64 | 338.4 | 5.4 | 19.0 | 1.7 |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
A Multigroup Moment-Accelerated Deterministic Particle Solver for Time-dependent Thermal Radiative Transfer Problems
H. Park
Fluid Dynamics and Solid Mechanics Group(T-3)
Los Alamos National Laboratory
Los Alamos, NM 87545
L. Chacón
Applied Mathematics and Plasma Physics group (T-5)
Los Alamos National Laboratory
Los Alamos, NM 87545
A. Matsekh
G. Chen
Abstract
We propose an efficient, robust, Lagrangian (characteristic-based) transport solver for the time-dependent thermal radiative Transfer (TRT) applications within the context of a moment-accelerated (High-Order/Low-Order, HOLO) algorithm. This novel transport algorithm inherits the best features of both particle methods (e.g., time accuracy, phase-space adaptivity, positivity) and deterministic, grid-based methods (e.g., no stochastic noise). Particles are evolved by the method of characteristics, with a time-dependent weight that accounts for stiff absorption and reemission process self-consistently. As a result, this approach is able to obtain accurate results while employing large time steps and a moderate number of particles (compared to Implicit Monte Carlo).
keywords:
thermal radiative transfer, Space-Time Characteristics, moment-based acceleration
1 Introduction/motivation
Modeling of high-energy density physics phenomena has important applications in astrophysics and inertial confinement fusion [5]. In these applications, thermal X-ray radiation becomes the dominant energy transfer mechanism. Radiative transfer is difficult to model due to the stiff nonlinear interactions between radiation and the host material, which can be described by absorption-reemission physics. Thermal radiative transfer (TRT) without physical scattering can be described by the following equations,
[TABLE]
where is the specific intensity of radiation at location , traveling along direction , with speed and frequency at time , and is the (gray) radiation energy density. Here, and are the opacity, density and specific heat of host media, and is the Planck function for black body radiation at frequency and material temperature ,
[TABLE]
The TRT system is difficult to solve numerically due to its large dimensionality and stiff nonlinear coupling between radiation and material through absorption and reemission. Over the last several decades, the development of efficient numerical algorithms has been an active area of research.
A popular mitigation strategy for the stiff nonlinear coupling is linearization of the absorption-reemission physics, such as the Fleck-Cummings linearization in the Implicit Monte Carlo (IMC) method [12]. Another popular discretization is the discrete ordinate () method. The advantage of over IMC is that it is able to obtain the asymptotic diffusion limit [18, 20] in a relatively straightforward manner [2, 1].
Another class of discretization techniques, which has gained popularity in recent years, is the method of characteristics (MOC) [11, 3, 15]. MOC solves the transport equation analytically along the particle trajectory (characteristics). MOC is widely used for solving the neutron transport equation, and it is especially effective when accelerated by the coarse-mesh finite-difference (CMFD) method [27]. A similar concept is employed in the MULTI2D radiation-hydrodynamics code [26]. However, the MULTI2D utilizes the ”short” characteristic method, which averages the angular intensity at each surface of the mesh. Recently, an asymptotic preserving, short characteristic method was proposed [28, 29]. The so-called asymptotic preserving unified gas kinetics scheme (AP-UGKS) utilizes nonlinear elimination and the integral form of the transport equation, enabling a time-implicit discretization of the collisional source term without operator splitting between advection and collision. However, because their formulation assumes the cell-face averaged radiative flux being the function of the neighboring cells, the method is limited to using an explicit CFL time-step size. A space-time characteristics method for solving the neutral-particle transport equations has been proposed in Ref. [21]. In their work, the temporal variable is treated as another dimension in order to perform “” dimensional ray-tracing.
The method we propose in this paper is called ”deterministic particle”(DP) method. The term “deterministic particle” has been introduced in several previous studies [7, 22, 10, 9]. In these DP methods, the transport equation is solved via operator-splitting. The first step treats the advection (streaming) term analytically via the particle equation of the motion, and subsequently the collision physics are solved. Thus, it introduces operator-splitting error.
Our approach is similar to AP-UGKS and the space-time characteristics method in that it avoids operator splitting and analytically integrates temporal evolution of particle weights. However, our approach combines the DP method with a High-Order, Low-Order (HOLO) algorithm [24, 6] and the formulation is particularly suitable for multifrequency TRT problems. A well-informed reemission source is obtained from the discretely-consistent gray LO system. Because of the presence of the consistent, nonlinear LO system, the contribution from the collision physics (e.g., absorption-reemission) can be analytically integrated without imposing an explicit time-step constraint. The combination of the HOLO algorithm and the DP method makes the overall solution algorithm very efficient.
The rest of this paper is organized as follows. We first show the particle representation of the gray TRT equation in Section 2. Then, our overall TRT solution strategy, based on the HOLO method, is presented. In Section 3, we extend our DP algorithm to the multifrequency problem. Section 4 shows the overall solution algorithm for the developed DP-HOLO method, and highlights the similarities and differences between IMC and MOC. In Section 5, we demonstrate the efficacy of the DP algorithm, and we summarize our findings and future work in Section 6.
2 Methods/Algorithm
For simplicity, we begin with the 1D gray absorption-reemission TRT model,
[TABLE]
We will consider an extension to a frequency-dependent system in the next section. In particle-based methods (e.g., Monte Carlo) the distribution function (i.e., specific angular intensity, ) is represented as a collection of particles with weight as follows,
[TABLE]
where are the spatial position and direction of the particle at time , respectively. The evolution equation for the particle weight, , can be obtained by multiplying Eq. (4) by and integrating over phase space to find:
[TABLE]
where, . The formal solution for along the characteristics is,
[TABLE]
Note that the particle weight is always positive because the integrand in Eq. (8) is always non-negative. Due to the absence of an acceleration term in Eq. (4), the particle trajectory can be simply expressed as,
[TABLE]
The integral of Eq. (8) can be evaluated analytically when the source is reconstructed with polynomials, as will be the case here. In the following subsections, we describe implementation and algorithmic details of the DP-HOLO method.
2.1 HOLO solution strategy
In order to perform the integral in the particle-weight evolution equation, Eq. (8), the reemission source term must be known a priori. For this, we employ a similar approach to the CMFD-accelerated MOC algorithm for nuclear reactor eigenvalue calculations, but, instead of using CMFD, we use a recently developed, High-Order, Low-Order (HOLO) algorithm [24, 23, 6]. The HOLO algorithm is an iterative, moment accelerated scheme, with the LO system defined by taking the first two moments of Eq. (4) together with the material temperature equation,
[TABLE]
Here, is the (gray) radiative flux. Note that we have used the standard closure in Eq. (12) instead of the more consistent Eddington factor closure [13]. Solving Eqs. (11) and (12) introduces inconsistencies between HO and LO descriptions, not only at the discrete level, but also in the continuum. Consistency between the HO and the LO system can be regained by adding a consistency term [24] that takes into account the mismatch in truncation errors and the transport effects. Note that there will be no consistency term in Eq. (11) because, as we will show, this equation is satisfied automatically in both HO and LO systems.
2.1.1 Discrete representation of the LO system and HOLO consistency
In the following, we describe how the LO system is discretized consistently with the HO system. We begin with Eq. (11), which is written discretely as,
[TABLE]
where is the material temperature at cell , , , and,
[TABLE]
These quantities are tallied from particles during the HO step as described below. Discrete consistency between LO and HO system demands that they have the same local energy balance, Eq. (14). Because the (time-discrete) LO system cannot solve for both and simultaneously, in order for the LO system to be consistent with the temporal integration of the HO system we rearrange Eq. (14) as:
[TABLE]
where is the residual source term [8].
Next, we propose the following closure equations for partial radiative fluxes at faces [Eq. (12)]:
[TABLE]
with
[TABLE]
which are also evaluated from particles. Here, we have introduced the consistency term, , such that the moments of the HO solution always satisfy Eqs. (19) and (20). Subtracting Eq. (20) from Eq. (19) yields,
[TABLE]
Eq. (24) is the discrete LO closure equation. Finally, the discrete LO system for cell consists of the following set of equations.
[TABLE]
Discrete consistency can be simply realized because the HO moments satisfy linear Eqs. (18) and (24), given and . Thus, upon the convergence of and , and assuming consistency at the previous time-step, there is a unique solution which satisfies Eqs. (18) and (24) simultaneously. Furthermore, it is also the only solution which satisfies Eqns. (25)-(28).
2.1.2 Energy conservation property
After the nonlinear convergence between the HO and LO systems, summing Eqs. (25) and (28) gives the following local energy conservation,
[TABLE]
Because we use a single value for the face radiative flux, , our HOLO scheme is conservative. The overall DP-HOLO algorithm is summarized in Sec. 4.
2.2 Tallying
Eq. (14) requires evaluation of three moments, and , during a DP-HO step. Using the specific angular intensity definition of Eq. (6), the end-of-time step radiation energy density for cell , , can be evaluated from particles as,
[TABLE]
which is merely the sum of the particle weights located in the cell at the end of the time step. We note that this interpolation strategy of the particle weight to the mesh corresponds to a “top-hat” function of width equal to the cell size, and is formally first order accurate [4]. The time-averaged radiation energy density at cell is defined as,
[TABLE]
The above term is computed during the DP step as follows. First, within a time step, , we partition the tallying step for each spatial cell, where the material properties are assumed to be constant. Without loss of generality, when a particle passes through the cell during interval , the deposited particle weight in cell due to particle is given by,
[TABLE]
Eq. (33) is a more convenient tally choice because it directly represents absorbed energy. In addition, Eq. (33) is required for evaluating energy-weighted opacities (see Sec. 3). We consider next the cases where the reemission source is either constant or linear in , for which the source integral in Eq. (33) can be performed analytically. For a constant source, the particle weight at time can be expressed as,
[TABLE]
where is the average reemission source in cell . Note that for IMC with “continuous energy deposition” [12], the particle weight evolves with only the first term in Eq. (34). Consequently, the particle weight quickly vanishes in optically-thick cells, and surface radiative flux tallies become noisy [8]. On the other hand, it is easy to see that the particle weight for the DP method approaches in optically-thick regions, which is the correct equilibrium limit and thus results in accurate surface radiative flux tallies.
Next, multiplying Eq. (34) by and integrating over the time interval yields an explicit expression for the deposited particle weight,
[TABLE]
where , and . The first term in Eq. (35) corresponds to the deposition of the original particle weight. The second term corresponds to the weight gain due to the reemission source, and the third term corresponds to deposition of the reemission source along the particle trajectory.
For a (spatially) linear reemission source within a cell (the one employed here), , we may express the spatial variation of the reemission source as,
[TABLE]
Then, along the particle trajectory, , we can write the reemission source term as a linear polynomial in time,
[TABLE]
Accordingly, the particle weight at time can be written as,
[TABLE]
and the weight deposition in the cell becomes,
[TABLE]
This is the formula employed in this study, and is formally second-order accurate.
Lastly, a surface-integrated, outgoing partial radiative flux [Eq. (21)] can be estimated as:
[TABLE]
where is the effective cross-sectional area.
2.3 Boundary conditions
There are two main types of boundary conditions in radiative transfer simulations: inflow boundary (including vacuum) and reflective boundary. In our DP algorithm, when a particle escapes from the boundary at time , a new particle enters the computational domain with the following attributes,
[TABLE]
where is the inflow boundary temperature. As seen from Eq. (43), the only difference between the two boundary conditions is the new particle weight. For either boundary conditions, a new particle “reflects” back into the computational domain. In this way, the particle population remains constant unless particle re-sampling is performed.
The boundary conditions for the LO system are provided in terms of the radiative fluxes. For example, the left boundary radiative flux at can be written as,
[TABLE]
Note that . The partial radiative fluxes can be tallied while performing the HO step. Then, we employ the following form of the LO flux boundary condition at the left boundary,
[TABLE]
Similarly for the right flux boundary condition we use,
[TABLE]
2.4 Particle initialization
Particle initialization requires specification of position, angle and weight. We define initial phase-space location of each particle by uniformly dividing the number of initial particles located in cell , with tensorial product. Number of space and angular points () within the cell are input parameters. Then, a particle initial phase-space location in the cell can be expressed as,
[TABLE]
In addition, each particle has an “effective” phase space volume of . To determine weight, in this work, we assume that the initial radiation distribution is isotropic in angle, and Planckian in frequency. Then, the initial radiation energy density can be described by the temperature, as,
[TABLE]
Using Eq. (6) and the definition of the cell-averaged radiation energy density yields,
[TABLE]
Then, the initial particle weight in the cell becomes,
[TABLE]
where is the number of particles in cell .
3 Multigroup Extension
Extending the DP algorithm for frequency-dependent problems is straightforward with a multifrequency approximation, in which the group-wise distribution function, , is an integral value over the frequency range ,
[TABLE]
With this definition, we can rewrite the TRT equation as,
[TABLE]
where is the normalized Planck function for group . Following a similar procedure as in the previous section, we can write the particle weight evolution equation per frequency group as,
[TABLE]
We emphasize here that there is a significant advantage of the DP method vs IMC for multifrequency problems in that the particle trajectory equations, Eqs. (9) and (10), are independent of frequency and thus all frequency weights can be integrated simultaneously. Thus, we can provide phase space resolution with the same number of particles regardless of the number of frequency groups. Although each particle carries additional information, e.g., all group-wise particle weights, , we can reuse the ray-tracing evaluations for all frequency groups and thus significantly reduce computational effort. This will be demonstrated numerically in Sec. 5.
The gray LO system becomes,
[TABLE]
where the gray opacities are computed as:
[TABLE]
Here, we evaluate at , but we use the current radiation energy density and Planckian spectrum for the weights.
4 Overall DP-HOLO Algorithm
Algorithm 1 shows our multigroup DP-HOLO iterative scheme. In this work, we employ a predictor-corrector time-stepping [25]. In our current implementation of the DP-HOLO algorithm, the total number of particles remains constant during a simulation. Any particle that leaves the computational domain immediately reflects back into the domain with an appropriate weight. Optimization and particle-count adaptivity are left to the future work. During each time step, a particle carries the following attributes,
cell id (), 2. 2.
initial/current weight (), 3. 3.
initial/current location (), 4. 4.
initial/current direction (), 5. 5.
remaining time to the end of time step (), 6. 6.
phase space volume (),
We keep the initial particle state in order to allow HO solver restart during HOLO iterations within a time-step. Note that “initial” particle state refers to the state at the beginning of each time step, not the beginning of the simulation.
The LO system is solved iteratively via preconditioned Newton-Krylov method. We utilize the NOX solver package of Trilinos [14]. Because the detail of the LO solver is presented in [23], we only provide a brief summary in here. First, -th Newton-step can be expressed as,
[TABLE]
Here, is the nonlinear residual, evaluated by the current solution . is the Jacobian matrix. The analytical Jacobian matrix is formed at each Newton-step from Eqs. (55)-(58), and solved via a multigrid preconditioned GMRES solver to the relative tolerance of . Nonlinear elimination [16, 30] of the material temperature and the radiative flux variables is employed in order to solve the LO system efficiently. Nonlinear elimination is relatively straight forward to implement in the TRT system due to absence of spatial coupling in the nonlinear term (absorption-reemission). The resulting Jacobian matrix for the radiation energy density resembles the Fleck-Cummings linearized equation [12]. We use the nonlinear (relative) tolerance of for checking convergence of the Newton iterations. The computational cost for solving the LO system is essentially independent of the number of particles and time-step size, but depends on the number of the spatial cells. The LO solver typically requires less than 5 Newton iterations and less than 5 GMRES iterations per Newton iteration to converge.
4.1 Algorithm comparison with IMC and MOC
In this subsection, we highlight algorithmic similarities and differences of the DP-HOLO from IMC and MOC. First, all three are particle-based methods, and thus time-integration along particle trajectories can be performed analytically, unlike other grid-based methods such as .
The first difference between IMC and DP-HOLO is the use of random numbers. As stated previously, our DP-HOLO algorithm does not employ random numbers. In DP-HOLO, each particle is deterministically generated at , and it follows a straight trajectory until the end of simulation (or reflects back when the particle reaches the boundary). On the other hand, IMC particles are generated at each time step, based on the volumetric and boundary source terms. The phase-space location of the source particles is randomly sampled. In contrast, source contributions in DP-HOLO are accounted for in the particle weight evolution equation.
Second, IMC linearizes the absorption-reemission term, and resulting in the following linearized TRT equation [12]:
[TABLE]
where is the Fleck factor. IMC introduces an “effective” scattering term via linearization. The particle trajectory must be resampled when the particle undergoes scattering events (in addition to sampling of distance to the scattering/absorption events). It is known that this linearization introduces an additional stability constraint for the time-step size [12, 19]. Instead, DP-HOLO solves nonlinear absorption-reemission directly via the LO system, which allows it to follow the dynamical time scale of the problem (See Sec. 5.1.1).
Lastly, the evolution equation for the IMC particle weight between two events (e.g., absorption/scattering, boundary crossing) only takes into account exponential decay of the weight (the first term of RHS of Eq. (8)). i.e.,
[TABLE]
Thus, IMC particles in optically thick (and cold) regions quickly lose their weight, possibly leading to noisy tallies of end-of-time-step radiation energy density, .
DP-HOLO is closely related to the space-time-characteristics method (MOC) [21], as both use the same space-time characteristics. However DP-HOLO is specifically designed to ensure discrete consistency and solve multigroup TRT problems. A (temporally and spatially) discretely consistent LO system is key to the successful application of the space-time characteristic method to TRT problems.
5 Numerical Examples
In order to demonstrate effectiveness of the DP-HOLO algorithm, we compare its accuracy and efficiency against the state-of-the-art Implicit Monte Carlo (IMC) method. We note that many accelerations and variance reduction algorithms, as well as novel code optimizations, exist for IMC that we have not considered in our comparisons. Nonetheless, given the several order-of-magnitude performance advantage of DP-HOLO vs. IMC, it is unlikely that such optimizations can alter the fundamental conclusion of this study. For all the results shown in this section, IMC employs a continuous energy deposition (implicit capture), a uniform particle sampling in each spatial cell, and frequency stratified sampling. For DP-HOLO, all the results are obtained with the linear reemission source reconstruction, which has second-order convergence rate. Since we use a point particle (delta-function) to represent distribution functions (formally first-order accurate) and the linear reconstruction for the reemission source (formally second-order accurate), we expect the DP-HOLO algorithm will yield convergence between and , depending on the dominant error components.
In the subsequent section, we present convergence plots of IMC and DP-HOLO. Errors are measured by comparing against their own reference solutions obtained from very large number of particles (1280 and 8192 particles per cell for IMC and DP-HOLO, respectively) while fixing the spatial and temporal discretizations. Thus, we are only measuring algorithmic convergence with respect to the number of particles used. We expect the computed error:
[TABLE]
to exhibit a proper measure of convergence rate of both IMC and DP-HOLO. Furthermore, convergence plots are presented with actual CPU time rather than the number of particles because the CPU cost per particle differs significantly between IMC and DP-HOLO, while the CPU time is almost directly proportional to the number of particles in both. Finally, we use 8 particles to discretize the angular variable for all DP-HOLO simulations.
5.1 Gray Marshak Wave
The first example we consider is a gray Marshak wave problem. In this example, we use two different sets of material parameters that correspond to optically thin and thick regions. Table 1 shows the problem definitions. In both examples, the system is initially in equilibrium, , where and are the material and radiation temperatures, respectively. An incoming radiation source is applied at . The opacity is a function of the material temperature as follows,
[TABLE]
Figs. 1-4 show the material and radiation temperature profiles computed with various particle resolutions. The value shown in the legends indicates the sampled number of particles per cell (i.e., the number of reemission source particles per cell in IMC, number of initial particles per cell in DP). Initial time step sizes are and s for Problem 1 and Problem 2, respectively. Time step sizes are increased by a factor of and until they reach the maximum time step size of s.
The host medium for problem 1 is optically thick, and the radiation and material temperatures stay in equilibrium throughout the simulation. For the optically thick case, material and radiation temperature are essentially identical. The IMC solutions [Figs. 1(a) and 2(a)] exhibit a noticeable statistical noise in all cases but the one with 1280 particles per cell. On the other hand, the DP-HOLO solutions [Figs. 1(b) and 2(b)] show no significant noise regardless of the number of particles used. Fig. 5 is an efficacy plot for this problem. We use the term “efficacy” to indicate required CPU time for a certain accuracy. As can be seen from Fig. 5, errors in material and radiation temperatures are identical, as expected. We have plotted two sets of data for DP-HOLO. The first one is error vs. HO CPU time (blue and yellow data points), and the other is error vs. total CPU time (black data points). Note that in the total CPU time for IMC and the HO solver CPU time for DP-HOLO are almost proportional to the number of particles used. Thus, it can be seen that the IMC simulations exhibit a typical convergence rate, while the convergence rate of DP-HOLO appears to be (until the error is dominated by other sources such as the temporal and spatial discretizations). For DP-HOLO, the computational cost of the LO solver is about 7 sec, which corresponds to to of the total CPU time depending on the number of particles as shown in Table 2.
Problem 2 has smaller opacity and incoming radiation temperature, and the material and radiation temperatures are decoupled and differ by about eV at the wave front. The material temperature profiles do not exhibit statistical noise (unlike problem 1) as seen from Fig. 3(a). However, the IMC radiation temperature profile still shows significant statistical noise, seen in Fig. 4(a), while DP radiation temperature solutions are free from the noise for any number of particles (Fig. 4(b)). Fig. 6 shows the efficacy plot for this problem. Similar to the previous case (Fig. 5), the IMC method converges close to , while the DP-HOLO method converges between and . Data in this figure is arranged in the same way as in Fig. 6. The computational cost of the LO solver is about 10.5 sec, which corresponds to 1.3 % to 76.4% of the total CPU time as shown in Table 3. For both optically thin and thick cases, the DP-HOLO method delivers efficacies many orders of magnitude larger than IMC.
5.1.1 Stability with large time-step
It is well known that the Fleck-Cummings linearization used in IMC can produce nonphysical material temperature solutions when the time step becomes sufficiently large [12, 19]. This unphysical phenomenon is often referred to as the “violation of the maximum principle.” When the maximum principle is violated, the material temperature becomes higher than the boundary (incoming) temperature, and stagnates the radiation wave. The only mitigation in the IMC method is to use a smaller time-step size. On the other hand, because of the nonlinearly consistent LO system, our DP-HOLO algorithm does not violate the maximum principle.
In order to demonstrate this effect, we run the gray Marshak wave problem with time steps of various sizes.
Fig. 7 shows the material temperature profile with the different time step sizes. It is clear that the IMC solution with large time step (e.g., s) exhibits unphysical temperature spikes and a slow-moving wave front. On the other hand, the DP solution is virtually indistinguishable for all time step sizes.
5.2 Larsen MG
The next example we consider is a multifrequency Marshak wave problem (a.k.a Larsen’s problem [17]). This problem consists of three regions; region 1: cm, region 2: cm, and region 3: cm. We use spatial mesh size of cm. Each region has the following frequency-dependent opacity,
[TABLE]
where is set to , , and for the regions 1, 2, and 3, respectively. The density and heat capacity are set to [g/cc] and [erg/g-eV]. The system is initially in thermal equilibrium at eV and we apply a eV Planckian surface source at x = 0.0 cm to start the transient. Each simulation was run to s with s. Frequency groups are split uniformly in the log-scale between eV and eV.
Figs. 8 and 9 show the material and radiation temperature profiles computed with various numbers of particles. Compared to the material temperature profile, the radiation temperature is quite noisy when IMC is used. No noisy solutions are observed with the DP-HOLO results. Fig. 10 shows the efficacy plot. Similarly to the previous examples, the convergence rate for the radiation temperature is approximately and between and for IMC and DP-HOLO, respectively. Finally, the computational cost of the LO solver is about 6 sec, which corresponds to 0.7 to 55 of the total CPU time as shown in Table 5.
5.3 Multigroup Efficacy
Lastly, we present the efficacy of the DP-HOLO algorithm in multifrequency problems. First we simply check the algorithmic scaling with respect to the number of groups with a problem with frequency-independent opacity. Here we use the material property of the optically thin gray Marshak wave problem presented previously (e.g., Eq. (67), ).
Fig. 11 shows the material temperature profile of the problem with different numbers of groups, which clearly indicates the solution (and hence the physics) is independent of the group structure. Table 6 shows relative CPU increase as a function of the number of groups. The relative CPU time for the IMC simulations in this problem scales linearly with the number of groups. On the other hand, it can be seen that the total CPU time of the DP-HOLO calculation with 64 groups only increases by a factor of 5.2 compared to the single-frequency group case. Furthermore, the CPU cost of the LO (gray) system is almost independent of the number of groups, and the HO CPU time increases only about a factor of 19 for 64 groups. This increase is significantly smaller than the group number increase of 64.
Next we use the Larsen’s problem configuration. Fig. 12 shows material temperature profiles for different numbers of groups at . It shows that, due to the frequency-dependent opacity, the material temperature profiles change significantly when the frequency variable is not well-resolved. (The solution has converged for 64 groups.) Similar to Table 6, Table 7 shows the relative CPU time increase as a function of groups. In this problem, IMC does not scale linearly with the number of groups. This is mostly due to the fact that a single group simulation of this problem becomes optically very thick, and the IMC particles do not travel far (very small cost per particle), which results in artificially small CPU time for the single-group case. On the other hand, the scaling of the DP-HOLO simulations is almost identical to the previous case. This indicates that the CPU cost of DP-HOLO algorithm is almost independent of the physics regimes.
6 Conclusion
We have proposed a moment-accelerated deterministic particle algorithm for multifrequency thermal radiative transfer problems. The DP-HOLO method is closely related to the method of characteristics employed in nuclear reactor calculations. Unlike Implicit Monte Carlo, the particle weight evolution takes into account the reemission source. An explicit expression of reemission source is obtained from a discretely consistent, moment-based low-order description. With numerical examples, we have demonstrated that the DP-HOLO method results in accurate material and radiation temperatures with a very small number of particles compared to IMC. Furthermore, the DP-HOLO method converges between and , as opposed to for IMC. As a result, DP-HOLO has efficacies (accuracy per unit of cost) several orders of magnitude larger than IMC. Due to the ability of the DP-HOLO particles to evolve weights for all frequencies simultaneously, the advantage of the DP method over IMC increases with multifrequency problems. Furthermore, the relative CPU time increase of DP-HOLO simulation is independent of the physics regime. Ongoing work includes an extension of the algorithm to two-dimensional problems, as well as curvilinear geometries. Future work will focus on developing a new discretization scheme for the LO system that preserves the asymptotic diffusion limit.
7 Acknowledgment
This work was performed with support of the Laboratory Directed Research and Development program at Los Alamos National Laboratory under US government contract DE-AC52-06NA25396 for Los Alamos National Laboratory, which is operated by Los Alamos National Security, LLC, for the US Department of Energy.
8 Reference
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Adams [1997] Adams, M. L., 1997. Subcell balance methods for radiative transfer on arbitrary grids. Transport Theory and Statistical Physics 26 (4-5), 385–431. URL http://dx.doi.org/10.1080/00411459708017924 · doi ↗
- 2Adams [2001] Adams, M. L., 2001. Discontinuous finite element transport solutions in thick diffusive problems. Nuclear Science and Engineering 137 (3), 298–333. URL http://www.tandfonline.com/doi/abs/10.13182/NSE 00-41
- 3Askew [1972] Askew, J., 1972. A Characteristics Formulation of the Neutron Transport Equation in Complicated Geometries. AEEW-M. Atomic Energy Etablishment. URL https://books.google.com/books?id=ez I Rrg EACAAJ
- 4Birdsall and Langdon [2005] Birdsall, C., Langdon, A., 2005. Plasma Physics via Computer Simulation. Mc Graw-Hill, New York.
- 5Castor [2004] Castor, J., 2004. Radiation Hydrodynamics. Radiation Hydrodynamics. Cambridge University Press. URL https://books.google.com/books?id=J 48PU Lzdg Sg C
- 6Chacón et al. [2017] Chacón, L., Chen, G., Knoll, D., Newman, C., Park, H., Taitano, W., Willert, J., Womeldorff, G., 2017. Multiscale high-order/low-order (holo) algorithms and applications. Journal of Computational Physics 330, 21 – 45. URL http://www.sciencedirect.com/science/article/pii/S 0021999116305770
- 7Degond and Mustieles [1990] Degond, P., Mustieles, F.-J., 1990. A deterministic approximation of diffusion equations using particles. SIAM Journal on Scientific and Statistical Computing 11 (2), 293–310. URL http://dx.doi.org/10.1137/0911018 · doi ↗
- 8Densmore et al. [2015] Densmore, J., Park, H., Wollaber, A., Rauenzahn, R., Knoll, D., 2015. Monte Carlo simulation methods in moment-based scale-bridging algorithms for thermal radiative-transfer problems. Journal of Computational Physics 284 (0), 40 – 58.
