Abstract

The aim of this work is to develop a coarse mesh treatment strategy using adaptive polynomial, p, refinement approach for average current nodal expansion method in order to solve the neutron diffusion equation. For performing the adaptive solution process, a posteriori error estimation scheme, i.e. flux gradient has been utilized for finding the probable numerical errors. The high net leakage in a node represents flux gradient existence between neighbor nodes and it may indicate the source of errors for the coarse mesh calculation. Therefore, the relative Cartesian directional net leakage of nodes is considered as an assessment criterion for mesh refinement in a sub-domain. In our proposed approach, the zeroth order nodal expansion solution is used along coarse meshes as large as fuel assemblies to treat neutron populations. Coarse nodes with high directional net leakage may be chosen for implementing higher order polynomial expansion in the corresponding direction, i.e. X and/or Y and/or Z Cartesian directions. Using this strategy, the computational cost and time are reduced relative to uniform high order polynomial solution. In order to demonstrate the efficiency of this approach, a computer program, APNEC, Adaptive P-refinement Nodal Expansion Code, has been developed for solving the neutron diffusion equation using various orders of average current nodal expansion method in 3D rectangular geometry. Some well-known benchmarks are investigated to compare the uniform and adaptive solutions. Results demonstrate the superiority of our proposed strategy in enhancing the accuracy of solution without using uniform high order solution throughout the domain and increasing the number of unknowns.

Full Text
Paper version not known

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 call

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.