• Title/Summary/Keyword: Monte Carlo depletion

Search Result 35, Processing Time 0.021 seconds

MONTE CARLO DEPLETION UNDER LEAKAGE-CORRECTED CRITICAL SPECTRUM VIA ALBEDO SEARCH

  • Yun, Sung-Hwan;Cho, Nam-Zin
    • Nuclear Engineering and Technology
    • /
    • v.42 no.3
    • /
    • pp.271-278
    • /
    • 2010
  • While the deterministic lattice physics/depletion codes use leakage-corrected critical spectrum (although approximate due to the B1 buckling search employed), Monte Carlo depletion codes currently in use do not have such a feature in spite of their heterogeneity and continuous-energy modeling capability. This paper describes an approach to Monte Carlo depletion with leakage-corrected critical spectrum derived from first principles. This is based on the concept of albedo eigenvalue treated as weight of the reflected neutron in Monte Carlo simulation.

Overcoming the challenges of Monte Carlo depletion: Application to a material-testing reactor with the MCS code

  • Dos, Vutheam;Lee, Hyunsuk;Jo, Yunki;Lemaire, Matthieu;Kim, Wonkyeong;Choi, Sooyoung;Zhang, Peng;Lee, Deokjung
    • Nuclear Engineering and Technology
    • /
    • v.52 no.9
    • /
    • pp.1881-1895
    • /
    • 2020
  • The theoretical aspects behind the reactor depletion capability of the Monte Carlo code MCS developed at the Ulsan National Institute of Science and Technology (UNIST) and practical results of this depletion feature for a Material-Testing Reactor (MTR) with plate-type fuel are described in this paper. A verification of MCS results is first performed against MCNP6 to confirm the suitability of MCS for the criticality and depletion analysis of the MTR. Then, the dependence of the effective neutron multiplication factor to the number of axial and radial depletion cells adopted in the fuel plates is performed with MCS in order to determine the minimum spatial segmentation of the fuel plates. Monte Carlo depletion results with 37,800 depletion cells are provided by MCS within acceptable calculation time and memory usage. The results show that at least 7 axial meshes per fuel plate are required to reach the same precision as the reference calculation whereas no significant differences are observed when modeling 1 or 10 radial meshes per fuel plate. This study demonstrates that MCS can address the need for Monte Carlo codes capable of providing reference solutions to complex reactor depletion problems with refined meshes for fuel management and research reactor applications.

Domain Decomposition Strategy for Pin-wise Full-Core Monte Carlo Depletion Calculation with the Reactor Monte Carlo Code

  • Liang, Jingang;Wang, Kan;Qiu, Yishu;Chai, Xiaoming;Qiang, Shenglong
    • Nuclear Engineering and Technology
    • /
    • v.48 no.3
    • /
    • pp.635-641
    • /
    • 2016
  • Because of prohibitive data storage requirements in large-scale simulations, the memory problem is an obstacle for Monte Carlo (MC) codes in accomplishing pin-wise three-dimensional (3D) full-core calculations, particularly for whole-core depletion analyses. Various kinds of data are evaluated and quantificational total memory requirements are analyzed based on the Reactor Monte Carlo (RMC) code, showing that tally data, material data, and isotope densities in depletion are three major parts of memory storage. The domain decomposition method is investigated as a means of saving memory, by dividing spatial geometry into domains that are simulated separately by parallel processors. For the validity of particle tracking during transport simulations, particles need to be communicated between domains. In consideration of efficiency, an asynchronous particle communication algorithm is designed and implemented. Furthermore, we couple the domain decomposition method with MC burnup process, under a strategy of utilizing consistent domain partition in both transport and depletion modules. A numerical test of 3D full-core burnup calculations is carried out, indicating that the RMC code, with the domain decomposition method, is capable of pin-wise full-core burnup calculations with millions of depletion regions.

SOME OUTSTANDING PROBLEMS IN NEUTRON TRANSPORT COMPUTATION

  • Cho, Nam-Zin;Chang, Jong-Hwa
    • Nuclear Engineering and Technology
    • /
    • v.41 no.4
    • /
    • pp.381-390
    • /
    • 2009
  • This article provides selects of outstanding problems in computational neutron transport, with some suggested approaches thereto, as follows: i) ray effect in discrete ordinates method, ii) diffusion synthetic acceleration in strongly heterogeneous problems, iii) method of characteristics extension to three-dimensional geometry, iv) fission source and $k_{eff}$ convergence in Monte Carlo, v) depletion in Monte Carlo, vi) nuclear data evaluation, and vii) uncertainty estimation, including covariance data.

Monte Carlo burnup and its uncertainty propagation analyses for VERA depletion benchmarks by McCARD

  • Park, Ho Jin;Lee, Dong Hyuk;Jeon, Byoung Kyu;Shim, Hyung Jin
    • Nuclear Engineering and Technology
    • /
    • v.50 no.7
    • /
    • pp.1043-1050
    • /
    • 2018
  • For an efficient Monte Carlo (MC) burnup analysis, an accurate high-order depletion scheme to consider the nonlinear flux variation in a coarse burnup-step interval is crucial accompanied with an accurate depletion equation solver. In a Seoul National University MC code, McCARD, the high-order depletion schemes of the quadratic depletion method (QDM) and the linear extrapolation/quadratic interpolation (LEQI) method and a depletion equation solver by the Chebyshev rational approximation method (CRAM) have been newly implemented in addition to the existing constant extrapolation/backward extrapolation (CEBE) method using the matrix exponential method (MEM) solver with substeps. In this paper, the quadratic extrapolation/quadratic interpolation (QEQI) method is proposed as a new high-order depletion scheme. In order to examine the effectiveness of the newly-implemented depletion modules in McCARD, four problems in the VERA depletion benchmarks are solved by CEBE/MEM, CEBE/CRAM, LEQI/MEM, QEQI/MEM, and QDM for gadolinium isotopes. From the comparisons, it is shown that the QEQI/MEM predicts ${k_{inf}}^{\prime}s$ most accurately among the test cases. In addition, statistical uncertainty propagation analyses for a VERA pin cell problem are conducted by the sensitivity and uncertainty and the stochastic sampling methods.

ON SOME OUTSTANDING PROBLEMS IN NUCLEAR REACTOR ANALYSIS

  • Cho, Nam-Zin
    • Nuclear Engineering and Technology
    • /
    • v.44 no.2
    • /
    • pp.207-224
    • /
    • 2012
  • This article discusses selects of some outstanding problems in nuclear reactor analysis, with proposed approaches thereto and numerical test results, as follows: i) multi-group approximation in the transport equation, ii) homogenization based on isolated single-assembly calculation, and iii) critical spectrum in Monte Carlo depletion.

Real variance estimation in iDTMC-based depletion analysis

  • Inyup Kim;Yonghee Kim
    • Nuclear Engineering and Technology
    • /
    • v.55 no.11
    • /
    • pp.4228-4237
    • /
    • 2023
  • The Improved Deterministic Truncation of Monte Carlo (iDTMC) is a powerful acceleration and variance reduction scheme in the Monte Carlo analysis. The concept of the iDTMC method and correlated sampling-based real variance estimation are briefly introduced. Moreover, the application of the iterative scheme to the correlated sampling is discussed. The iDTMC method is utilized in a 3-dimensional small modular reactor (SMR) model problem. The real variances of burnup-dependent criticality and power distribution are evaluated and compared with the ones obtained from 30 independent iDTMC calculations. The impact of the inactive cycles on the correlated sampling is also evaluated to investigate the consistency of the correlated sample scheme. In addition, numerical performances and sensitivity analysis on the real variance estimation are performed in view of the figure of merit of the iDTMC method. The numerical results show that the correlated sampling accurately estimates the real variances with high computational efficiencies.

Validation of nuclide depletion capabilities in Monte Carlo code MCS

  • Ebiwonjumi, Bamidele;Lee, Hyunsuk;Kim, Wonkyeong;Lee, Deokjung
    • Nuclear Engineering and Technology
    • /
    • v.52 no.9
    • /
    • pp.1907-1916
    • /
    • 2020
  • In this work, the depletion capability implemented in Monte Carlo code MCS is investigated to predict the isotopic compositions of spent nuclear fuel (SNF). By comparison of MCS calculation results to post irradiation examination (PIE) data obtained from one pressurized water reactor (PWR), the validation of this capability is conducted. The depletion analysis is performed with the ENDF/B-VII.1 library and a fuel assembly model. The transmutation equation is solved by the Chebyshev Rational Approximation Method (CRAM) with a depletion chain of 3820 isotopes. 18 actinides and 19 fission products are analyzed in 14 SNF samples. The effect of statistical uncertainties on the calculated number densities is discussed. On average, most of the actinides and fission products analyzed are predicted within ±6% of the experiment. MCS depletion results are also compared to other depletion codes based on publicly reported information in literature. The code-to-code analysis shows comparable accuracy. Overall, it is demonstrated that the depletion capability in MCS can be reliably applied in the prediction of SNF isotopic inventory.

Domain decomposition for GPU-Based continuous energy Monte Carlo power reactor calculation

  • Choi, Namjae;Joo, Han Gyu
    • Nuclear Engineering and Technology
    • /
    • v.52 no.11
    • /
    • pp.2667-2677
    • /
    • 2020
  • A domain decomposition (DD) scheme for GPU-based Monte Carlo (MC) calculation which is essential for whole-core depletion is introduced within the framework of the modified history-based tracking algorithm. Since GPU-offloaded MC calculations suffer from limited memory capacity, employing DDMC is inevitable for the simulation of depleted cores which require large storage to save hundreds of newly generated isotopes. First, an automated domain decomposition algorithm named wheel clustering is devised such that each subdomain contains nearly the same number of fuel assemblies. Second, an innerouter iteration algorithm allowing overlapped computation and communication is introduced which enables boundary neutron transactions during the tracking of interior neutrons. Third, a bank update scheme which is to include the boundary sources in a way to be adequate to the peculiar data structures of the GPU-based neutron tracking algorithm is presented. The verification and demonstration of the DDMC method are done for 3D full-core problems: APR1400 fresh core and a mock-up depleted core. It is confirmed that the DDMC method performs comparably with the standard MC method, and that the domain decomposition scheme is essential to carry out full 3D MC depletion calculations with limited GPU memory capacities.

Practical methods for GPU-based whole-core Monte Carlo depletion calculation

  • Kyung Min Kim;Namjae Choi;Han Gyu Lee;Han Gyu Joo
    • Nuclear Engineering and Technology
    • /
    • v.55 no.7
    • /
    • pp.2516-2533
    • /
    • 2023
  • Several practical methods for accelerating the depletion calculation in a GPU-based Monte Carlo (MC) code PRAGMA are presented including the multilevel spectral collapse method and the vectorized Chebyshev rational approximation method (CRAM). Since the generation of microscopic reaction rates for each nuclide needed for the construction of the depletion matrix of the Bateman equation requires either enormous memory access or tremendous physical memory, both of which are quite burdensome on GPUs, a new method called multilevel spectral collapse is proposed which combines two types of spectra to generate microscopic reaction rates: an ultrafine spectrum for an entire fuel pin and coarser spectra for each depletion region. Errors in reaction rates introduced by this method are mitigated by a hybrid usage of direct online reaction rate tallies for several important fissile nuclides. The linear system to appear in the solution process adopting the CRAM is solved by the Gauss-Seidel method which can be easily vectorized on GPUs. With the accelerated depletion methods, only about 10% of MC calculation time is consumed for depletion, so an accurate full core cycle depletion calculation for a commercial power reactor (BEAVRS) can be done in 16 h with 24 consumer-grade GPUs.