Abstract
Solving time-dependent transport problems for neutrons and precursors in a nuclear reactor is a daunting task in a naive Monte Carlo framework, mainly because of the enormous difference between the time scale associated with the prompt fission chains and that associated with the decay of delayed neutron precursors. Recently, the development of variance reduction techniques specific for reactor kinetics and the rapidly increasing computer power have paved the way towards the possibility of obtaining reference solutions to the time-dependent transport problem. However, the application of time-dependent Monte Carlo to large systems (i.e. at the scale of a full reactor core) is still considerably hindered by the huge computational requirements. In this paper, we construct an ideal Monte Carlo game that results in a zero-variance estimator for specific observables in time-dependent transport. Our derivation follows the pattern of the existing schemes for stationary problems. To the best of our knowledge, zero-variance Monte Carlo schemes for time-dependent transport including delayed neutrons precursors have never been considered before. As a proof of principle, we verify our construction for a simplified benchmark configuration where analytical reference solutions for the transport problem can be explicitly obtained.
Similar content being viewed by others
Notes
It is in principle possible to allow for the kernels of the non-analog game to depend on the particle weight, as well as on the coordinates in phase space. This amounts to extending the phase space by including the weight as an additional coordinate. The treatment of weight-dependent rules such as Russian roulette and splitting is allowed within this extended framework, at the expense, however, of a considerably more complex formalism [26].
References
B.L. Sjenitzer, J.E. Hoogenboom, Nucl. Sci. Eng. 175(1), 94 (2013)
B.L. Sjenitzer, Ph.D. thesis, Delft University of Technology, Delft, Netherlands (2013)
M. Faucher, D. Mancusi, A. Zoia, Ann. Nucl. Energy 120, 74 (2018)
J.E. Hoogenboom, Nucl. Sci. Eng. 160(1), 1 (2008)
I. Lux, L. Koblinger, Monte Carlo Particle Transport Methods: Neutron and Photon Calculations (CRC Press, Boca Raton, 1991)
G. Goertzel, Technical report 434, Oak Ridge National Laboratory, USA (1949)
H. Kahn, Technical report P-132, RAND Corporation, USA (1949)
H. Kahn, Technical report RM-1237-AEC, RAND Corporation, USA (1956)
G. Goertzel, M. Kalos, Prog. Nucl. Eng. Ser. I Phys. Math. 2, 315 (1958)
H. Kahn, in Symposium on Monte Carlo Methods, ed. by H.A. Meyer (Wiley, New York, 1956), pp. 146–190
M. Kalos, Nucl. Sci. Eng. 16, 227 (1963)
R. Coveyou, V. Cain, K. Yost, Nucl. Sci. Eng. 27, 219 (1967)
S. Ermakov, Die Monte Carlo Methode und Verwandte Fragen (Oldenburg Verlag, Munich, 1975)
J. Hoogenboom, Nucl. Sci. Eng. 70, 210 (1979)
K. Noack, Kernenergie 22, 346 (1979)
K. Noack, Kernenergie 23, 372 (1980)
S. Dwivedi, Nucl. Sci. Eng. 80, 172 (1982)
H.C. Gupta, Nucl. Sci. Eng. 83, 187 (1983)
H. Amster, M. Djomehri, Nucl. Sci. Eng. 60, 131 (1976)
T. Booth, H. Amster, Nucl. Sci. Eng. 65, 273 (1978)
I. Lux, Nucl. Sci. Eng. 67, 139 (1978)
I. Lux, Nucl. Sci. Eng. 67, 317 (1978)
P.K. Sarkar, M.A. Prasad, Nucl. Sci. Eng. 70, 243 (1979)
T.E. Booth, Technical report LA-7636-T, Los Alamos Scientific Laboratory, NM, USA (1979)
T. Booth, E. Cashwell, Nucl. Sci. Eng. 71, 128 (1979)
T. Booth, Appl. Radiat. Isot. 70, 1042 (2012)
T. Booth, Nucl. Sci. Eng. 102, 332 (1989)
E. Larsen, P. Zweifel, J. Math. Phys. 15, 1987 (1974)
H. Kaper, J. Math. Anal. Appl. 19, 207 (1967)
B.L. Sjenitzer, J.E. Hoogenboom, Ann. Nucl. Energy 38(10), 2195 (2011)
M. Faucher, D. Mancusi, A. Zoia, Variance-reduction methods for Monte Carlo kinetic simulations, in: Proceedings to the International Conference on Mathematics and Computational Methods Applied to Nuclear Science and Engineering (M&C 2019) (2019)
E.R. Woodcock, T. Murphy, P.J. Hemmings, T.C. Longworth, Technical report. ANL-7050, Argonne National Laboratory, USA (1965)
Author information
Authors and Affiliations
Corresponding author
Appendices
Derivation of the moment equations
Consider a generic random walk characterized by the flight kernel \({\hat{T}}(P,P')\) and the branchless collision kernel \({\hat{C}}(P',P'')\), with \( {\hat{w}}_b(P)=\int {\hat{C}}(P,P') \,\mathrm {d}P'\). Each walker starts with a statistical weight w. After a flight from P to \(P'\), the statistical weight becomes \(w'\), and after a collision from \(P'\) to \(P''\) the statistical weight becomes \( {\hat{w}}_b w''\), where \(w'\) and \(w''\) are expressions to be further determined. Suppose that the random walk is endowed with an estimator \(h(P,P')\) along a flight from P to \(P'\). Let us now consider the probability \(\pi (s|P, w)\) to observe a score s for the quantity of interest, for a particle starting from P with statistical weight w. From considerations of normalization, we have
It can be shown that \(\pi (s|P, w)\) satisfies the probability balance equation [5]
where \({\hat{C}}_b(P', P'') ={\hat{C}}(P', P'') / {\hat{w}}_b(P')\) is the normalized collision kernel.
We define the moments \({\hat{M}}_k(P)\) of the scores associated with the underlying random walk starting from P with unit statistical weight,
By multiplying Eq. (44) by s and integrating over \(\,\mathrm {d}s\) we obtain the equation for the first moment, namely
Similarly, multiplying Eq. (44) by \(s^2\) and integrating over \(\,\mathrm {d}s\) we obtain the equation for the second moment, namely
As a special case, for the natural game we have \({\hat{T}}(P,P')= T(P,P')\), \({\hat{C}}(P',P'')= C(P',P'')\) and the statistical weights are not modified, namely \(w'' = w' = w\). We denote by \(M_k(P)\) the corresponding moments of the scores. The weights \(w'\) and \(w''\) for the non-analog game are chosen by imposing that the resulting game is unbiased, i.e. \({\hat{M}}_1(P) = M_1(P)\) [5], which leads to the weight generation rules given by Eqs. (20) and (21): \(w' = w_T(P,P') w\) and \(w'' = w_C(P',P'') w'\).
Derivation of the zero-variance kernels
Let us consider the first-moment equation for the natural Monte Carlo game associated with the kernels \(T(P',P)\) and \(C(P',P'')\), with estimator \(h(P,P')\) along a flight:
Let \(\kappa (P,P') \ge 0\) be a sufficiently regular, non-negative, but otherwise undetermined function. Equation (45) can be equivalently rewritten as follows:
Consider then a non-analog branchless Monte Carlo game associated with the kernels \({\hat{T}}(P',P)\) and \({\hat{C}}(P',P'')\), with estimator \(h(P,P')\) along a flight. Imposing a zero-variance condition for a unit starter weight amounts to setting
By using the weight generation rules
and
this game is partially unbiased, with \({\hat{M}}_1(P) = M_1(P)\) for a single starting particle. For a unit starter weight, the equation for the second moment \({\hat{M}}_2(P)\) of the non-analog game is
where
is the branchless weight correction for the outgoing neutron of the kernel \({\hat{C}}(P',P'')\). Let \(\theta (P)\ge 0\) be a sufficiently regular, non-negative, but otherwise undetermined function; Eq. (48) can be equivalently rewritten as follows:
Equation (47) involves the first moment of the score, Eq. (46), and the second moment, Eq. (49). Both sides of Eq. (47) involve integrals over intermediate points in phase space. In order for Eq. (47) to hold true, an inspired sufficient condition is that the integrands are equal. Since \({\hat{M}}_1(P) = M_1(P)\), we thus equate the integrand in the term
appearing at the right-hand side of Eq. (46) (for \(M_1(P)\)) to the integrand in the term
appearing at the right-hand side of Eq. (49) (for \(M_2(P)\)), after dividing by \(M_1(P)\). We therefore have
By using the definitions of \(w_T(P',P'')\) and \(w_C(P'',P)\), we obtain
which is satisfied by setting
and
By imposing the normalization of \({\hat{T}}(P,P') \), we have
whence
From Eq. (45), by imposing the equality of the integrands we obtain
Finally,
By imposing then the normalization of \({\hat{C}}(P',P'') \), we have \({\hat{w}}_b(P')=1\) and
whence
Finally,
We have now to verify that this choice for the kernels \({\hat{T}}(P,P')\) and \({\hat{C}}(P',P'')\) actually satisfies Eq. (47) (remember that we have determined \(\kappa (P,P')\) and \(\theta (P)\) by equating the integrands of only one of the terms). For the integrands, we must therefore have
By using the expressions of the weight correction formulas and the definition of \(\theta (P')\), we obtain
Now,
so that we have
Since
the equality of the two terms in Eq. (52) is satisfied, which proves the identity leading to the zero-variance condition in Eq. (47).
We have thus shown that a non-analog Monte Carlo game with kernels given by Eqs. (50) and (51) yields a zero-variance estimate due to a unit-weight starter from any source point P. However, the zero-variance property of the total score
is not ensured, unless the non-analog source \({\hat{Q}}(P)\) is properly chosen. The variance of the total score is given by
Since \({\hat{M}}_1(P) =M_1(P) \) and \({\hat{M}}_2(P) = M^2_1(P)\), in order to ensure a zero-variance for the total score we equate the integrands
whence the condition
which completes the requirements for a non-analog partially unbiased Monte Carlo game resulting in a zero-variance estimate for the total score R with the estimator \(h(P,P')\).
Rights and permissions
About this article
Cite this article
Mancusi, D., Zoia, A. Zero-variance schemes for kinetic Monte Carlo simulations. Eur. Phys. J. Plus 135, 401 (2020). https://doi.org/10.1140/epjp/s13360-020-00387-8
Received:
Accepted:
Published:
DOI: https://doi.org/10.1140/epjp/s13360-020-00387-8