Analytical representation of the solution of the space kinetic diffusion equation in a one-dimensional and homogeneous domain
In this work we solve the space kinetic diffusion equation in a one-dimensional geometry considering a homogeneous domain, for two energy groups and six groups of delayed neutron precursors. The proposed methodology makes use of a Taylor expansion in the space variable of the scalar neutron flux (fa...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2019 |
| País: | Brasil |
| Institución: | Universidade Federal do Rio Grande do Sul (UFRGS) |
| Repositorio: | Repositório Institucional da UFRGS |
| Idioma: | inglés |
| OAI Identifier: | oai:www.lume.ufrgs.br:10183/259737 |
| Acceso en línea: | http://hdl.handle.net/10183/259737 |
| Access Level: | acceso abierto |
| Palabra clave: | Difusão de nêutrons Método da decomposição de Adomian Neutron diffusion equation Taylor series Modified Adomian decomposition method |
| Sumario: | In this work we solve the space kinetic diffusion equation in a one-dimensional geometry considering a homogeneous domain, for two energy groups and six groups of delayed neutron precursors. The proposed methodology makes use of a Taylor expansion in the space variable of the scalar neutron flux (fast and thermal) and the concentration of delayed neutron precursors, allocating the time dependence to the coefficients. Upon truncating the Taylor series at quadratic order, one obtains a set of recursive systems of ordinary differential equations, where a modified decomposition method is applied. The coefficient matrix is split into two, one constant diagonal matrix and the second one with the remaining time dependent and off-diagonal terms. Moreover, the equation system is reorganized such that the terms containing the latter matrix are treated as source terms. Note, that the homogeneous equation system has a well known solution, since the matrix is diagonal and constant. This solution plays the role of the recursion initialization of the decomposition method. The recursion scheme is set up in a fashion where the solutions of the previous recursion steps determine the source terms of the subsequent steps. A second feature of the method is the choice of the initial and boundary conditions, which are satisfied by the recursion initialization, while from the first recursion step onward the initial and boundary conditions are homogeneous. The recursion depth is then governed by a prescribed accuracy for the solution. |
|---|