Adjoint Monte Carlo neutron transport using cross-section probability table representation

2010 ◽  
Vol 37 (9) ◽  
pp. 1186-1196 ◽  
Author(s):  
Cheikh M’Backé Diop ◽  
Odile Petit ◽  
Cédric Jouanne ◽  
Mireille Coste-Delclaux
Author(s):  
Hao Li ◽  
Ganglin Yu ◽  
Shanfang Huang ◽  
Kan Wang

There exists a typical problem in Monte Carlo neutron transport: the effective multiplication factor sensitivity to geometric parameter. In several methods attempting to solve it, Monte Carlo adjoint-weighted theory has been proven to be quite effective. The major obstacle of adjoint-weighted theory is calculating derivative of cross section with respect to geometric parameter. In order to fix this problem, Heaviside step function and Dirac delta function are introduced to describe cross section and its derivative. This technique is crucial, and it establishes the foundation of further research. Based on above work, adjoint-weighted method is developed to solve geometric sensitivity. However, this method is limited to surfaces which are uniformly expanded or contracted with respect to its origin, such as vertical movement of plane or expansion of sphere. Rotation and translation are not allowed, while these two transformation types are more common and more important in engineering projects. In this paper, a more universal method, Cell Constraint Condition Perturbation (CCCP) method, is developed and validated. Different from traditional method, CCCP method for the first time explicitly articulates that the perturbed quantity is the parameter of spatial analytic geometry equations that used to describe surface. Thus, the CCCP can treat arbitrary one-parameter geometric perturbation of arbitrary surface as long as this surface can be described by spatial analytic geometry equation. Furthermore, CCCP can treat the perturbation of the whole cell, such as translation, rotation, expansion and constriction. Several examples are calculated to confirm the validity of CCCP method.


Author(s):  
Wanlin Li ◽  
Kan Wang ◽  
Ganglin Yu ◽  
Yaodong Li

Monte Carlo (MC) burnup calculation method, implemented through coupling neutron transport and point depletion solvers, is widely used in design and analysis of nuclear reactor. Burnup calculation is generally solved by dividing reactor lifetime into steps and modeling geometry into numbers of burnup areas where neutron flux and one group effective cross sections are treated as constant during each burnup step. Such constant approximation for neutron flux and effective cross section will lead to obvious error unless using fairly short step. To yield accuracy and efficiency improvement, coupling schemes have been researched in series of MC codes. In this study, four coupling schemes, beginning of step approximation, predictor-corrector methods by correcting nuclide density and flux-cross section as well as high order predictor-corrector with sub-step method were researched and implemented in RMC. Verification and comparison were performed by adopting assembly problem from VERA international benchmark. Results illustrate that high order coupled with sub-step method is with notable accuracy compared to beginning of step approximation and traditional predictor-corrector, especially for calculation in which step length is fairly long.


2020 ◽  
Vol 6 ◽  
pp. 8 ◽  
Author(s):  
Axel Laureau ◽  
Vincent Lamirand ◽  
Dimitri Rochman ◽  
Andreas Pautz

A correlated sampling technique has been implemented to estimate the impact of cross section modifications on the neutron transport and in Monte Carlo simulations in one single calculation. This implementation has been coupled to a Total Monte Carlo approach which consists in propagating nuclear data uncertainties with random cross section files. The TMC-CS (Total Monte Carlo with Correlated Sampling) approach offers an interesting speed-up of the associated computation time. This methodology is detailed in this paper, together with two application cases to validate and illustrate the gain provided by this technique: the highly enriched uranium/iron metal core reflected by a stainless-steel reflector HMI-001 benchmark, and the PETALE experimental programme in the CROCUS zero-power light water reactor.


2019 ◽  
Vol 9 (2) ◽  
pp. 17-24
Author(s):  
Jakub Lüley ◽  
Branislav Vrban ◽  
Štefan Čerba ◽  
Filip Osuský ◽  
Vladimír Nečas

Stochastic Monte Carlo (MC) neutron transport codes are widely used in various reactorphysics applications, traditionally related to criticality safety analyses, radiation shielding and validation of deterministic transport codes. The main advantage of Monte Carlo codes lies in their ability to model complex and detail geometries without the need of simplifications. Currently, one of the most accurate and developed stochastic MC code for particle transport simulation is MCNP. To achieve the best real world approximations, continuous-energy (CE) cross-section (XS) libraries are often used. These CE libraries consider the rapid changes of XS in the resonance energy range; however, computing-intensive simulations must be performed to utilize this feature. To broaden ourcomputation abilities for industrial application and partially to allow the comparison withdeterministic codes, the CE cross section library of the MCNP code is replaced by the multigroup (MG) cross-section data. This paper is devoted to the cross-section processing scheme involving modified versions of TRANSX and CRSRD codes. Following this approach, the same data may be used in deterministic and stochastic codes. Moreover, using formerly developed and upgraded crosssection processing scheme, new MG libraries may be tailored to the user specific applications. For demonstration of the proposed cross-section processing scheme, the VVER-440 benchmark devoted to fuel assembly and pip-by-pin power distribution was selected. The obtained results are compared with continues energy MCNP calculation and multigroup KENO-VI calculation.


2020 ◽  
Vol 239 ◽  
pp. 10005
Author(s):  
Xiaofei Wu ◽  
Ping Liu ◽  
Zhigang Ge

Probability table is one of the most important and natural methods used to simulate the neutron transport in unresolved resonance range in reactor physics. A new module for generating probability tables in the unresolved-resonance region has been developed for the nuclear data processing code Ruler, using ladder method. In order to validate and verify the accuracy of this module, Probability tables have been calculated and compared with NJOY2016. Agreement is observed in the comparisons of the probability tables and corresponding cross-section values that are calculated by Ruler and NJOY2016. Ruler has improved computational efficiency greatly comparing with NJOY2016 as multi-thread parallel algorithm is applied.


2021 ◽  
Vol 247 ◽  
pp. 04017
Author(s):  
Paul E. Burke ◽  
Kyle E. Remley ◽  
David P. Griesheimer

In radiation transport calculations, the effects of material temperature on neutron/nucleus interactions must be taken into account through Doppler broadening adjustments to the microscopic cross section data. Historically, Monte Carlo transport simulations have accounted for this temperature dependence by interpolating among precalculated Doppler broadened cross sections at a variety of temperatures. More recently, there has been much interest in on-the-fly Doppler broadening methods, where reference data is broadened on-demand during particle transport to any temperature. Unfortunately, Doppler broadening operations are expensive on traditional central processing unit (CPU) architectures, making on-the-fly Doppler broadening unaffordable without approximations or complex data preprocessing. This work considers the use of graphics processing unit (GPU)s, which excel at parallel data processing, for on-the-fly Doppler broadening in continuous-energy Monte Carlo simulations. Two methods are considered for the broadening operations – a GPU implementation of the standard SIGMA1 algorithm and a novel vectorized algorithm that leverages the convolution properties of the broadening operation in an attempt to expose additional parallelism. Numerical results demonstrate that similar cross section lookup throughput is obtained for on-the-fly broadening on a GPU as cross section lookup throughput with precomputed data on a CPU, implying that offloading Doppler broadening operations to a GPU may enable on-the-fly temperature treatment of cross sections without a noticeable reduction in cross section processing performance in Monte Carlo transport codes.


2019 ◽  
Vol 127 ◽  
pp. 433-436 ◽  
Author(s):  
Li Deng ◽  
Zehua Hu ◽  
Rui Li ◽  
Tangpei Cheng ◽  
Chao Yang ◽  
...  

2021 ◽  
Vol 247 ◽  
pp. 02011
Author(s):  
Seog Kim Kang ◽  
Andrew M. Holcomb ◽  
Friederike Bostelmann ◽  
Dorothea Wiarda ◽  
William Wieselquist

The SCALE-XSProc multigroup (MG) cross section processing procedure based on the CENTRM pointwise slowing down calculation is the primary procedure to process problem-dependent self-shielded MG cross sections and scattering matrices for neutron transport calculations. This procedure supports various cell-based geometries including slab, 1-D cylindrical, 1-D spherical and 2-D rectangular configurations and doubly heterogeneous particulate fuels. Recently, this procedure has been significantly improved to be applied to any advanced reactor analysis covering thermal and fast reactor systems, and to be comparable to continuous energy (CE) Monte Carlo calculations. Some reactivity bias and reaction rate differences have been observed compared with CE Monte Carlo calculations, and several areas for improvement have been identified in the SCALE-XSProc MG cross section processing: (1) resonance self-shielding calculations within the unresolved resonance range, (2) 10 eV thermal cut-off energy for the free gas model, (3) on-the-fly adjustments to the thermal scattering matrix, (4) normalization of the pointwise neutron flux, and (5) fine MG energy structure. This procedure ensures very accurate MG cross section processing for high-fidelity deterministic reactor physics analysis for various advanced reactor systems.


2021 ◽  
Vol 247 ◽  
pp. 04020
Author(s):  
Nicolas Denoyelle ◽  
John Tramm ◽  
Kazutomo Yoshii ◽  
Swann Perarnau ◽  
Pete Beckman

The calculation of macroscopic neutron cross-sections is a fundamental part of the continuous-energy Monte Carlo (MC) neutron transport algorithm. MC simulations of full nuclear reactor cores are computationally expensive, making high-accuracy simulations impractical for most routine reactor analysis tasks because of their long time to solution. Thus, preparation of MC simulation algorithms for next generation supercomputers is extremely important as improvements in computational performance and efficiency will directly translate into improvements in achievable simulation accuracy. Due to the stochastic nature of the MC algorithm, cross-section data tables are accessed in a highly randomized manner, resulting in frequent cache misses and latency-bound memory accesses. Furthermore, contemporary and next generation non-uniform memory access (NUMA) computer architectures, featuring very high latencies and less cache space per core, will exacerbate this behaviour. The absence of a topology-aware allocation strategy in existing high-performance computing (HPC) programming models is a major source of performance problems in NUMA systems. Thus, to improve performance of the MC simulation algorithm, we propose a topology-aware data allocation strategies that allow full control over the location of data structures within a memory hierarchy. A new memory management library, known as AML, has recently been created to facilitate this mapping. To evaluate the usefulness of AML in the context of MC reactor simulations, we have converted two existing MC transport cross-section lookup “proxy-applications” (XSBench and RSBench) to utilize the AML allocation library. In this study, we use these proxy-applications to test several continuous-energy cross-section data lookup strategies (the nuclide grid, unionized grid, logarithmic hash grid, and multipole methods) with a number of AML allocation schemes on a variety of node architectures. We find that the AML library speeds up cross-section lookup performance up to 2x on current generation hardware (e.g., a dual-socket Skylake-based NUMA system) as compared with naive allocation. These exciting results also show a path forward for efficient performance on next-generation exascale supercomputer designs that feature even more complex NUMA memory hierarchies.


Sign in / Sign up

Export Citation Format

Share Document