Convergence of Multi-Level Hybrid Monte Carlo Methods for 1-D Particle Transport Problems

We present in this paper a hybrid, Multi-Level Monte Carlo (MLMC) method for solving the neutral particle transport equation. MLMC methods, originally developed to solve parametric integration problems, work by using a cheap, low fidelity solution as a base solution and then solves for additive correction factors on a sequence of computational grids. The proposed algorithm works by generating a scalar flux sample using a Hybrid Monte Carlo method based on the low-order Quasidiffusion equations. We generate an initial number of samples on each grid and then calculate the optimal number of samples to perform on each level using MLMC theory. Computational results are shown for a 1-D slab model to demonstrate the weak convergence of considered functionals. The analyzed functionals are integrals of the scalar flux solution over either the whole domain or over a specific subregion. We observe the variance of the correction factors decreases faster than increase in the cost of generating a MLMC sample grows. The variance and costs of the MLMC solution are driven by the coarse grid calculations. Therefore, we should be able to add additional computational levels at minimal cost since fewer samples would be needed to converge estimates of the correction factors on subsequent levels.

Authors

Publication Details

Published
2025-01-01
DOI
https://doi.org/10.13182/xyz-47082
Citations
1
Primary Topic
Nuclear reactor physics and engineering
Type
article
Field-Weighted Citation Impact
4.99

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Convergence of Multi-Level Hybrid Monte Carlo Methods for 1-D Particle Transport Problems

Dmitriy Y. Anistratov, Vincent N. Novellino
1 citations
Nuclear reactor physics and engineering
4.99
article

Convergence of Multi-Level Hybrid Monte Carlo Methods for 1-D Particle Transport Problems

Dmitriy Y. Anistratov, Vincent N. Novellino
article en
1 citations

Abstract

We present in this paper a hybrid, Multi-Level Monte Carlo (MLMC) method for solving the neutral particle transport equation. MLMC methods, originally developed to solve parametric integration problems, work by using a cheap, low fidelity solution as a base solution and then solves for additive correction factors on a sequence of computational grids. The proposed algorithm works by generating a scalar flux sample using a Hybrid Monte Carlo method based on the low-order Quasidiffusion equations. We generate an initial number of samples on each grid and then calculate the optimal number of samples to perform on each level using MLMC theory. Computational results are shown for a 1-D slab model to demonstrate the weak convergence of considered functionals. The analyzed functionals are integrals of the scalar flux solution over either the whole domain or over a specific subregion. We observe the variance of the correction factors decreases faster than increase in the cost of generating a MLMC sample grows. The variance and costs of the MLMC solution are driven by the coarse grid calculations. Therefore, we should be able to add additional computational levels at minimal cost since fewer samples would be needed to converge estimates of the correction factors on subsequent levels.

U.S. Department of Energy, Office of Nuclear Energy
Openalex Percentile: Top 5%
Nuclear reactor physics and engineering
4.99
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Convergence of Multi-Level Hybrid Monte Carlo Methods for 1-D Particle Transport Problems — Dmitriy Y. Anistratov, Vincent N. Novellino · (2025) | TGRS Research Map | TGRS