Transport Synthetic Acceleration Methods for One-dimensional Deterministic Transport Problems PDF Download

Author: William Daryl Hawkins
Publisher:
ISBN:
Category :
Languages : en
Pages : 160

View

Book Description

Author:
Publisher:
ISBN:
Category :
Languages : en
Pages :

View

Book Description
The linear Boltzmann transport equation (BTE) is an integro-differential equation arising in deterministic models of neutral and charged particle transport. In slab (one-dimensional Cartesian) geometry and certain higher-dimensional cases, Diffusion Synthetic Acceleration (DSA) is known to be an effective algorithm for the iterative solution of the discretized BTE. Fourier and asymptotic analyses have been applied to various idealizations (e.g., problems on infinite domains with constant coefficients) to obtain sharp bounds on the convergence rate of DSA in such cases. While DSA has been shown to be a highly effective acceleration (or preconditioning) technique in one-dimensional problems, it has been observed to be less effective in higher dimensions. This is due in part to the expense of solving the related diffusion linear system. We investigate here the effectiveness of a parallel semicoarsening multigrid (SMG) solution approach to DSA preconditioning in several three dimensional problems. In particular, we consider the algorithmic and implementation scalability of a parallel SMG-DSA preconditioner on several types of test problems.

Author: Bruno Roger Fernand Turcksin
Publisher:
ISBN:
Category :
Languages : en
Pages :

View

Book Description
In this dissertation, advanced numerical methods for highly forward peaked scattering deterministic calculations are devised, implemented, and assessed. Since electrons interact with the surrounding environment through Coulomb interactions, the scattering kernel is highly forward-peaked. This bears the consequence that, with standard preconditioning, the standard Legendre expansion of the scattering kernel requires too many terms for the discretized equation to be solved efficiently using a deterministic method. The Diffusion Synthetic Acceleration (DSA), usually used to speed up the calculation when the scattering is weakly anisotropic, is inefficient for electron transport. This led Morel and Manteuffel to develop a one-dimensional angular multigrid (ANMG) which has proved to be very effective when the scattering is highly anisotropic. Later, Pautz et al. generalized this scheme to multidimensional geometries, but this method had to be stabilized by a diffusive filter that degrades the overall convergence of the iterative scheme. In this dissertation, we recast the multidimensional angular multigrid method without the filter as a preconditioner for a Krylov solver. This new method is stable independently of the anisotropy of the scattering and is increasingly more effective and efficient as the anisotropy increases compared to DSA preconditioning wrapped inside a Krylov solver. At the coarsest level of ANMG, a DSA step is needed. In this research, we use the Modified Interior Penalty (MIP) DSA. This DSA was shown to be always stable on triangular cells with isotropic scattering. Because this DSA discretization leads to symmetric definite-positive matrices, it is usually solved using a conjugate gradient preconditioned (CG) by SSOR but here, we show that algebraic multigrid methods are vastly superior than more common CG preconditioners such as SSOR. Another important part of this dissertation is dedicated to transport equation and diffusion solves on arbitrary polygonal meshes. The advantages of polygonal cells are that the number of unknowns needed to mesh a domain can be decreased and that adaptive mesh refinement implementation is simplified: rather than handling hanging nodes, the adapted computational mesh includes different types of polygons. Numerical examples are presented for arbitrary quadrilateral and polygonal grids. The electronic version of this dissertation is accessible from http://hdl.handle.net/1969.1/148243

Author: American Nuclear Society
Publisher:
ISBN:
Category : Nuclear engineering
Languages : en
Pages : 788

View

Book Description

Author:
Publisher:
ISBN:
Category : Power resources
Languages : en
Pages : 490

View

Book Description

Author:
Publisher:
ISBN:
Category :
Languages : en
Pages :

View

Book Description
A class of acceleration schemes is investigated which resembles the conventional synthetic method in that they utilize the diffusion operator in the transport iteration schemes. The accelerated iteration involves alternate diffusion and transport solutions where coupling between the equations is achieved by using a correction term applied to either the diffusion coefficient, the removal cross section, or the source of the diffusion equation. The methods involving the modification of the diffusion coefficient and of the removal term yield nonlinear acceleration schemes and are used in k/sub eff/ calculations, while the source term modification approach is linear at least before discretization, and is used for inhomogeneous source problems. A careful analysis shows that there is a preferred differencing method which eliminates the previously observed instability of the conventional synthetic method. Use of this preferred difference scheme results in an acceleration method which is at the same time stable and efficient. This preferred difference approach renders the source correction scheme, which is linear in its continuous form, nonlinear in its differenced form. An additional feature of these approaches is that they may be used as schemes for obtaining improved diffusion solutions for approximately twice the cost of a diffusion calculation. Numerical experimentation on a wide range of problems in one and two dimensions indicates that improvement from a factor of two to ten over rebalance or Chebyshev acceleration is obtained. The improvement is most pronounced in problems with large regions of scattering material where the unaccelerated transport solutions converge very slowly.

Author: James J. Duderstadt
Publisher: John Wiley & Sons
ISBN:
Category : Science
Languages : en
Pages : 630

View

Book Description
Problems after each chapter

Author:
Publisher:
ISBN:
Category :
Languages : en
Pages :

View

Book Description
The standard iterative procedure for solving fixed-source discrete-ordinates problems converges very slowly for problems in optically large regions with scattering ratios c near unity. The diffusion-synthetic acceleration method has been proposed to make use of the fact that for this class of problems the diffusion equation is often an accurate approximation to the transport equation. However, stability difficulties have historically hampered the implementation of this method for general transport differencing schemes. In this article we discuss a recently developed procedure for obtaining unconditionally stable diffusion-synthetic acceleration methods for various transport differencing schemes. We motivate the analysis by first discussing the exact transport equation; then we illustrate the procedure by deriving a new stable acceleration method for the linear discontinuous transport differencing scheme. We also provide some numerical results.

Author: Jacques Tagoudjeu
Publisher: Universal-Publishers
ISBN: 1599423960
Category : Mathematics
Languages : en
Pages : 161

View

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: Yousry Azmy
Publisher: Springer Science & Business Media
ISBN: 9048134110
Category : Technology & Engineering
Languages : en
Pages : 476

View

Book Description
Nuclear engineering has undergone extensive progress over the years. In the past century, colossal developments have been made and with specific reference to the mathematical theory and computational science underlying this discipline, advances in areas such as high-order discretization methods, Krylov Methods and Iteration Acceleration have steadily grown. Nuclear Computational Science: A Century in Review addresses these topics and many more; topics which hold special ties to the first half of the century, and topics focused around the unique combination of nuclear engineering, computational science and mathematical theory. Comprising eight chapters, Nuclear Computational Science: A Century in Review incorporates a number of carefully selected issues representing a variety of problems, providing the reader with a wealth of information in both a clear and concise manner. The comprehensive nature of the coverage and the stature of the contributing authors combine to make this a unique landmark publication. Targeting the medium to advanced level academic, this book will appeal to researchers and students with an interest in the progression of mathematical theory and its application to nuclear computational science.