Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Physics - Plasma physics , Mathematics and Computing, Physics”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 361 records · Page 20

S/U Comparison Study with a Focus on USLs

Under a DOE Nuclear Criticality Safety Program (NCSP) task involving Analytical Methods, three Laboratories collaborated in a comparison of results obtained from Sensitivity/Uncertainty (S/U) packages relevant to validation of transport codes. The task involves Institut de Radioprotection et de Sûreté Nucléaire (IRSN), Los Alamos National Laboratory (LANL), and Oak Ridge National Laboratory (ORNL) comparing results of MORET 5/MACSENS V3.0, MCNP6.2/Whisper-1.1, and SCALE 6.2.3/TSUNAMI/USLSTATS respectively. All Monte Carlo transport code results utilize ENDF/B-VII.1. Four cases from the International Handbook of Evaluated Criticality Safety Benchmark Experiments (ICSBEP Handbook) were selected as application models: HEU-MET-FAST-013-001, HEU-SOL-THERM 001-008, PU-MET-FAST-022-001, and PU-SOL-THERM 001-001. Ultimately, comparison is made between Upper Subcritical Limits (USLs) obtained using each code package for each application case. Since differences exist in whether packages take into account margin of subcriticality (MOS), the USL may be computed using bias and bias uncertainty, also known as the calculational margin (CM) in ANSI/ANS 8.24. Application of portions of MOS to the USL for nuclear data uncertainty of and potential code margin is referred to as USL herein. In either case, additional MOS is considered for actual application cases.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Impact of Increased Latent Generations on Sensitivity Calculations with SCALE

Analyses of cross section sensitivity data from systems with fissile material allow analysts to associate an importance for each material, nuclide, reaction, and neutron energy by simulating real world criticality scenarios. Although criticality safety validation efforts can be guided by the cross-section sensitivity and uncertainty data generated for a particular system, these calculations can often be computationally expensive and sometimes cumbersome without proper guidance. The TSUNAMI suite within the SCALE code package has several methods for generating sensitivity data, including multigroup and continuous energy (CE) capabilities. The release of SCALE 6.3 has three different CE methods for generating cross section sensitivity data: (1) the Iterated Fission Probability (IFP) method with the KENO Monte Carlo transport solver, (2) the IFP method with the Shift Monte Carlo transport solver, and (3) the Contributon-Linked eigenvalue sensitivity/Uncertainty estimation via Tracklength importance CHaracterization (CLUTCH) method with the KENO Monte Carlo transport solver. Although the CLUTCH method has additional parameters for generating sensitivity data files relative to the IFP method, all three methods use latent generations, which are the generations between an event (i.e., fission) and the assessment of importance based on the asymptotic population of progeny neutrons. Increasing the number of latent generations in a calculation leads to increased discrimination of the sensitivity coefficients but at the cost of the increased uncertainty associated with those generated values. Analysts must balance the accuracy of the sensitivity calculations and its uncertainty with the associated computational cost involved in generating the values. This paper discusses the impact of adjusting the latent generation parameter for a range of sensitivity values and how these changes compare with the direct perturbation values obtained from a change of ±0.5% Δ k in both benchmark and safety application models. Two benchmarks from the International Handbook of Evaluated Criticality Safety Benchmark Experiments and the MPC-32 dual purpose canister for spent nuclear fuel are used for analysis.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Reactivity Coefficient Measurements and Sensitivity Studies [Abstract]

Nuclear data validation is often performed today using criticality measurements. The gold standard for criticality measurements is the International Criticality Safety Benchmark Experiment Project (ICSBEP). The validation specifically focuses on the effective multiplication factor (k eff ). K eff is a relatively easy parameter to infer and has reduced uncertainty due to being at or above critical. However, while k eff is a well-documented parameter with detailed sensitivity and uncertainty analysis, it cannot be used as a standalone metric to determine inaccuracies in nuclear data (e.g., cross section data, PFNS, nu), which is based on theory, physics, and differential measurements. The Experiments Underpinned by Computational Learning for Improvements in nuclear Data (EUCLID) project aims to identify compensating errors in specific nuclear data by optimally designing experiments that are sensitive to a suite of measurement parameters beyond k eff . By identifying how each parameter's nuclear data sensitivity differs from others, experiments can be designed to constrain questionable nuclear data. One sensitivity that is of particular interest to this project includes reactivity coefficient sensitivities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Depletion Chain Simplification With Pseudo-Nuclides to Model Decay Effects

This work introduces the novel usage of pseudo-nuclides to model decay effects which are otherwise absent from simplified depletion libraries. Pseudo-nuclides are artificial nuclides which, when added to a simplified depletion library, can preserve quantities of interest such as decay energy release or decay photon activity which are otherwise significantly under-predicted by simplified libraries. Several dozen pseudo-nuclides are capable of accurately modeling decay effects of hundreds of short-lived radionuclides. The computational resources needed to model the decay effects in depletion systems with simplified depletion libraries with pseudo-nuclides are significantly less than those needed when using simplified depletion libraries without pseudo-nuclides. When compared to the similar method of decay heat precursors for a given system, pseudo-nuclides allow for smaller depletion libraries to be generated because of their ability to more accurately model the fission product irradiation effect on decay heat.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Hybrid Particle Swarm-Interpolation Algorithm for Improved Critical Experiment Design

The typical goal of designing a critical experiment is twofold: a system that is both critical and optimized for some other value. This value could be an energy-integrated sensitivity, percent fissions in a certain energy range, or some other value that can be calculated by a transport code. By simulating different combinations of reflector, moderator, and fuel thicknesses a designer can identify such a desirable configuration. The domain of all possible combinations of these thicknesses is referred to as the experiment search space. As more dimensions are added, the search space increases in size exponentially. For a three-dimensional case, which includes three thickness values between zero and ten centimeters to the nearest tenth of a millimeter, a total of 1,000 3 , configurations exists. Rather than check each configuration individually, which would be extremely computationally expensive, it has been shown to be more efficient to use a conventional particle swarm optimization (PSO) algorithm to identify critical and optimal configurations. This work presents the theory and implementation of a novel hybrid PSO interpolation algorithm to perform these optimizations faster than a conventional PSO algorithm. To demonstrate this, an example optimization will be carried out by the conventional and hybrid PSO algorithms and their performances will be compared.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Enabling Predictive Scale-Bridging Simulations through Active Learning (Institutional Computing Annual Report (Project w20_alscalebridging)) [Slides]

The goal of this project was to develop, demonstrate, and provide a new capability to achieve greater physical fidelity in large-scale simulations, rather than the usual brute-force increases in the number of mesh elements or particles. This was done by using machine learning (ML) techniques to develop emulators for subscale physics that can be used in coarse-scale continuum simulations, trained on fine-scale molecular dynamics (MD) simulations that are launched on-the-fly via active learning. raditional inertial confinement fusion (ICF) simulations rely on numerical diffusion to simulate molecular effects such as non-local transport and mixing without truly accounting for molecular interactions; our approach directly accounts for this physics.

74 ATOMIC AND MOLECULAR PHYSICS↗

Electronic Structure Theories of Singlet Fission and Multiple Exciton Generation (Final Report)

This DOE grant supported the development of electronic structure theory, algorithms, and computer programs for simulating singlet fission and multiple excision generation processes from Sept. 2013 to Aug. 2018 (which was terminated due to the PI’s departure from Northwestern University to industry). One of the main achievements is the development of the so-called active space decomposition (ASD) method hat describes exciton dynamics in organic semiconductors and spin dynamics in strongly correlated materials. The resulting software was interfaced with the Brilliantly Advanced General Electronic-structure Library (BAGEL) package and widely disseminated to the research community.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

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. In this paradigm, reduced complexity computational and analytical models still have an important purpose. The explicit form of an analytic solution is arguably the best way to understand the qualitative properties of simple models. In contrast to "building up" a complex problem through understanding simpler problems, results from detailed computational scenarios can be better explained by "building down" the complex model through simple models rooted in the fundamental or essential phenomenology. Simplified analytic and computational models can be used to 1) increase a user's confidence in the computational solution of a complex model, 2) confirm there are no user input errors, and 3) ensure essential assumptions of the simulation tool are preserved. This process of using analytic models to develop a more valuable analysis of simulation results is named the results analysis methodology. The utility of the results assessment methodology and a complimentary sensitivity analysis is exemplified through the analysis of the neutron flux in a dry used fuel storage cask. This application was chosen due to current scientific interest in used nuclear fuel storage.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Summary of Multiphysics Modeling for Sublimation Mass Transfer

This report summarizes the effort to develop a multiphysics modeling framework for sublimation mass transfer processes. The aim of the project was to develop a multiphysics code capable of predicting phase change between solid and gas in a closed container, and the movement of material within such a container when exposed to various exterior environmental conditions. Two modeling frameworks were developed towards this aim: one with a high-fidelity computational fluid dynamics (CFD) structure, and the other as a fast reduced-order model. Ultimately, both attempts were unsuccessful due to instabilities in the code and physical processes for which there is no adequate numerical representation. Both modeling attempts are briefly detailed before providing a brief survey of recent updates in the literature, and a recommendation for future work on this subject.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adversarial sampling of unknown and high-dimensional conditional distributions

Many engineering problems require the prediction of realization-to-realization variability or a refined description of modeled quantities. In that case, it is necessary to sample elements from unknown high-dimensional spaces with possibly millions of degrees of freedom. While there exist methods able to sample elements from probability density functions (PDF) with known shapes, several approximations need to be made when the distribution is unknown. In this paper the sampling method, as well as the inference of the underlying distribution, are both handled with a data-driven method known as generative adversarial networks (GAN), which trains two competing neural networks to produce a network that can effectively generate samples from the training set distribution. In practice, it is often necessary to draw samples from conditional distributions. When the conditional variables are continuous, only one (if any) data point corresponding to a particular value of a conditioning variable may be available, which is not sufficient to estimate the conditional distribution. This work handles this problem using an a priori estimation of the conditional moments of a PDF. Herein, two approaches, stochastic estimation, and an external neural network are compared for computing these moments; however, any preferred method can be used. The algorithm is demonstrated in the case of the deconvolution of a filtered turbulent flow field. It is shown that all the versions of the proposed algorithm effectively sample the target conditional distribution with minimal impact on the quality of the samples compared to state-of-the-art methods. Additionally, the procedure can be used as a metric for the diversity of samples generated by a conditional GAN (cGAN) conditioned with continuous variables.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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 the Monte Carlo N-Particle radiation transport simulation tool, 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. In this paradigm, reduced complexity computational and analytical models still have an important purpose. The explicit form of an analytic solution is arguably the best way to understand the qualitative properties of simple models. In contrast to "building up" a complex problem through understanding simpler problems, results from detailed computational scenarios can be better explained by "building down" the complex model through simple models rooted in the fundamental or essential phenomenology. Simplified analytic and computational models can be used to 1) increase a user's confidence in the computational solution of a complex model, 2) confirm there are no user input errors, and 3) ensure essential assumptions of the simulation tool are preserved. This process of using analytic models to develop a more valuable analysis of simulation results is named the results assessment methodology. The utility of the results assessment methodology and a complimentary sensitivity analysis is exemplified through the analysis of the neutron flux in a dry used fuel storage cask. This application was chosen due to current scientific interest in used nuclear fuel storage.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A new database website for nuclear level densities

We introduce a new open-access, web-based database (http://nld.ascsn.net), Current Archive of Nuclear Density of Levels (CANDL), that hosts experimental nuclear level density (NLD) datasets from a variety of techniques and energy ranges. Built using the Dash framework in Python, the database is designed to be interactive and user-friendly, allowing researchers to search, visualize, fit, and export NLD data with minimal effort. This resource includes data extracted from evaporation spectra, Oslo method variants, and other experimental techniques that cover excitation energies beyond the neutron resonance region. The database supports on-the-fly fitting with two widely-used phenomenological models—the Constant Temperature (CT) model and the Back-Shifted Fermi Gas (BSFG) model—selected for their simplicity and computational efficiency. Future versions aim to include additional datasets and model types, as well as easy-to-use interfaces to data science techniques. Here, this platform offers a vital tool for the nuclear physics, astrophysics, medicine, and reactor design communities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

VALID Past, Present, and Future [Slides]

This presentation discusses the Verified, Archived Library of Inputs and Data (VALID) procedure which is managed per computational procedure under the overall SCALE quality assurance plan. The principle behind VALID is that two independent, qualified people prepare and review the model, while a dual, independent check acts as a primary barrier to prevent errors in the library. A final check by VALID QAC of procedural compliance is then performed. The future for VALID includes plans to add more experiments, a review for all ICSBEP cases containing Deuterium, ZEUS intermediate and fast spectrum evaluations, intermediate enrichment experiments, other cases of interest to sponsors, and mixed/intermediate spectrum experiments.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

NEAMS Advanced Reactor Model Contributions to the NRIC Virtual Test Bed

The U.S. Department of Energy (DOE) Office of Nuclear Energy’s Advanced Modeling and Simulation (NEAMS) Program develops models of advanced reactor phenomena to demonstrate code applicability to challenging physics problems, drive code development through user assessment, and perform code verification and validation. Meanwhile, the U.S. DOE’s National Reactor Innovation Center (NRIC) hosts an open-source website and associated GitHub repository called the Virtual Test Bed (VTB) on which computational models for advanced reactors are documented and shared with the reactor community. Several NEAMS advanced reactor models (including input files, documentation, and discussion of results) have recently been contributed to the NRIC VTB. The open sharing of these models benefits the reactor community by providing “best practice” examples using NEAMS tools for advanced reactor physics problems. This report summarizes and provides links to these new models, which include modeling phenomena important to liquid metal cooled fast reactors, molten salt reactors, high temperature gas-cooled reactors, and microreactors.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Quantum approximate multi-objective optimization

The goal of multi-objective optimization is to understand optimal trade-offs between competing objective functions by finding the Pareto front, that is, the set of all Pareto-optimal solutions, where no objective can be improved without degrading another one. Multi-objective optimization can be challenging classically, even if the corresponding single-objective optimization problems are efficiently solvable. Thus, multi-objective optimization represents a compelling problem class to analyze with quantum computers. Here we use a low-depth quantum approximate optimization algorithm to approximate the optimal Pareto front of certain multi-objective weighted maximum-cut problems. We demonstrate its performance on an IBM Quantum computer, as well as with matrix product state numerical simulation, and show its potential to outperform classical approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Level 2 Milestone: Develop and Incorporate Novel Code Verification of Fundamental Equations in Gemma and Set Up Appropriate Tests

For computational physics simulations, code verification plays a major role in establishing the credibility of the results by assessing the correctness of the implementation of the underlying numerical methods. In computational electromagnetics, surface integral equations, such as the method-of-moments implementations of the electric-, magnetic-, and combinedfield integral equations, are frequently used to solve Maxwell’s equations on the surfaces of electromagnetic scatterers. These electromagnetic surface integral equations yield many code-verification challenges due to the various sources of numerical error and their possible interactions. In this report, we provide approaches to separately measure the numerical errors arising from these different error sources. We demonstrate the effectiveness of these approaches in Gemma.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Increasing the Measured Effective Quantum Volume with Zero Noise Extrapolation

Quantum volume is a full-stack benchmark for near-term quantum computers. It quantifies the largest size of a square circuit which can be executed on the target device with reasonable fidelity. Error mitigation is a set of techniques intended to remove the effects of noise present in the computation of noisy quantum computers when computing an expectation value of interest. Effective quantum volume is a proposed metric that applies error mitigation to the quantum volume protocol to evaluate the effectiveness not only of the target device but also of the error mitigation algorithm. Digital zero-noise extrapolation is an error mitigation technique that estimates the noiseless expectation value using circuit folding to amplify errors by known scale factors and then extrapolating computed expectation values to the zero-noise limit. Here we demonstrate that zero-noise extrapolation, with global and local unitary folding with fractional scale factors, in conjunction with dynamical decoupling, can increase the effective quantum volume over the vendor-measured quantum volume. Specifically, we measure the effective quantum volume of four IBM Quantum superconducting processor units, obtaining values that are larger than the vendor-measured quantum volume on each device. This is the first such increase reported.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Review of Literature Related to Nuclear Data Mini-Apps

his document reviews nuclear data mini-apps prevalent in the published scientific literature. It is intended to identify algorithmic and computer architecture considerations of relevance to optimizing GIDI/MCGIDI for GPU-based architectures. While some of the works considered here focus on CPU-based architectures, the performance-limiting factors and mitigating strategies identified often extend to GPU-based architectures, particularly in the context of latency-bound performance. A brief overview of the cross section (XS) lookup process is given in Section 1 and a detailed analysis of nuclear data mini-apps follows in Section 2. Concluding remarks are offered in Section 3.

42 ENGINEERING↗