JCOGIN粒子追踪算法优化  

Optimization for Particle Tracking Algorithm of JCOGIN

作　　者：王鑫 邓力[1] 李刚[1] 付元光[1,2] 李瑞 张宝印[1] WANG Xin;DENG Li;LI Gang;FU Yuanguang;LI Rui;ZHANG Baoyin(Institute of Applied Physics and Computational Mathematics,Beijing 100088,China;CAEP Software Center for High Performance Numerical Simulation,Beijing 100088,China)

机构地区：[1]北京应用物理与计算数学研究所,北京100088 [2]中物院高性能数值模拟软件中心,北京100088

出　　处：《原子能科学技术》2018年第8期1530-1536,共7页Atomic Energy Science and Technology

基　　金：国家重点研发计划高性能计算重点专项资助项目(2016YFB0201303);能源局重大专项子项资助项目(2015ZX06002008)

摘　　要：本文分析了多种先进蒙特卡罗程序的CSG粒子追踪算法,对JCOGIN粒子追踪模块进行了优化。粒子定位算法采取了边界粒子定位和源粒子位置预估,能减少一定量的粒子定位计算;径迹求交算法采取了安全距离优化和布尔二叉树展开,其中安全距离优化可减少电子输运径迹求交次数,布尔二叉树展开能使布尔体求交算法的时间复杂度降为O(n)。应用4个典型算例测试了优化效果,结果表明,粒子定位算法优化对于一般问题具有一定的优化效果,安全距离优化显著提升了电子输运效率,布尔二叉树展开大幅提升了JMCT对于非规则复杂几何的计算速度。The latest optimizations for particle tracking algorithms of JCOGIN were presented in this paper.Boundary particle locating and position estimation of source particles optimizations were adopted for particle locating algorithm,which can reduce a certain amount of particle locating calculations.Safety distance optimization and Boolean binary tree expanding method were applied in intersection algorithm.The safety distance optimization can reduce the intersection calculation frequency of electron transport,and the time complexity of Boolean solids intersection algorithm is cut down to O（n）by using the Boolean binary tree expanding method.Four typical models were used to verify the optimization effect.The optimizations of particle locating algorithm have a certain effect on general problems.The safety distance optimization significantly enhances the electron transport efficiency,and the Boolean binary tree expanding method greatly improves the calculation speed of JMCT for irregular and complex geometries.

关 键 词：JCOGIN 粒子追踪 算法优化 布尔二叉树展开 

分 类 号：TL32[核科学技术—核技术及应用]