Papers › A Quasi-Monte Carlo Method with Krylov Linear Solvers for Multigroup Neutron Transport...
A Quasi-Monte Carlo Method with Krylov Linear Solvers for Multigroup Neutron Transport Simulations
Sam Pasmann, Ilham Variansyah, C. T. Kelley, Ryan McClarren
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this work we investigate replacing standard quadrature techniques used in deterministic linear solvers with a fixed-seed Quasi-Monte Carlo calculation to obtain more accurate and efficient solutions to the neutron transport equation (NTE). Quasi-Monte Carlo (QMC) is the use of low-discrepancy sequences to sample the phase space in place of pseudo-random number generators used by traditional Monte Carlo (MC). QMC techniques decrease the variance in the stochastic transport sweep and therefore increase the accuracy of the iterative method. Historically, QMC has largely been ignored by the particle transport community because it breaks the Markovian assumption needed to model scattering in analog MC particle simulations. However, by using iterative methods the NTE can be modeled as a pure-absorption problem. This removes the need to explicitly model particle scattering and provides an application well-suited for QMC. To obtain solutions we experimented with three separate iterative solvers: the standard Source Iteration (SI) and two linear Krylov Solvers, GMRES and BiCGSTAB. The resulting hybrid iterative-QMC (iQMC) solver was assessed on three one-dimensional slab geometry problems. In each sample problem the Krylov Solvers achieve convergence with far fewer iterations (up to 8x) than the Source Iteration. Regardless of the linear solver used, the hybrid method achieved an approximate convergence rate of O(N⁻¹), as compared to the expected O(N^(-1/2)) of traditional MC simulation, across all test problems.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections