Comparison and research on the GRAVEL and PRIP algorithms of neutron energy spectrum unfolding

作     者：Guan-ying Wang Ran Han Jin-liang Liu Xiao-ping Ouyang Jin-cheng He Jun-yao Yan 

作者机构：North China Electric Power UniversityBeijing 102206China Beijing Institute of Spacecraft Environment EngineeringBeijing 100029China Northwest Institute of Nuclear TechnologyXi’an 710024ShaanxiChina 

出 版 物：《Radiation Detection Technology and Methods》 (辐射探测技术与方法（英文）)

年 卷 期：2017年第1卷第2期

页      面：15-20页

学科分类：07[理学] 070202[理学-粒子物理与原子核物理] 0702[理学-物理学] 

基　　金：Financial supports from the Fundamental Research Funds for the Central Universities(No.2016XS61) National Natural Science Foundation of China(No.1150050900) the Opening Foundation of State Key Laboratory of Intense Pulsed Radiation Simulation and Effect are gratefully acknowledged 

主　　题：Neutron energy spectrum Unfolding Geant4 PRIP algorithm GRAVEL algorithm 

摘      要：Objective Neutron energy spectrum unfolding is a key technique for neutron *** is essentially an inversion *** GRAVEL algorithm has been widely used in this field,and the PRIP algorithm transforms neutron energy spectrum unfolding into a typical nonnegative linear complementarity problem and solves it by interior point algorithm for potential *** These two algorithms are applied to unfold several different neutron energy test spectra and actual D-T fusion neutron energy *** and Conclusion By comparison,it can be concluded that the PRIP algorithm is highly computationally efficient and fast converging,and the GRAVEL algorithm solution results match up more with the expected results.