Search NASA⌕ Search

Engineering topics

Hawkins, W. D.

Publications and source records attributed to Hawkins, W. D..

Physics-based dimension reduction in uncertainty quantification for radiative transfer

We present a physics-based methodology for quantifying the uncertainty in a given quantity of interest (QOI) that is contributed by uncertainties in opacities in radiation transport problems. Typically, opacities are tabulated as a function of density, temperature, and photon energy group. The size of this table makes a study of uncertainties at this level challenging because of the well-known 'curse of dimensionality.' We address this by studying uncertain parameters in the underlying physical model that generates the opacity tables. At this level, there are fewer uncertain parameters but still too many to analyze directly through computationally expensive radiation transport simulations. In order to explore this large uncertain parameter space, we develop two simplified radiation transport problems that are much less computationally demanding than the target problem of interest. An emulator is created for each QOI for each simplified problem using Bayesian Multivariate Adaptive Regression Splines (BMARS). This emulator is used to create a functional relationship between the QOIs and the uncertain parameters. Sensitivity analysis is performed using the emulator to determine which parameters contribute significantly to the uncertainty. This physics-based screening process reduces the dimension of the parameter space that is then studied via the computationally expensive radiation transport calculation to generate distributions of quantities of interest. Results of this research demonstrate that the QOIs for the target problem agree for varying screening criteria determined by the sensitivity analysis, and the QOIs agree well for varying Latin Hypercube Design (LHD) sample sizes for the uncertain space. (authors)

97 MATHEMATICS AND COMPUTING↗

Efficient checkpointing schemes for depletion perturbation solutions on memory-limited architectures

We describe a methodology for decreasing the memory footprint and machine I/O load associated with the need to access a forward solution during an adjoint solve. Specifically, we are interested in the depletion perturbation equations, where terms in the adjoint Bateman and transport equations depend on the forward flux solution. Checkpointing is the procedure of storing snapshots of the forward solution to disk and using these snapshots to recompute the parts of the forward solution that are necessary for the adjoint solve. For large problems, however, the storage cost of just a few copies of an angular flux vector can exceed the available RAM on the host machine. We propose a methodology that does not checkpoint the angular flux vector; instead, we write and store converged source moments, which are typically of a much lower dimension than the angular flux solution. This reduces the memory footprint and I/O load of the problem, but requires that we perform single sweeps to reconstruct flux vectors on demand. We argue that this trade-off is exactly the kind of algorithm that will scale on advanced, memory-limited architectures. We analyze the cost, in terms of FLOPS and memory footprint, of five checkpointing schemes. We also provide computational results that support the analysis and show that the memory-for-work trade off does improve time to solution. (authors)

97 MATHEMATICS AND COMPUTING↗

Provably optimal parallel transport sweeps on regular grids

We have found provably optimal algorithms for full-domain discrete-ordinate transport sweeps on regular grids in 3D Cartesian geometry. We describe these algorithms and sketch a 'proof that they always execute the full eight-octant sweep in the minimum possible number of stages for a given P{sub x} x P{sub y} x P{sub z} partitioning. Computational results demonstrate that our optimal scheduling algorithms execute sweeps in the minimum possible stage count. Observed parallel efficiencies agree well with our performance model. An older version of our PDT transport code achieves almost 80% parallel efficiency on 131,072 cores, on a weak-scaling problem with only one energy group, 80 directions, and 4096 cells/core. A newer version is less efficient at present-we are still improving its implementation - but achieves almost 60% parallel efficiency on 393,216 cores. These results conclusively demonstrate that sweeps can perform with high efficiency on core counts approaching 10{sup 6}. (authors)

97 MATHEMATICS AND COMPUTING↗