摘要
本文提出了一种新的延时累加算法。基于底层的JCOGIN(J combinatorial geometry Monte Carlo transport infrastructure)框架和新的延时累加算法,通用型Monte Carlo中子-光子输运模拟软件JMCT的计数能力得到了较大提高。对所考察的非重复结构的单层几何模型问题,JMCT的计数效率较MCNP 4C程序所采用的list scoring技巧高约28%;对于较复杂的重复结构几何模型问题,JMCT的大规模精细计数效率比MCNP 4C高约两个量级。JMCT目前的计数能力为反应堆物理分析及多燃耗步计算奠定了良好的基础。
A new postponed accumulation algorithm was proposed. Based on JCOGIN （J combinatorial geometry Monte Carlo transport infrastructure） framework and the postponed accumulation algorithm, the tallying function of the general purpose Monte Carlo neutron-photon transport code JMCT was improved markedly. JMCT gets a higher tallying efficiency than MCNP 4C hy 28 ~ for simple geometry model, and JMCT is faster than MCNP 4C by two orders of magnitude for complicated repeated structure model. The available ability of tallying function for JMCT makes firm foundation for reactor analysis and multi-step burnup calculation.
出处
《原子能科学技术》
EI
CAS
CSCD
北大核心
2013年第B12期640-644,共5页
Atomic Energy Science and Technology
基金
国家自然科学基金资助项目(91118001)
国家高技术研究发展计划资助项目(2012AA01A303)
国家重点基础研究专项经费资助项目(2011CB309705)
中国工程物理研究院科学技术发展基金资助项目(2011A0103006)
