Publications

Results 51–75 of 112
Skip to search filters

A generalized Levermore-Pomraning closure for stochastic media transport problems

Mathematics and Computations, Supercomputing in Nuclear Applications and Monte Carlo International Conference, M and C+SNA+MC 2015

Pautz, Shawn D.; Franke, Brian C.

Stochastic media transport problems have long posed challenges for accurate modeling. Brute force Monte Carlo or deterministic sampling of realizations can be expensive in order to achieve the desired accuracy. The well-known Levermore-Pomraning (LP) closure is very simple and inexpensive, but is inaccurate in many circumstances. We propose a generalization to the LP closure that may help bridge the gap between the two approaches. Our model consists of local calculations to approximately determine the relationship between ensemble-averaged angular fluxes and the corresponding averages at material interfaces. The expense and accuracy of the method are related to how "local" the model is and how much local detail it contains. We show through numerical results that our approach is more accurate than LP for benchmark problems, provided that we capture enough local detail. Thus we identify two approaches to using ensemble calculations for stochastic media calculations: direct averaging of ensemble results for transport quantities of interest, or indirect use via a generalized LP equation to determine those same quantities; in some cases the latter method is more efficient. However, the method is subject to creating ill-posed problems if insufficient local detail is included in the model.

More Details

An improved deterministic method for the solution of stochastic media transport problems

Mathematics and Computations, Supercomputing in Nuclear Applications and Monte Carlo International Conference, M and C+SNA+MC 2015

Pautz, Shawn D.; Franke, Brian C.

We present an improved deterministic method for analyzing transport problems in random media. In the original method realizations were generated by means of a product quadrature rule; transport calculations were performed on each realization and the results combined to produce ensemble averages. In the present work we recognize that many of these realizations yield identical transport problems. We describe a method to generate only unique transport problems with the proper weighting to produce identical ensemble-averaged results at reduced computational cost. We also describe a method to ignore relatively unimportant realizations in order to obtain nearly identical results with further reduction in costs. Our results demonstrate that these changes allow for the analysis of problems of greater complexity than was practical for the original algorithm.

More Details

Scaling of intrusive stochastic collocation and stochastic galerkin methods for uncertainty quantification in Monte Carlo particle transport

Mathematics and Computations, Supercomputing in Nuclear Applications and Monte Carlo International Conference, M and C+SNA+MC 2015

Olson, Aaron J.; Franke, Brian C.; Prinja, Anil K.

A Monte Carlo solution method for the system of deterministic equations arising in the application of stochastic collocation (SCM) and stochastic Galerkin (SGM) methods in radiation transport computations with uncertainty is presented for an arbitrary number of materials each containing two uncertain random cross sections. Moments of the resulting random flux are calculated using an intrusive and a non-intrusive Monte Carlo based SCM and two different SGM implementations each with two different truncation methods and compared to the brute force Monte Carlo sampling approach. For the intrusive SCM and SGM, a single set of particle histories is solved and weight adjustments are used to produce flux moments for the stochastic problem. Memory and runtime scaling of each method is compared for increased complexity in stochastic dimensionality and moment truncation. Results are also compared for efficiency in terms of a statistical figure-of-merit. The memory savings for the total-order truncation method prove significant over the full-tensor-product truncation. Scaling shows relatively constant cost per moment calculated of SCM and tensor-product SGM. Total-order truncation may be worthwhile despite poorer runtime scaling by achieving better accuracy at lower cost. The figure-of-merit results show that all of the intrusive methods can improve efficiency for calculating low-order moments, but the intrusive SCM approach is the most efficient for calculating high-order moments.

More Details
Results 51–75 of 112
Results 51–75 of 112