Analytic Modeling of a Deep Shielding Problem
Previous generations of scientists would make tremendous efforts to simplify non-tractable problems and generate simpler models that preserved the fundamental physics. This process involved applying assumptions and simplifications to reduce the complexity of the problem until it reached a solvable form. Each assumption and simplification was chosen and applied with the intent to preserve the essential physics of the problem, since, if the core physics of the problem were eliminated, the simplified model served no purpose. Moreover, if done correctly, solutions to the reduced model would serve as useful approximations to the original problem. In a sense, solving the simple models laid the ground-work for and provided insight into the more complex problem. Today, however, the affordability of high performance computing has essentially replaced the process for analyzing complex problems. Rather than \building up" a problem by understanding smaller, simpler models, a user generally relies on powerful computational tools to directly arrive at solutions to complex problems. As computational resources grow, users continue trying to simulate new, more complex, or more detailed problems, resulting in continual stress on both the code and computational resources. When these resources are limited, the user will have to make concessions by simplifying the problem while trying to preserve important details. In the context of MCNP, simplifications typically come as reductions in geometry, or by using variance reduction techniques. Both approaches can influence the physics of the problem, leading to potentially inaccurate or non-physical results. Errors can also be introduced as a result of faulty input into a computational tool: something as simple as transposing numbers in a tally input can result in incorrect answers.