Publications

Results 26–50 of 91

Search results

Jump to search filters

Adjoint-enabled multidimensional optimization of satellite electron/proton shields

20th Topical Meeting of the Radiation Protection and Shielding Division, RPSD 2018

Pautz, Shawn D.; Bruss, Donald E.; Adams, Brian M.; Franke, Brian C.; Blansett, Ethan B.

The design of satellites usually includes the objective of minimizing mass due to high launch costs, which is complicated by the need to protect sensitive electronics from the space radiation environment. There is growing interest in automated design optimization techniques to help achieve that objective. Traditional optimization approaches that rely exclusively on response functions (e.g. dose calculations) can be quite expensive when applied to transport problems. Previously we showed how adjoint-based transport sensitivities used in conjunction with gradient-based optimization algorithms can be quite effective in designing mass-efficient electron/proton shields in one-dimensional slab geometries. In this paper we extend that work to two-dimensional Cartesian geometries. This consists primarily of deriving the sensitivities to geometric changes, given a particular prescription for parametrizing the shield geometry. We incorporate these sensitivities into our optimization process and demonstrate their effectiveness in such design calculations.

More Details

Specializations in the sceptre code for charged-particle transport

20th Topical Meeting of the Radiation Protection and Shielding Division, RPSD 2018

Drumm, Clifton R.; Fan, Wesley C.; Pautz, Shawn D.

Charged particles present some unique challenges for radiation transport codes. This is because charged particles have cross sections that are extremely forward peaked, are huge in the limit of small energy transfer, and are highly scattering, which causes slow convergence of the source iterations. The primary application of SCEPTRE is modeling radiation-driven electrical effects, so substantial effort has been invested in SCEPTRE for the efficient modeling of electron transport. This paper will summarize recent and ongoing activities involving the accurate deterministic-transport modeling of charged particles and methods implemented to improve iterative convergence.

More Details

Fuego/Scefire MPMD Coupling L2 Milestone Executive Summary

Pierce, Flint P.; Tencer, John T.; Pautz, Shawn D.; Drumm, Clifton R.

This milestone campaign was focused on coupling Sandia physics codes SIERRA low Mach module Fuego and RAMSES Boltzmann transport code Sceptre(Scefire). Fuego enables simulation of low Mach, turbulent, reacting, particle laden flows on unstructured meshes using CVFEM for abnormal thermal environments throughout SNL and the larger national security community. Sceptre provides simulation for photon, neutron, and charged particle transport on unstructured meshes using Discontinuous Galerkin for radiation effects calculations at SNL and elsewhere. Coupling these ”best of breed” codes enables efficient modeling of thermal/fluid environments with radiation transport, including fires (pool, propellant, composite) as well as those with directed radiant fluxes. We seek to improve the experience of Fuego users who require radiation transport capabilities in two ways. The first is performance. We achieve this through leveraging additional computational resources for Scefire, reducing calculation times while leaving unaffected resources for fluid physics. This approach is new to Fuego, which previously utilized the same resources for both fluid and radiation solutions. The second improvement enables new radiation capabilities, including spectral (banded) radiation, beam boundary sources, and alternate radiation solvers (i.e. Pn). This summary provides an overview of these achievements.

More Details

Parallel deterministic transport sweeps of structured and unstructured meshes with overloaded mesh decompositions

Nuclear Science and Engineering

Pautz, Shawn D.; Bailey, Teresa S.

The efficiency of discrete ordinates transport sweeps depends on the scheduling algorithm, the domain decomposition, the problem to be solved, and the computational platform. Sweep scheduling algorithms may be categorized by their approach to several issues. In this paper we examine the strategy of domain overloading for mesh partitioning as one of the components of such algorithms. In particular, we extend the domain overloading strategy, previously defined and analyzed for structured meshes, to the general case of unstructured meshes. We also present computational results for both the structured and unstructured domain overloading cases. We find that an appropriate amount of domain overloading can greatly improve the efficiency of parallel sweeps for both structured and unstructured partitionings of the test problems examined on up to 105 processor cores.

More Details

SCEPTRE 1.7 Quick Start Guide

Drumm, Clifton R.; Bohnhoff, William J.; Fan, Wesley C.; Pautz, Shawn D.; Valdez, Greg D.

This report provides a summary of notes for building and running the Sandia Computational Engine for Particle Transport for Radiation Effects (SCEPTRE) code. SCEPTRE is a general purpose C++ code for solving the Boltzmann transport equation in serial or parallel using unstructured spatial finite elements, multigroup energy treatment, and a variety of angular treatments including discrete ordinates and spherical harmonics. Either the first-order form of the Boltzmann equation or one of the second-order forms may be solved. SCEPTRE requires a small number of open-source Third Party Libraries (TPL) to be available, and example scripts for building these TPL's are provided. The TPL's needed by SCEPTRE are Trilinos, boost, and netcdf. SCEPTRE uses an autoconf build system, and a sample configure script is provided. Running the SCEPTRE code requires that the user provide a spatial finite-elements mesh in Exodus format and a cross section library in a format that will be described. SCEPTRE uses an xml-based input, and several examples will be provided.

More Details

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

Parallel deterministic transport sweeps of structured and unstructured meshes with overloaded mesh decompositions

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

Pautz, Shawn D.; Bailey, Teresa S.

The efficiency of discrete-ordinates transport sweeps depends on the scheduling algorithm, domain decomposition, the problem to be solved, and the computational platform. Sweep scheduling algorithms may be categorized by their approach to several issues. In this paper we examine the strategy of domain overloading for mesh partitioning as one of the components of such algorithms. In particular, we extend the domain overloading strategy, previously defined and analyzed for structured meshes, to the general case of unstructured meshes. We also present computational results for both the structured and unstructured domain overloading cases. We find that an appropriate amount of domain overloading can greatly improve the efficiency of parallel sweeps for both structured and unstructured partitionings of the test problems examined on up to 105 processor cores.

More Details
Results 26–50 of 91
Results 26–50 of 91