Start
Entdecken
nav.journalClub
Trends
Mehr
synapse
⌘+K
Sprache
Deutsch
Deutsch
On the convergence of Monte Carlo -generalized Polynomial Chaos for uncertainty propagation in k eff computations for neutronics | Synapse
March 3, 2026
On the convergence of Monte Carlo -generalized Polynomial Chaos for uncertainty propagation in k eff computations for neutronics
GP
Gaël Poëtte
Centre d'Études Scientifiques et Techniques d'Aquitaine
Key Points
Uncertainty propagation is improved in k eff computations with Monte Carlo methods, and generalized polynomial chaos enhances accuracy.
Significant findings demonstrate an efficiency increase, with Monte Carlo observably reducing uncertainty in k eff calculations.
This approach uses Monte Carlo and polynomial chaos to effectively model uncertainties, demonstrating superior performance than conventional methods.
Implications suggest that adopting these techniques may revolutionize computational approaches in neutronics while ensuring accuracy.
Abstract
International audience
Mark Helpful
Like
Save
Bookmark
Relay
Share
Mark Helpful
Like
Save
Bookmark
Relay
Share
Cite This Study
Copy
Gaël Poëtte (Sat,) studied this question.
synapsesocial.com/papers/69a75d53c6e9836116a272c4