本文讨论中子迁移方程Ａｕ＝Ｆ的数值方法，这里Ａ是迁移算子，Ａ＝Ｂ＋Ｊ，而，是中子运动方向单位矢量，是梯度算子，Ｉ是恒等算子，σ是横截面积，Ｊ是积分算子，Ｆ是外中子源，本文提出上述方程的迭代算法：Ｂ－ｕ（ｎ＋１）＝－Ｊｕ（ｎ）＋Ｆ，结合不连续Ｇａｌｅｒｋｉｎ方法给出迭代有限元算法，讨论了算法的收敛性和误差估计，给出计算实例。理论分析和计算结果表明此方法结构简单，计算方便和精度较高。 In this paper, we discuss the numerical method for the neutron migration equation Au = F, where A is the migration operator, A = B + J, and is the neutron movement direction unit vector, is the gradient operator, I is the identity operator, and σ is the cross- Area, J is an integral operator, and F is an external neutron source. In this paper, an iterative algorithm of the above equation is proposed: B-u (n + 1) = - Ju (n) + F, and the iterative finite element method is given in conjunction with the discontinuous Galerkin method The convergence and error estimation of the algorithm are given, and the calculation examples are given. Theoretical analysis and calculation results show that this method has the advantages of simple structure, convenient calculation and high accuracy.