No abstract

In this paper, we are interested in taking into account uncertainties for k eff computations in neutronics. More generally, the material of this paper can be applied to propagate uncertainties in eigenvalue/eigenvector computations for the linear Boltzmann equation. In [1,2], an intrusive MC solver for the gPC based reduced model of the instationary linear Boltzmann equation has been put forward. The MC-gPC solver presents interesting characteristics (mainly a better efficiency than non-intrusive strategies and spectral convergence): our aim is to recover these characteristics in an eigenvalue/eigenvector estimation context. This is done in practice at the price of few well identified modifications of an existing Monte Carlo implementation.

a b s t r a c tThe analysis of neutron kinetics relies on the knowledge of adjoint-weighted kinetics parameters, which are key to safety issues in the context of transient or accidental reactor behavior. The Iterated Fission Probability (IFP) method allows the adjoint-weighted mean generation time and delayed neutron fraction to be computed within a Monte Carlo power iteration calculation. In this work we describe the specific features of the implementation of the IFP algorithm in the reference Monte Carlo code TRIPOLI-4 Ò developed at CEA. Several verification and validation tests are discussed, and the impact of nuclear data libraries, IFP cycle length and inter-cycle correlations are analyzed in detail.