Results for “simulation methods and programs” — Page 15

DOE OSTI2022

NEAMS Technical Area Support in MOOSE

The Multiphysics Object-Oriented Simulation Environment (MOOSE) framework is a foundational capability used by the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program to create over 15 different simulation tools for advanced nuclear reactors. Due to this ubiquity, improvements to the framework in support of modeling and simulation goals are critical to the program. These improvements can take many forms, including optimization, improved user experience, streamlined application programming interfaces (APIs), parallelism, and new capabilities. The work transcribed in this report was conducted in direct support of the simulation tools and has already been deployed. The capabilities outlined in this report include a factor of 10^4 improvement in dependency resolution speed, sorting of user objects, ability to compute residuals and Jacobians together, transfer fixes, support for the mortar method in finite volume discretizations, addition of generalized advection schemes for fluid simulations, 10^2 speedup in some Griffin simulations due to a new matrix-only solve type, and much more.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Simulator Data Analysis to Inform Digitalized Environment Impacts on Human Reliability

The U.S. Nuclear Regulatory Commission (NRC) has developed a human reliability analysis (HRA) method, termed the Integrated Human Event Analysis System for Event and Condition Assessment (IDHEAS-ECA), in order to estimate human error probabilities (HEPs) in risk-informed regulatory applications. To update the quantification part of IDHEAS-ECA, the NRC required human performance and error data from fully digitalized main control rooms (MCRs); therefore, it requested that Idaho National Laboratory (INL) revisit previous data collection studies and investigate how the following three factors impact human reliability: self-checking, peer-checking, and automation. The HRA data collection studies revisited were the Human Reliability Data Extraction (HuREX) project, developed by the Korea Atomic Energy Research Institute (KAERI), and the Simplified Human Error Experimental Program (SHEEP), developed by INL. HuREX is a representative HRA data collection study that collects human reliability data from full-scope simulators staffed by licensed operators. SHEEP, on the other hand, has been proposed to complement such full-scope studies by collecting data via simplified simulators staffed by non-licensed student operators. In the HuREX study, KAERI collected HRA data from fully digitalized MCRs for the Advanced Power Reactor (APR)–1400. The SHEEP data were obtained from simplified simulators that partially mimicked the features of digitalized MCRs. The present report mainly discusses how the impacts of the aforementioned three factors on human errors were derived from these two data collection studies.

99 GENERAL AND MISCELLANEOUS↗

DOE OSTI2020

PySpawn: Software for Nonadiabatic Quantum Molecular Dynamics

The ab initio multiple spawning (AIMS) method enables nonadiabatic quantum molecular dynamics simulations in an arbitrary number of dimensions, with potential energy surfaces provided by electronic structure calculations performed on-the-fly. However, the intricacy of the AIMS algorithm complicates software development, deployment on modern shared computer resources, and post-simulation data analysis. PySpawn is a nonadiabatic molecular dynamics software package that addresses these issues. Here, the program is designed to be easily interfaced with electronic structure software, and an interface to the TeraChem software package is described here. PySpawn introduces a task-based reorganization of the AIMS algorithm, allowing fine-grained restart capability and setting the stage for efficient parallelization in a future release. PySpawn includes a user-friendly and interactive Python analysis module that will enable novice users to painlessly adopt AIMS. As a demonstration of PySpawn’s simulation capability and analysis module, we report complete active space self-consistent field–based AIMS simulations of the 1,2- dithienyl-1,2-dicyanoethene molecule, a promising molecular photoswitch.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2021

Resilience-Oriented DG Siting and Sizing Considering Stochastic Scenario Reduction

In this paper, a fuel-based distributed generator (DG) allocation strategy is proposed to enhance the distribution system resilience against extreme weather. The long-term planning problem is formulated as a two-stage stochastic mixed-integer programming (SMIP). The first stage is to make decisions of DG siting and sizing under the given budget constraint. In the second stage, a post-extreme-event-restoration (PEER) is employed to minimize the operating cost in an uncertain fault scenario. In particular, this study proposes a method to select the most representative scenarios for the SMIP. First, a Monte Carlo Simulation (MCS) is introduced to generate sufficient scenarios considering random fault locations and load profiles. Then, the number of scenarios is reduced by the K-means clustering algorithm. The advantage of scenario reduction is to make a trade-off between accuracy and computational efficiency. Finally, the SMIP is solved by the progressive hedging algorithm. Here, the case studies of the IEEE 33-bus and 123-bus test systems demonstrate the effectiveness of the proposed algorithm in reducing the expected energy not served (EENS), which is a critical criterion of resilience.

42 ENGINEERING↗

DOE OSTI2024

Efficient species identification for Pacific salmon genetic monitoring programs

Abstract Genetic monitoring of Pacific salmon in the Columbia River basin provides crucial information to fisheries managers that is otherwise challenging to obtain using traditional methods. Monitoring programs such as genetic stock identification (GSI) and parentage‐based tagging (PBT) involve genotyping tens of thousands of individuals annually. Although rare, these large sample collections inevitably include misidentified species, which exhibit low genotyping success on species‐specific Genotyping‐in‐Thousands by sequencing (GT‐seq) panels. For laboratories involved in large‐scale genotyping efforts, diagnosing non‐target species and reassigning them to the appropriate monitoring program can be costly and time‐consuming. To address this problem, we identified 19 primer pairs that exhibit consistent cross‐species amplification among salmonids and contain 51 species informative variants. These genetic markers reliably discriminate among 11 salmonid species and two subspecies of Cutthroat Trout and have been included in species‐specific GT‐seq panels for Chinook Salmon, Coho Salmon, Sockeye Salmon, and Rainbow Trout commonly used for Pacific salmon genetic monitoring. The majority of species‐informative amplicons (16) were newly identified from the four existing GT‐seq panels, thus demonstrating a low‐cost approach to species identification when using targeted sequencing methods. A species‐calling script was developed that is tailored for routine GT‐seq genotyping pipelines and automates the identification of non‐target species. Following extensive testing with empirical and simulated data, we demonstrated that the genetic markers and accompanying script accurately identified species and are robust to missing genotypic data and low‐frequency, shared polymorphisms among species. Finally, we used these tools to identify Coho Salmon incidentally caught in the Columbia River Chinook Salmon sport fishery and used PBT to determine their hatchery of origin. These molecular and computing resources provide a valuable tool for Pacific salmon conservation in the Columbia River basin and demonstrate a cost‐effective approach to species identification for genetic monitoring programs.

Robinson, Zachary L.↗

DOE OSTI2025

Tough Errors are no Match (TEAM): Optimizing the Quantum Compiler for Noise Resilience

This project builds toward a comprehensive error-mitigating toolkit that makes quantum programming more robust and adaptive to the noisy, resource-limited nature of today’s quantum hardware. To that end, it integrates established error-mitigation methods — such as zero-noise extrapolation and dynamical decoupling — directly into compiler infrastructures. These techniques will be packaged as modules that can automatically adjust and combine based on performance analysis, enabling compilers to explore large design spaces and produce optimized, low-noise quantum programs with minimal manual intervention. In parallel, this project also explores new approaches to analog quantum programming or quantum simulation, and has developed the programming language SimuQ which treats quantum Hamiltonian evolution as the central object.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

CFD/FEA Co-Simulation Framework for Analysis of the Thermal Barrier Coating Design and Its Impact on the HD Diesel Engine Performance

Thermal barrier coatings (TBCs) have been investigated both experimentally and through simulation for mixing controlled combustion (MCC) concepts as a method for reducing heat transfer losses and increasing cycle efficiency, but it is still a very active research area. Early studies were inconclusive, with different groups discovering obstacles to realizing the theoretical potential. Nuanced papers have shown that coating material properties, thickness, microstructure, and surface morphology/roughness all can impact the efficacy of the thermal barrier coating and must be accounted for. Adding to the complexities, a strong spatial and temporal heat flux inhomogeneity exists for mixing controlled combustion (diesel) imposed onto the surfaces from the impinging flame jets. In support of the United States Department of Energy SuperTruck II program goal to achieve 55% brake thermal efficiency on a heavy-duty diesel engines, this study sought to develop a deeper insight into the inhomogeneous heat flux from mixing controlled combustion on thermal barrier coatings and to infer concrete guidance for designing coatings. To that end, a co-simulation approach was developed that couples high-fidelity computational fluid dynamics (CFD) modeling of in-cylinder processes and combustion, and finite element analysis (FEA) modeling of the thermal barrier-coated and metal engine components to resolve spatial and temporal thermal boundary conditions. The models interface at the surface of the combustion chamber; FEA modeling predicts the spatially resolved surface temperature profile, while CFD develops insights into the effect of the thermal barrier coating on the combustion process and the boundary conditions on the gas side. The paper demonstrates the capability of the framework to estimate cycle impacts of the temperature swing at the surface, as well as identify critical locations on the piston/thermal barrier coating that exhibit the highest charge temperature and highest heat fluxes. In addition, the FEA results include predictions of thermal stresses, thus enabling insight into factors affecting coating durability. An example of the capability of the framework is provided to illustrate its use for investigating novel coatings and provide deeper insights to guide future coating design.

42 ENGINEERING↗

DOE OSTI2020

Compiler and Runtime Approaches to Enable Large-Scale Irregular Programs. Final report, July 2013 - July 2019

While regular algorithms, characterized by operations on dense matrices and arrays, have long been the mainstay of scientific, high-performance computing, irregular algorithms, which feature unpredictable accesses to pointer-based data structures, are becoming increasingly common in high performance computing, arising in graph analysis, data mining and visualization, among other domains. Unfortunately, the defining characteristics of irregular applications, their dynamic, unpredictable, data-dependent access patterns and data layouts, make achieving high performance on large scale systems difficult. Scaling applications to peta- and exa-scale requires carefully controlling communication and data movement and placement, an inherently difficult task when access patterns and data layouts are unpredictable! Most irregular applications that attain high performance must be painstakingly hand-written and hand-tuned, with few common principles or paradigms uniting various implementations and easing future development. Despite the increasing importance of irregular applications, there is little programmer knowledge, and even less compiler ability, devoted to optimizing them. This project aims to solve these problems. By allowing programmers to write irregular applications in high level forms, with at most a few annotations highlighting key structural properties, programmers can focus on developing their algorithms and methods. The compiler and run-time system can take on the tedious task of optimizing the application for execution at large scales, and can automatically provide efficient implementations. This will provide portability and ease maintenance for existing irregular applications, but, more importantly, open up whole new domains of computational science to large-scale, high-performance simulation codes.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Carving out OPE space and precise O(2) model critical exponents

We develop new tools for isolating CFTs using the numerical bootstrap. A “cutting surface” algorithm for scanning OPE coefficients makes it possible to find islands in high-dimensional spaces. Together with recent progress in large-scale semidefinite programming, this enables bootstrap studies of much larger systems of correlation functions than was previously practical. We apply these methods to correlation functions of charge-0, 1, and 2 scalars in the 3d O(2) model, computing new precise values for scaling dimensions and OPE coefficients in this theory. Our new determinations of scaling dimensions are consistent with and improve upon existing Monte Carlo simulations, sharpening the existing decades-old 8σ discrepancy between theory and experiment.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2022

Hydropower flexibility valuation tool for flow requirement evaluation

Timing of generation is becoming more and more valuable. This creates greater potential tension between environmental and power system objectives since both systems require their own flow patterns. Identifying win–win outcomes in this context requires being able to discuss the value of flexibility across stakeholder groups. This research proposes a two-stage optimization method to understand hydropower flexibility to meet both environmental and power system requirements. The tool simulates the two-settlement market process in the U.S. by maximizing revenues from both the day-ahead and real-time markets, subject to plant operational limits, regulatory flow and ramping requirements, and uncertainties associated with water availability and market prices. The model is formulated as linear programming problems and solved using IBM ILOG CPLEX optimizer. By examining a range of flow requirements, ramping constraints, and storage capacities, the proposed tool shows how to make more informed decisions to weigh the cost of specific flow requirements in the context of the overall license requirements. Results from the case study show that revenue is more sensitive to the ramping constraints than the minimum flow constraints. We also demonstrate that removing flow constraints in a dry month increases monthly revenue by up to 118%, as opposed to only 1% in a wet month. In addition, our results suggest that using a learning-based water flow forecast results in an increase of monthly revenue up to 6.4% compared with persistence forecast.

13 HYDRO ENERGY↗

DOE OSTI2020

Dakota A Multilevel Parallel Object-Oriented Framework for Design Optimization Parameter Estimation Uncertainty Quantification and Sensitivity Analysis: Version 6.12 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization Parameter Estimation Uncertainty Quantification and Sensitivity Analysis: Version 6.12 User's Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a user's manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Development of a Beam Halo Monitor

Muons, Inc. proposed improved Residual-Gas luminescent Beam Profile Monitors for Intense Beams by adding novel features including a mirascope, a light collecting device devised in the 16th century by an inventor of the telescope. A modern mirascope consists of 2 paraboloids. Light generated by the beam is collected by the paraboloids and creates a beam image. By placing a lens near the image it is possible to collect almost 100% of the emitted light, up to ten times better than existing fluorescence profilometers. Intense (multi-MW) proton beams pose a challenge for beam profile measurements. Solid-based beam intercepting instrumentation produces unallowable levels of radiation at these high powers. An alternative is to use a zero-or-low mass device such as a residual-gas profile monitor, either through collection of ionization or fluorescence. Fluorescence has an intrinsic advantage over the usual collection of ionized electrons in that it is not affected by the strong and variable electric and magnetic fields created by the beam that can distort profiles and make calibration difficult. For this reason, we proposed the fluorescence technique using the mirascope and other methods to enhance light collection and versatility by modifying the residual gas and its spatial distribution. In Phase I, we designed a mirascope and its electronics for commissioning and beam tests in a proposed Phase II. The design was based on optical simulations done in Phase I, and a physics run plan was developed for optimizing and testing. The Phase II experimental site and program have been planned and our goal is to produce a universal low cost Mirascope Residual-Gas Luminescent Beam Profile Monitor that can replace all other profile monitors currently used in accelerators.

43 PARTICLE ACCELERATORS↗

DOE OSTI2021

Dakota A Multilevel Parallel Object-Oriented Framework for Design Optimization Parameter Estimation Uncertainty Quantification and Sensitivity Analysis (V.6.14) (Theory Manual)

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Dakota A Multilevel Parallel Object-Oriented Framework for Design Optimization Parameter Estimation Uncertainty Quantification and Sensitivity Analysis (V.6.14) (User's Manual)

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a users manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.13 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.13 User's Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a user’s manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.15 User's Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers.

97 MATHEMATICS AND COMPUTING↗