Convergence of Monte Carlo algorithms for power reactor noise

Power reactor noise refers to the small periodical variations of the neutron flux in nuclear reactor cores, induced by various perturbations. A prominent example is the vibration of fuel assemblies due to fluid-structure interactions. Although noise is generally an unwanted phenomenon, its analysis is useful for core monitoring. In this respect, several state-of-the-art deterministic or Monte Carlo solvers have been developed to solve the equations describing neutron noise. In this paper, we investigate the convergence properties of Monte Carlo methods for neutron noise analysis, within the orthodox linearization approximation. For this purpose, we establish a theoretical framework for complex-weighted Monte Carlo games and we show that convergence of such algorithms can be assessed using two sets of eigenvalues. In order to substantiate our findings, we examine a few relevant benchmark configurations for noise problems.

Publication Details

Journal
Springer Link (Chiba Institute of Technology)
Published
2025-11-06
DOI
https://doi.org/10.1051/epjn/2025062/pdf
Primary Topic
Probabilistic and Robust Engineering Design
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Convergence of Monte Carlo algorithms for power reactor noise

Springer Link (Chiba Institute of Technology)
Probabilistic and Robust Engineering Design
article

Convergence of Monte Carlo algorithms for power reactor noise

article en

Abstract

Power reactor noise refers to the small periodical variations of the neutron flux in nuclear reactor cores, induced by various perturbations. A prominent example is the vibration of fuel assemblies due to fluid-structure interactions. Although noise is generally an unwanted phenomenon, its analysis is useful for core monitoring. In this respect, several state-of-the-art deterministic or Monte Carlo solvers have been developed to solve the equations describing neutron noise. In this paper, we investigate the convergence properties of Monte Carlo methods for neutron noise analysis, within the orthodox linearization approximation. For this purpose, we establish a theoretical framework for complex-weighted Monte Carlo games and we show that convergence of such algorithms can be assessed using two sets of eigenvalues. In order to substantiate our findings, we examine a few relevant benchmark configurations for noise problems.

Springer Link (Chiba Institute of Technology)
Openalex Percentile: Top 32%
Probabilistic and Robust Engineering Design
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.