Abstract
This paper elucidates a comprehensive derivation of the variational formulation pertaining to the static and spatial kinetics self-adjoint angular flux (SAAF) neutron transport equation. The methodology employed for discretization of the spatial variable is the finite element method, while the energy group discretization is executed via the group method, and the directional discretization is conducted using the discrete ordinates method. Analytic expressions for the discretization to variable separation under both vacuum and reflective boundary conditions are furnished. Constructed upon the MOOSE framework, a code designated as SAAFCGSN has been developed for the resolution of the SAAF neutron transport equation. The zero-order scattering matrix within this computational framework is managed through an innovative "decoupling" method, thereby enhancing the computational efficiency significantly. The functionality and robustness of the SAAFCGSN code are corroborated through meticulous evaluation involving seven distinct steady-state scenarios as well as two transient states. Empirical outcomes verify the compatibility of the SAAFCGSN code with both structured and unstructured mesh, inclusive of their amalgamations, thus facilitating maintenance and ensuring elevated computational accuracy. In addition, a performance analysis benchmarked against IAEA standards reveals that the adoption of the scattering matrix "decoupling" method propels a computational speed increase exceeding 30 %, signifying a notable advancement in calculation efficiency.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.