We analyze domain decomposition and priority queuing algorithms for neutron transport equations with 2-D cylindrical geometry. A domain decomposition method based on the lowest surface-to-volume aspect and a corresponding priority queuing algorithm are proposed.Numerical experiments indicate that the method exhibits perfect speedup with hundreds of processors on parallel computers with high network latency.

A numerical method for solving the neutron transport problem (isotropic and anisotropic) in two-dimensional cylindrical geometry is presented. Results from numerical calculation are given. In comparision with SN and the discontinuous finite element method and the experiments the method is satisfactory.