Geometrically Convergent Learning Algorithms for Global Solutions of Transport Problems
In 1996 Los Alamos National Laboratory initiated an ambitious five year research program aimed at achieving geometric convergence for Monte Carlo solutions of difficult neutron and photon transport problems. Claremont students, working with the author in Mathematics Clinic projects that same year and subsequently, have been partners in this undertaking. This paper summarizes progress made at Claremont over the two year period, with emphasis on recent advances.
The Claremont approach has been to maintain as much generality as possible, aiming ultimately at the Monte Carlo solution of quite general transport equations while using various model transport problems — both discrete and continuous — to establish feasibility. As far as we are aware, prior to this effort, only the discrete case had been seriously attacked by sequential sampling methods: by Halton beginning in 1962  and subsequently by Kollman in his 1993 Stanford dissertation . In work performed in Claremont, an adaptive importance sampling algorithm consistently outperformed a sequential correlated sampling algorithm based on Halton’s ideas for matrix problems. These findings are contrary to what Halton reported in 1962 and in subsequent papers.
These learning algorithms based on very different Monte Carlo strategies have recently been successfully extended to continuous problems. This paper outlines the methods and ideas employed, sketches the algorithms used and exhibits the geometric convergence obtained. A rationale for the results obtained so far and an indication of some of the remaining obstacles to achieving fully practical computation of global transport solutions by these means is also presented.
Unable to display preview. Download preview PDF.
- 2.Kollman, C.: Rare Event Simulation in Radiation Transport. Ph.D. dissertation Stanford University 1993Google Scholar
- 3.Li, L.: Quasi-Monte Carlo Methods for Transport Equations. Ph.D. dissertation The Claremont Graduate School 1995Google Scholar
- 4.Spanier, J., Li, L.: General Sequential Sampling Techniques for Monte Carlo Simulations: Part I - Matrix Problems. Proceedings of the Second International Conference on Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing Salzburg, Austria July 9 - 12, 1996Google Scholar
- 5.Li, L., Spanier, J.: Approximation of Transport Equations by Matrix Equations and Sequential Sampling. Monte Carlo Methods and Applications 3 (1997) 171–198Google Scholar
- 8.Kong, R., Spanier, J.: Error Analysis of Sequential Correlated Sampling Methods for Transport Problems, this volumeGoogle Scholar
- 10.Lai, Y., Spanier, J.: Adaptive Importance Sampling Algorithms for Transport Problems, this volumeGoogle Scholar
- 11.Spanier, J.: Monte Carlo Methods for Flux Expansion Solutions of Transport Problems, to appear in Nuclear Science and EngineeringGoogle Scholar
- 12.Adaptive Methods for Accelerating Monte Carlo Convergence. Claremont Graduate University Mathematics Clinic Interim Report to Los Alamos National Laboratory January, 1998Google Scholar
- 13.Hayakawa, C., Spanier, J.: Comparison of Monte Carlo Algorithms for Obtaining Geometric Convergence for Model Transport Problems, this volumeGoogle Scholar