Parallel Monte Carlo Synthetic Acceleration Methods for Discrete Transport Problems


Book Description

This work researches and develops Monte Carlo Synthetic Acceleration (MCSA) methods as a new class of solution techniques for discrete neutron transport and fluid flow problems. Monte Carlo Synthetic Acceleration methods use a traditional Monte Carlo process to approximate the solution to the discrete problem as a means of accelerating traditional fixed-point methods. To apply these methods to neutronics and fluid flow and determine the feasibility of these methods on modern hardware, three complementary research and development exercises are performed. First, solutions to the SPN discretization of the linear Boltzmann neutron transport equation are obtained using MCSA with a difficult criticality calculation for a light water reactor fuel assembly used as the driving problem. To enable MCSA as a solution technique a group of modern preconditioning strategies are researched. MCSA when compared to conventional Krylov methods demonstrated improved iterative performance over GMRES by converging in fewer iterations when using the same preconditioning. Second, solutions to the compressible Navier-Stokes equations were obtained by developing the Forward-Automated Newton-MCSA (FANM) method for nonlinear systems based on Newton's method. Three difficult fluid benchmark problems in both convective and driven flow regimes were used to drive the research and development of the method. For 8 out of 12 benchmark cases, it was found that FANM had better iterative performance than the Newton-Krylov method by converging the nonlinear residual in fewer linear solver iterations with the same preconditioning. Third, a new domain decomposed algorithm to parallelize MCSA aimed at leveraging leadership-class computing facilities was developed by utilizing parallel strategies from the radiation transport community. The new algorithm utilizes the Multiple-Set Overlapping-Domain strategy in an attempt to reduce parallel overhead and add a natural element of replication to the algorithm. It was found that for the current implementation of MCSA, both weak and strong scaling improved on that observed for production implementations of Krylov methods.




NEUTRON TRANSPORT, DIFFUSION, AND DIFFUSION SYNTHETIC ACCELERATION METHODS FOR PARALLEL ARCHITECTURE COMPUTERS.


Book Description

performance of the new multigrid method degrades with an increasing number of processors, not because of the degradation in the convergence rate, but because of the domination of communication overhead and unemployment of some processors on the coarse grids.




Monte Carlo Principles and Neutron Transport Problems


Book Description

This two-part treatment introduces the general principles of the Monte Carlo method within a unified mathematical point of view, applying them to problems in neutron transport. It describes several efficiency-enhancing approaches, including the method of superposition and simulation of the adjoint equation based on reciprocity. The first half of the book presents an exposition of the fundamentals of Monte Carlo methods, examining discrete and continuous random walk processes and standard variance reduction techniques. The second half of the text focuses directly on the methods of superposition and reciprocity, illustrating their applications to specific neutron transport problems. Topics include the computation of thermal neutron fluxes and the superposition principle in resonance escape computations.







Monte Carlo Methods for Particle Transport


Book Description

Fully updated with the latest developments in the eigenvalue Monte Carlo calculations and automatic variance reduction techniques and containing an entirely new chapter on fission matrix and alternative hybrid techniques. This second edition explores the uses of the Monte Carlo method for real-world applications, explaining its concepts and limitations. Featuring illustrative examples, mathematical derivations, computer algorithms, and homework problems, it is an ideal textbook and practical guide for nuclear engineers and scientists looking into the applications of the Monte Carlo method, in addition to students in physics and engineering, and those engaged in the advancement of the Monte Carlo methods. Describes general and particle-transport-specific automated variance reduction techniques Presents Monte Carlo particle transport eigenvalue issues and methodologies to address these issues Presents detailed derivation of existing and advanced formulations and algorithms with real-world examples from the author’s research activities




Computational Methods in Transport


Book Description

Thereexistawiderangeofapplicationswhereasigni?cantfractionofthe- mentum and energy present in a physical problem is carried by the transport of particles. Depending on the speci?capplication, the particles involved may be photons, neutrons, neutrinos, or charged particles. Regardless of which phenomena is being described, at the heart of each application is the fact that a Boltzmann like transport equation has to be solved. The complexity, and hence expense, involved in solving the transport problem can be understood by realizing that the general solution to the 3D Boltzmann transport equation is in fact really seven dimensional: 3 spatial coordinates, 2 angles, 1 time, and 1 for speed or energy. Low-order appro- mations to the transport equation are frequently used due in part to physical justi?cation but many in cases, simply because a solution to the full tra- port problem is too computationally expensive. An example is the di?usion equation, which e?ectively drops the two angles in phase space by assuming that a linear representation in angle is adequate. Another approximation is the grey approximation, which drops the energy variable by averaging over it. If the grey approximation is applied to the di?usion equation, the expense of solving what amounts to the simplest possible description of transport is roughly equal to the cost of implicit computational ?uid dynamics. It is clear therefore, that for those application areas needing some form of transport, fast, accurate and robust transport algorithms can lead to an increase in overall code performance and a decrease in time to solution.







Monte Carlo Particle Transport Methods


Book Description

With this book we try to reach several more-or-less unattainable goals namely: To compromise in a single book all the most important achievements of Monte Carlo calculations for solving neutron and photon transport problems. To present a book which discusses the same topics in the three levels known from the literature and gives us useful information for both beginners and experienced readers. It lists both well-established old techniques and also newest findings.




Challenges of Monte Carlo Transport


Book Description

These are slides from a presentation for Parallel Summer School at Los Alamos National Laboratory. Solving discretized partial differential equations (PDEs) of interest can require a large number of computations. We can identify concurrency to allow parallel solution of discrete PDEs. Simulated particles histories can be used to solve the Boltzmann transport equation. Particle histories are independent in neutral particle transport, making them amenable to parallel computation. Physical parameters and method type determine the data dependencies of particle histories. Data requirements shape parallel algorithms for Monte Carlo. Then, Parallel Computational Physics and Parallel Monte Carlo are discussed and finally the results are given. The mesh passing method greatly simplifies the IMC implementation and allows simple load-balancing. Using MPI windows and passive, one-sided RMA further simplifies the implementation by removing target synchronization. The author is very interested in implementations of PGAS that may allow further optimization for one-sided, read-only memory access (e.g. Open SHMEM). The MPICH_RMA_OVER_DMAPP option and library is required to make one-sided messaging scale on Trinitite - Moonlight scales poorly. Interconnect specific libraries or functions are likely necessary to ensure performance. BRANSON has been used to directly compare the current standard method to a proposed method on idealized problems. The mesh passing algorithm performs well on problems that are designed to show the scalability of the particle passing method. BRANSON can now run load-imbalanced, dynamic problems. Potential avenues of improvement in the mesh passing algorithm will be implemented and explored. A suite of test problems that stress DD methods will elucidate a possible path forward for production codes.