Abstract
The neutron kinetics equations belong to the class of stiff equations for numerical time integration schemes. In this work, the accuracy and speed of algorithms based on backward differentiation formulas (BDFs) are studied with regard to point and spatial neutron kinetics problems. Using a BDF algorithm with the automatic selection of time step and order, solutions to a number of model problems with both a positive and negative reactivity insertion are analyzed. Plots of numerical cost dependences on local and global errors are presented. The results indicate that algorithms based on BDFs are highly efficient and that their application to nuclear reactor simulation is justified.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
