An Axial Polynomial Expansion and Acceleration of the Characteristics Method for the Solution of the Neutron Transport Equation PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download An Axial Polynomial Expansion and Acceleration of the Characteristics Method for the Solution of the Neutron Transport Equation PDF full book. Access full book title An Axial Polynomial Expansion and Acceleration of the Characteristics Method for the Solution of the Neutron Transport Equation by Laurent Graziano. Download full books in PDF and EPUB format.
Author: Laurent Graziano Publisher: ISBN: Category : Languages : en Pages : 0
Book Description
The purpose of this PhD is the implementation of an axial polynomial approximation in a three-dimensional Method Of Characteristics (MOC) based solver. The context of the work is the solution of the steady state Neutron Transport Equation for critical systems, and the practical implementation has been realized in the Two/three Dimensional Transport (TDT) solver, as a part of the APOLLO3® project. A three-dimensional MOC solver for 3D extruded geometries has been implemented in this code during a previous PhD project, relying on a piecewise constant approximation for the neutrons fluxes and sources. The developments presented in the following represent the natural continuation of this work. Three-dimensional neutron transport MOC solvers are able to produce accurate results for complex geometries. However accurate, the computational cost associated to this kind of solvers is very important. An axial polynomial representation of the neutron angular fluxes has been used to lighten this computational burden.The work realized during this PhD can be considered divided in three major parts: transport, acceleration and others. The first part is constituted by the implementation of the chosen polynomial approximation in the transmission and balance equations typical of the Method Of Characteristics. This part was also characterized by the computation of a set of numerical coefficients which revealed to be necessary in order to obtain a stable algorithm. During the second part, we modified and implemented the solution of the equations of the DPN synthetic acceleration. This method was already used for the acceleration of both inners and outers iteration in TDT for the two and three dimensional solvers at the beginning of this work. The introduction of a polynomial approximation required several equations manipulations and associated numerical developments. In the last part of this work we have looked for the solutions of a mixture of different issues associated to the first two parts. Firstly, we had to deal with some numerical instabilities associated to a poor numerical spatial or angular discretization, both for the transport and for the acceleration methods. Secondly, we tried different methods to reduce the memory footprint of the acceleration coefficients. The approach that we have eventually chosen relies on a non-linear least square fitting of the cross sections dependence of such coefficients. The default approach consists in storing one set of coefficients per each energy group. The fit method allows replacing this information with a set of coefficients computed during the regression procedure that are used to re-construct the acceleration matrices on-the-fly. This procedure of course adds some computational cost to the method, but we believe that the reduction in terms of memory makes it worth it.In conclusion, the work realized has focused on applying a simple polynomial approximation in order to reduce the computational cost and memory footprint associated to a Method Of Characteristics solver used to compute the neutron fluxes in three dimensional extruded geometries. Even if this does not a constitute a radical improvement, the high order approximation that we have introduced allows a reduction in terms of memory and computational times of a factor between 2 and 5, depending on the case. We think that these results will constitute a fertile base for further improvements.
Author: Laurent Graziano Publisher: ISBN: Category : Languages : en Pages : 0
Book Description
The purpose of this PhD is the implementation of an axial polynomial approximation in a three-dimensional Method Of Characteristics (MOC) based solver. The context of the work is the solution of the steady state Neutron Transport Equation for critical systems, and the practical implementation has been realized in the Two/three Dimensional Transport (TDT) solver, as a part of the APOLLO3® project. A three-dimensional MOC solver for 3D extruded geometries has been implemented in this code during a previous PhD project, relying on a piecewise constant approximation for the neutrons fluxes and sources. The developments presented in the following represent the natural continuation of this work. Three-dimensional neutron transport MOC solvers are able to produce accurate results for complex geometries. However accurate, the computational cost associated to this kind of solvers is very important. An axial polynomial representation of the neutron angular fluxes has been used to lighten this computational burden.The work realized during this PhD can be considered divided in three major parts: transport, acceleration and others. The first part is constituted by the implementation of the chosen polynomial approximation in the transmission and balance equations typical of the Method Of Characteristics. This part was also characterized by the computation of a set of numerical coefficients which revealed to be necessary in order to obtain a stable algorithm. During the second part, we modified and implemented the solution of the equations of the DPN synthetic acceleration. This method was already used for the acceleration of both inners and outers iteration in TDT for the two and three dimensional solvers at the beginning of this work. The introduction of a polynomial approximation required several equations manipulations and associated numerical developments. In the last part of this work we have looked for the solutions of a mixture of different issues associated to the first two parts. Firstly, we had to deal with some numerical instabilities associated to a poor numerical spatial or angular discretization, both for the transport and for the acceleration methods. Secondly, we tried different methods to reduce the memory footprint of the acceleration coefficients. The approach that we have eventually chosen relies on a non-linear least square fitting of the cross sections dependence of such coefficients. The default approach consists in storing one set of coefficients per each energy group. The fit method allows replacing this information with a set of coefficients computed during the regression procedure that are used to re-construct the acceleration matrices on-the-fly. This procedure of course adds some computational cost to the method, but we believe that the reduction in terms of memory makes it worth it.In conclusion, the work realized has focused on applying a simple polynomial approximation in order to reduce the computational cost and memory footprint associated to a Method Of Characteristics solver used to compute the neutron fluxes in three dimensional extruded geometries. Even if this does not a constitute a radical improvement, the high order approximation that we have introduced allows a reduction in terms of memory and computational times of a factor between 2 and 5, depending on the case. We think that these results will constitute a fertile base for further improvements.
Author: Daniele Sciannandrone Publisher: ISBN: Category : Languages : en Pages : 0
Book Description
The topic of our research is the application of the Method of Long Characteristics (MOC) to solve the Neutron Transport Equation in three-dimensional axial geometries. The strength of the MOC is in its precision and versatility. As a drawback, it requires a large amount of computational resources. This problem is even more severe in three-dimensional geometries, for which unknowns reach the order of tens of billions for assembly-level calculations.The first part of the research has dealt with the development of optimized tracking and reconstruction techniques which take advantage of the regularities of three-dimensional axial geometries. These methods have allowed a strong reduction of the memory requirements and a reduction of the execution time of the MOC calculation.The convergence of the iterative scheme has been accelerated with a lower-order transport operator (DPN) which is used for the initialization of the solution and for solving the synthetic problem during MOC iterations.The algorithms for the construction and solution of the MOC and DPN operators have been accelerated by using shared-memory parallel paradigms which are more suitable for standard desktop working stations. An important part of this research has been devoted to the implementation of scheduling techniques to improve the parallel efficiency.The convergence of the angular quadrature formula for three-dimensional cases is also studied. Some of these formulas take advantage of the reduced computational costs of the treatment of planar directions and the vertical direction to speed up the algorithm.The verification of the MOC solver has been done by comparing results with continuous-in-energy Monte Carlo calculations. For this purpose a coupling of the 3D MOC solver with the Subgroup method is proposed to take into account the effects of cross sections resonances. The full calculation of a FBR assembly requires about 2 hours of execution time with differences of few PCM with respect to the reference results.We also propose a higher order scheme of the MOC solver based on an axial polynomial expansion of the unknown within each mesh. This method allows the reduction of the meshes (and unknowns) by keeping the same precision.All the methods developed in this thesis have been implemented in the APOLLO3 version of the neutron transport solver TDT.
Author: Jacques Tagoudjeu Publisher: Universal-Publishers ISBN: 1599423960 Category : Mathematics Languages : en Pages : 161
Book Description
This thesis focuses on iterative methods for the treatment of the steady state neutron transport equation in slab geometry, bounded convex domain of Rn (n = 2,3) and in 1-D spherical geometry. We introduce a generic Alternate Direction Implicit (ADI)-like iterative method based on positive definite and m-accretive splitting (PAS) for linear operator equations with operators admitting such splitting. This method converges unconditionally and its SOR acceleration yields convergence results similar to those obtained in presence of finite dimensional systems with matrices possessing the Young property A. The proposed methods are illustrated by a numerical example in which an integro-differential problem of transport theory is considered. In the particular case where the positive definite part of the linear equation operator is self-adjoint, an upper bound for the contraction factor of the iterative method, which depends solely on the spectrum of the self-adjoint part is derived. As such, this method has been successfully applied to the neutron transport equation in slab and 2-D cartesian geometry and in 1-D spherical geometry. The self-adjoint and m-accretive splitting leads to a fixed point problem where the operator is a 2 by 2 matrix of operators. An infinite dimensional adaptation of minimal residual and preconditioned minimal residual algorithms using Gauss-Seidel, symmetric Gauss-Seidel and polynomial preconditioning are then applied to solve the matrix operator equation. Theoretical analysis shows that the methods converge unconditionally and upper bounds of the rate of residual decreasing which depend solely on the spectrum of the self-adjoint part of the operator are derived. The convergence of theses solvers is illustrated numerically on a sample neutron transport problem in 2-D geometry. Various test cases, including pure scattering and optically thick domains are considered.
Author: Publisher: ISBN: Category : Languages : en Pages : 27
Book Description
The neutron transport equation in Cartesian geometry possesses straight line characteristics along which the streaming operator can be written as a full differential in terms of the characteristic length. This idea was used by Lathrop to develop the step characteristic method, which he showed to be positive definite but less accurate than conventional Diamond-Difference schemes. Several authors since then have developed new methods utilizing the characteristic curves (including non-Cartesian geometry). A Linear Characteristic Method, based on a more consistent linear representation of the incoming-surface and within-cell angular flux, has been developed and tested in two-dimensional geometry producing highly accurate and computationally efficient results. A similar linear method, with several modifications, was developed for three-dimensional Cartesian geometry, and implemented in ORNL's production code TORT. In this paper is presented a fully consistent, two-dimensional Cartesian geometry, general order characteristic method, in the same spirit as the previously developed, general order nodal method. Preliminary tests and numerical error analysis of the new method for orders up to five are also presented.
Author: JOSE FELIPPE BEAKLINI FILHO Publisher: ISBN: Category : Languages : en Pages : 205
Book Description
The feasibility and practical implementation of axial expansion methods for the solution of the multi-dimensional multigroup neutron diffusion (MGD) equations is investigated.
Author: Publisher: ISBN: Category : Languages : en Pages : 106
Book Description
A method for applying the discrete ordinates method for solution of the neutron transport equation in arbitary two-dimensional meshes has been developed. The finite difference approach normally used to approximate spatial derivatives in extrapolating angular fluxes across a cell is replaced by direct solution of the characteristic form of the transport equation for each discrete direction. Thus, computational cells are not restricted to the traditional shape of a mesh element within a given coordinate system. However, in terms of the treatment of energy and angular dependencies, this method resembles traditional discrete ordinates techniques. Using the method developed here, a general two-dimensional space can be approximated by an irregular mesh comprised of arbitrary polygons. The present work makes no assumptions about the orientations or the number of sides in a given cell, and computes all geometric relationships between each set of sides in each cell for each discrete direction. A set of non-reentrant polygons can therefore be used to represent any given two dimensional space. Results for a number of test problems have been compared to solutions obtained from traditional methods, with good agreement. Comparisons include benchmarks against analytical results for problems with simple geometry, as well numerical results obtained from traditional discrete ordinates methods by applying the ANISN and TWOTRAN computer programs. Numerical results were obtained for problems ranging from simple one-dimensional geometry to complicated multidimensional configurations. These results have demonstrated the ability of the developed method to closely approximate complex geometrical configurations and to obtain accurate results for problems that are extremely difficult to model using traditional methods.
Author: Charles Dawson Publisher: ISBN: Category : Languages : en Pages : 23
Book Description
The steady-state neutron transport equation for slab geometry is expanded in Legendre polynomials. The expansion is truncated after the third term (P sub 2 equations) and then is modified in an attempt to reduce the truncation error. The resulting equations are, for many problems, a better approximation to the neutron transport equation than the P sub 2 equations or the standard diffusion equations. The method is extended to two and three dimensions by a simplified form of the spherical expansion to the neutron transport equation. Sample results are given. (Author).
Author: Laurent Graziano
Author: Laurent Graziano
Author: Daniele Sciannandrone
Author: Jacques Tagoudjeu
Author: R. C. Gast
Author: 
Author: JOSE FELIPPE BEAKLINI FILHO
Author: 
Author: 
Author: Charles Dawson
Author: