Inicio
Explorar
nav.journalClub
Tendencias
Más
synapse
⌘+K
Idioma
Español
Español
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
Puntos clave
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.
Resumen
International audience
Mark Helpful
Me gusta
Save
Guardar
Relay
Compartir
Mark Helpful
Me gusta
Save
Guardar
Relay
Compartir
Cite This Study
Copy
Gaël Poëtte (Sat,) studied this question.
synapsesocial.com/papers/69a75d53c6e9836116a272c4