REVIEW
iQMC: Iterative Quasi-Monte Carlo for k-Eigenvalue Neutron Transport Simulations
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
iQMC: Iterative Quasi-Monte Carlo for k-Eigenvalue Neutron Transport Simulations
read the original abstract
The Iterative Quasi-Monte Carlo method, or iQMC, replaces standard quadrature techniques used in deterministic linear solvers with Quasi-Monte Carlo simulation for more accurate and efficient solutions to the neutron transport equation. This work explores employing iQMC in the Monte-Carlo Dynamic Code (MCDC) to solve k-eigenvalue problems for neutron transport with both the standard power iteration and the generalized Davidson method, a Krylov Subspace method. Results are verified with the 3-D, 2-group, Takeda-1 Benchmark problem.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.