Development of time-dependent reaction rates to optimise predictor–corrector algorithm in ALEPH burn-up code
- 1. Université Libre de Bruxelles, ULB, Avenue Franklin Roosevelt 50, 1050 Bruxelles (Belgium)
- 2. Institute of Advanced Nuclear Systems, SCK-CEN, Boeretang 200, 2400 Mol (Belgium)
Description
Highlights: • A new feature for the ALEPH burn-up Monte Carlo codes is proposed. • This technique optimises the depletion algorithm by using time-dependent matrices. • Trend curves are used to predict the matrix coefficients along some burn-up steps. • In the same burn-up steps the most time-consuming part MCNP is skipped. • The computational time is decisively reduced without any worsening on the outcomes. - Abstract: Shells coupling Monte-Carlo transport and deterministic depletion codes are extensively used in the nuclear field to simulate material changes throughout irradiation. The dynamic behaviour of the phenomenon is described by the system of coupled ordinary differential equations, with generally a stiff matrix of coefficients that current codes keep constant in time along each burn-up interval. The matrix coefficients represent decay constants and microscopic reaction rates of the numerous nuclides involved in the calculations. For a typical burn-up problem, their determination consumes most of the required computational time while only a small fraction is spent by the depletion solver. Predictor–corrector methods have been implemented to guarantee more accurate results, but not much has been done to overcome the running time issue. This work presents a unique and innovative feature of the ALEPH Monte-Carlo burn-up code which optimises the depletion algorithm by using time-dependent matrix coefficients. Linear polynomials interpolate the evolution of the matrix coefficients along a few consecutive time steps. Then, trend curves are constructed and used to extrapolate the effective reaction rates in the following intervals, thus reducing the total required computational time spent in the neutronic calculations. This technique has been implemented in the version 2 of the ALEPH Monte-Carlo burn-up code and validated against the REBUS experimental benchmark. The results revealed a considerable computational time saving without any drawbacks in the accuracy
Availability note (English)
Available from http://dx.doi.org/10.1016/j.anucene.2013.05.046Additional details
Identifiers
- DOI
- 10.1016/j.anucene.2013.05.046;
- PII
- S0306-4549(13)00311-3;
Publishing Information
- Journal Title
- Annals of Nuclear Energy (Oxford)
- Journal Volume
- 62
- Journal Page Range
- p. 307-315
- ISSN
- 0306-4549
- CODEN
- ANENDJ
INIS
- Country of Publication
- United Kingdom
- Country of Input or Organization
- International Atomic Energy Agency (IAEA)
- INIS RN
- 46063396
- Subject category
- S97: MATHEMATICAL METHODS AND COMPUTING;
- Descriptors DEI
- ACCURACY; ALGORITHMS; BENCHMARKS; BURNUP; DIFFERENTIAL EQUATIONS; MATRICES; MONTE CARLO METHOD; POLYNOMIALS; REACTION KINETICS; TIME DEPENDENCE
- Descriptors DEC
- CALCULATION METHODS; EQUATIONS; FUNCTIONS; KINETICS; MATHEMATICAL LOGIC
Optional Information
- Copyright
- Copyright (c) 2013 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved.