Complexity analysis of the MCNP/X code

Research output: ThesisMaster's thesis

Authors

  • Andreas van Wijk

Institutes & Expert groups

Documents & links

Documents

Abstract

This work analysis the computational complexity of the MCNP/X code. Based on this analysis a number of rules of thumb have been established. Following these rules of thumb, the user of MCNP/X can gain a reasonable amount of computation time. A second aspect studied in this work is Global Variance Reduction: an iterative process to fix a weight window to reduce the global relative error. GVR allows to have a simulation result with a very flat relative error profile, even at places where neutron flux is low.

Details

Original languageEnglish
Awarding Institution
  • TUD - Delft University of Technology
Supervisors/Advisors
Place of PublicationDelft, Netherlands
Publisher
  • TU Delft - Delft University of Technology
Publication statusPublished - 1 Dec 2010

Keywords

  • MCNP/X, Monte Carlo, GVR

ID: 313886