Evolutionary Discovery of Sequence Acceleration Methods for Slab Geometry Neutron Transport
By: Japan K. Patel , Barry D. Ganapol , Anthony Magliari and more
We present a genetic programming approach to automatically discover convergence acceleration methods for discrete ordinates solutions of neutron transport problems in slab geometry. Classical acceleration methods such as Aitken's delta-squared and Wynn epsilon assume specific convergence patterns and do not generalize well to the broad set of transport problems encountered in practice. We evolved mathematical formulas specifically tailored to SN convergence characteristics in this work. The discovered accelerator, featuring second differences and cross-product terms, achieved over 75 percent success rate in improving convergence compared to raw sequences - almost double that observed for classical techniques for the problem set considered. This work demonstrates the potential for discovering novel numerical methods in computational physics via genetic programming and attempts to honor Prof. Ganapol's legacy of advancing experimental mathematics applied to neutron transport.
Similar Papers
Accelerating shape optimization by deep neural networks with on-the-fly determined architecture
Computational Engineering, Finance, and Science
Makes designs faster by using smart computer guesses.
Accelerating shape optimization by deep neural networks with on-the-fly determined architecture
Computational Engineering, Finance, and Science
Makes designs faster by learning from tests.
Neural Network Acceleration of Iterative Methods for Nonlinear Schrödinger Eigenvalue Problems
Numerical Analysis
Makes hard science problems solve much faster.