Search

Determination of the reactor kinetic characteristics is very important for the design and development of a new reactor system. In this sense, the computation of lambda modes associated to a nuclear power reactor has interest since these modes can be used to analyze the reactor criticality and to develop modal methods to analyze transient situations in the reactor. In this paper, the lambda problem has been discretized using a high order finite element method to obtain a generalized algebraic eigenvalue problem. A multilevel method is proposed to solve this generalized eigenvalue problem combining a hierarchy of meshes with a Modified Block Newton method. The Krylov-Schur method is used to compare the efficiency of the multilevel method solving several benchmark problems.

The early detection of anomalies through the analysis of the neutron noise recorded by incore and ex-core instrumentation gives the possibility to take proper actions before such problems lead to safety concerns or impact plant availability. The study of the neutron fluctuations permits to detect and differentiate anomalies depending on their type and possibly to characterize and localize such anomalies. This method is non-intrusive and does not require any external perturbation of the system. To effectively use the neutron noise for reactor diagnostics it is essential to accurately model the effects of the anomalies on the neutron field. This paper deals with the development and validation of a neutron noise simulator for reactors with different geometries. The neutron noise is obtained by solving the frequency-domain two-group neutron diffusion equation in the first order approximation. In order to solve this partial differential equation a code based on a high order finite element method is developed. The novelty of this simulator resides on the possibility of dealing with rectangular meshes in any kind of geometry, thus allowing for complex domains and any location of the perturbation. The finite element method also permits automatic refinements in the cell size (h-adaptability) and in its polynomial degree (p-adaptability) that lead to a fast convergence. In order to show the possibilities of the neutron noise simulator developed a perturbation in a hexagonal two-dimensional reactor is investigated in this paper.

The distribution of the power inside a reactor core can be described by the time dependent multigroup neutron diffusion equation. One of the approaches to integrate this time-dependent equation is the modal method, that assumes that the solution can be described by the sum of amplitude function multiplied by shape functions of modes. These shape functions can be computed by solving a _-modes problems. The modal method has a great interest when the distribution of the power cannot be well approximated by only one shape function, mainly, when local perturbations are applied during the transient. Usually, the shape functions of the modal methods are updated for the time-dependent equations with a constant time-step size to obtain accurate results. In this work, we propose a modal methodology with an adaptive control time-step to update the eigenfunctions associated with the modes. This algorithm improves efficiency because of time is not spent solving the systems to a level of accuracy beyond relevance and reduces the step size if they detect a numerical instability. Step size controllers require an error estimation. Different error estimations are considered and analyzed in a benchmark problem with a out of phase local perturbation.

The time-dependent neutron diffusion equation approximates the neutronic power evolution inside a nuclear reactor core. Applying a Galerkin finite element method for the spatial discretization of these equations leads to a stiff semi-discrete system of ordinary differential equations. For time discretization, an implicit scheme is used, which implies solving a large and sparse linear system of equations for each time step. The GMRES method is used to solve these systems because of its fast convergence when a suitable preconditioner is provided. This work explores several matrix-free strategies based on different updated preconditioners, which are constructed by low-rank updates of a given initial preconditioner. They are two tuned preconditioners based on the bad and good Broyden's methods, initially developed for nonlinear equations and optimization problems, and spectral preconditioners. The efficiency of the resulting preconditioners under study is closely related to the selection of the subspace used to construct the update. Our numerical results show the effectiveness of these methodologies in terms of CPU time and storage for different nuclear benchmark transients, even if the initial preconditioner is not good enough. [ABSTRACT FROM AUTHOR]