摘要
分析连续能量点截面中子输运程序JMCT中区间查找的时间复杂度.针对主能量网格,裂变释放中子数和不可分辨共振网格进行区间映射加速,并以等差和等比序列网格为例,对比分析不同散列网格的质量.最后选择寿期初与寿期中燃料棒栅元的k_∞问题进行对比测试.结果显示,对于核素数目较多的输运问题,优化查找策略具有很好的加速效果.
Time consuming analysis of grid search in JMCT, a continuous-energy Monte Carlo neutron transport code, is done. Region projecting acceleration is performed on grids of main energy, fission yield neutron and unresolved resonance data. Quality of project grid is shown with arithmetic progression and geometric progression. At last, optimized grid search is test on several k∞problems. The models are fuel lattice cell at begin of cycle and middle of cycle. It shows that optimized grid search improves speed of JMCT remarkably in middle of cycle problem.
出处
《计算物理》
CSCD
北大核心
2016年第5期587-592,共6页
Chinese Journal of Computational Physics
基金
能源局06专项(2015ZX06002008)
中国工程物理研究院院基金(2014B0202029)资助项目
