计算物理 ›› 2016, Vol. 33 ›› Issue (5): 587-592.

• 研究论文 • 上一篇    下一篇

JMCT优化查找策略的实现

李瑞1,2, 李刚1, 张宝印1, 邓力1, 王伟1   

  1. 1. 北京应用物理与计算数学研究所, 北京 100094;
    2. 中物院高性能数值模拟软件中心, 北京 100088
  • 收稿日期:2016-01-22 修回日期:2016-03-07 出版日期:2016-09-25 发布日期:2016-09-25
  • 作者简介:李瑞(1987-),男,硕士,助理研究员,从事蒙特卡罗方法相关算法研究和程序研制,E-mail:li_rui@iapcm.ac.cn
  • 基金资助:
    能源局06专项(2015ZX06002008)及中国工程物理研究院院基金(2014B0202029)资助项目

Realization of Optimal Grid Searching in JMCT

LI Rui1,2, LI Gang1, ZHANG Baoyin1, DENG Li1, WANG Wei1   

  1. 1. Institute of Applied Physics and Computational Mathematics, Beijing 100094, China;
    2. CAEP Software Center for High Performance Numerical Simulation, Beijing 100088, China
  • Received:2016-01-22 Revised:2016-03-07 Online:2016-09-25 Published:2016-09-25

摘要: 分析连续能量点截面中子输运程序JMCT中区间查找的时间复杂度.针对主能量网格,裂变释放中子数和不可分辨共振网格进行区间映射加速,并以等差和等比序列网格为例,对比分析不同散列网格的质量.最后选择寿期初与寿期中燃料棒栅元的k问题进行对比测试.结果显示,对于核素数目较多的输运问题,优化查找策略具有很好的加速效果.

关键词: JMCT, 区间映射, 蒙特卡罗

Abstract: 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.

Key words: JMCT, region projecting, Monte Carlo

中图分类号: