File Download

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

이덕중

Lee, Deokjung
Computational Reactor physics & Experiment Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Verification of a two-step code system MCS/RAST-F to fast reactor core analysis

Author(s)
Tran, Tuan QuocCherezov, AlexeyDu, XiananLee, Deokjung
Issued Date
2022-05
DOI
10.1016/j.net.2021.10.038
URI
https://scholarworks.unist.ac.kr/handle/201301/58426
Fulltext
https://linkinghub.elsevier.com/retrieve/pii/S1738573321006227
Citation
NUCLEAR ENGINEERING AND TECHNOLOGY, v.54, no.5, pp.1789 - 1803
Abstract
RAST-F is a new full-core analysis code based on the two-step approach that couples a multi-group cross-section generation Monte-Carlo code MCS and a multi-group nodal diffusion solver. To demonstrate the feasibility of using MCS/RAST-F for fast reactor analysis, this paper presents the coupled nodal code verification results for the MET-1000 and CAR-3600 benchmark cores. Three different multi-group cross-section calculation schemes are employed to improve the agreement between the nodal and reference solutions. The reference solution is obtained by the MCS code using continuous-energy nuclear data. Additionally, the MCS/RAST-F nodal solution is verified with results based on cross-section generated by collision probability code TULIP. A good agreement between MCS/RAST-F and reference solution is observed with less than 120 pcm discrepancy in k(eff) and less than 1.2% root-mean-square error in power distribution. This study confirms the two-step approach MCS/RAST-F as a reliable tool for the three-dimensional simulation of reactor cores with fast spectrum. (C) 2021 Korean Nuclear Society, Published by Elsevier Korea LLC.
Publisher
KOREAN NUCLEAR SOC
ISSN
1738-5733
Keyword (Author)
Nodal diffusion codeRAST-FTPENFast reactor
Keyword
SERPENT-DYN3DMCS

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.