®®®® SIIA Público

Título del libro: International Conference On Physics Of Reactors, Physor 2018: Reactor Physics Paving The Way Towards More Efficient Systems
Título del capítulo: An alternative algorithm for the linearization process of transmutation and decay networks

Autores UNAM:
JUAN LUIS FRANCOIS LACOUTURE;
Autores externos:

Idioma:

Año de publicación:
2018
Palabras clave:

Differential equations; Nuclear reactors; Alternative algorithms; Computational time; Coupled systems; Depth-First-Search (DFS); First order differential equation; Linearization process; Matrix exponentials; Network information; Pavements


Resumen:

To modelling the changes occurring in the nuclear reactor's composition during its operation, it is necessary to solve a coupled system of first order differential equations, known as the Bateman Equations. Nowadays, there are two main methods to accomplish this task: the linear chain method and the matrix exponential method. The general procedure for the linear chain method consists in breaking a transmutation network into independent depletion chains (also known as "linear chains") and then solving each one analytically. The common way to build these linear chains is using a Depth-First-Search (DFS) algorithm, which consists in finding every possible path in a network, tracking the decay and transmutation reaction for a set of isotopes until one stable appears or there is no more information to continue. At this point, the algorithm moves backwards searching a branch or an untraveled path, and then the procedure is repeated. In the present work, an alternative new algorithm for building linear chains is developed, which uses a special notation and reduces the problem of find paths to the problem of ordering a sequence of characters (known as string in computer science). The proposed notation allows summarizing the transmutation network information in a single line. Unlike the DFS, the algorithm developed has not a backward routine, but it has a "fill" procedure instead. The last property decreases the computational time spent in build linear chains, and is useful with cyclic chains. Our empirical results show that our proposed algorithm builds linear chains faster than DFS. © 2018 International Conference on Physics of Reactors, PHYSOR 2018: Reactor Physics Paving the Way Towards More Efficient Systems. All rights reserved.


Entidades citadas de la UNAM: