Complexity analysis of the MCNP/X code

Andreas van Wijk, Simon Vanmaercke

    Research output

    786 Downloads (Pure)


    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.
    Original languageEnglish
    Awarding Institution
    • TUD - Delft University of Technology
    • Van den Eynde, Gert, Supervisor
    Place of PublicationDelft, Netherlands
    StatePublished - 1 Dec 2010

    Cite this