Answers are grounded in this paper and cite their sources.
This paper presents a comprehensive code-to-code verification and experimental validation of BSOLVE, a newly developed burnup, depletion, and decay analysis code based on the multi-group Runge–Kutta–Fehlberg/Verner (RKF/V) integration method. Unlike conventional depletion solvers that rely on matrix-exponential or Chebyshev rational approximation method (CRAM)–based approaches, BSOLVE directly integrates the production–depletion Bateman equations, enabling automated adaptive error-controlled time stepping and efficient tracking of long nuclide chains in reactor burnup simulations with energy-dependent physics treatments. Code-to-code benchmarking using a standard pressurized water reactor (PWR) pin is performed against the Monte Carlo depletion code SERPENT2.1.30 (CRAM) and the SCALE6.2.4 T-DEPL sequence (coupling the deterministic neutron transport solver NEWT with the ORIGEN depletion module, denoted as SCALE-NEWT+ORIGEN). In addition, experimental validation is conducted using measured neutron flux data from the 1 MW(thermal) Washington State University (WSU) TRIGA reactor, providing an independent reference for assessing the fidelity of the depletion methodology in high-burnup TRIGA fuel. Benchmark results on a standard fresh PWR pin unit cell demonstrate that end-of-cycle system eigenvalues differ by approximately 3000 pcm between the conventional burnup solvers SCALE-NEWT+ORIGEN and SERPENT. In contrast, BSOLVE solutions compare well, falling directly in between the others, exhibiting differences of approximately 1600 pcm relative to both SCALE and SERPENT at end of cycle. Experimental comparisons further indicate good agreement between BSOLVE predictions and WSU reactor measurements; BSOLVE results yielded excess reactivity differences to within ~14% and neutron flux values that differed generally by less than 20% across experimental irradiation locations. These results demonstrate that BSOLVE provides stable, accurate, and competitive depletion predictions relative to other state-of-the-art deterministic and Monte Carlo–based tools, while offering a transparent and memory-efficient alternative to traditional matrix-based solvers. The numerical formulations, benchmarking methodology, and experimental validation procedures are presented and discussed herein.
No takes yet. Share an insight, caveat, or question.
Wang et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: