Search NASA⌕ Search

SEARCH · Search NASA

Results for “dynamic procedures”

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 19 records

Dynamic Procedures Writer's Manual

This presentation provides the background information and introduction to a workshop with the goal to discuss a proposed standard for how to write dynamic procedures. The development of the proposed standard was conducted under the INL-led (Johanna Oxstrand) Work Digitalization Initiative. Mitch Burke (NextAxiom) and Steve McCord (Procedure Solution Management) are the authors of the proposed standard. They will lead the actual workshop.

47 OTHER INSTRUMENTATION↗

A dynamic variational multiscale method on unstructured meshes for stationary transport problems

Here, this paper presents a variational multiscale (VMS) based finite element method where the stabilization parameter is computed dynamically. The current dynamic procedure takes in a general structure/form of the stabilization parameter with unknown coefficients and computes them dynamically in a local fashion resulting in a dynamic VMS-based finite element method. Thus, a static stabilization parameter with pre-defined coefficients is not needed. A variational Germano identity (VGI) based local procedure suitable for unstructured meshes is developed to perform the dynamic computation in a local fashion. The local VGI based procedure is applied for each interior vertex in the mesh and unknown coefficients are first determined locally at each vertex, and subsequently, for each element a maximum value is taken over the vertices of the element. To make the current procedure practical, a coarser secondary solution is constructed from the primary coarse-scale solution, which is done locally over a patch of elements around each interior vertex. Further, averaging steps are employed to make the local dynamic procedure robust. Currently, the new dynamic VMS formulation is applied to steady problems governed by the advection-diffusion and incompressible Navier-Stokes equations in both 1D and 2D to demonstrate its efficacy and effectiveness.

97 MATHEMATICS AND COMPUTING↗

Light Water Reactor Sustainability Program: Use of Time Distributions to Predict Operator Procedure Performance in Dynamic Human Reliability Analysis

The Human Unimodel for Nuclear Technology to Enhance Reliability (HUNTER) framework affords software capable of conducting human reliability analysis (HRA) using a dynamic approach built around operating procedures (OPs) from nuclear power plants (NPPs). Previous HUNTER reports document the development of this software tool, the coupling of HUNTER to the simulator code, the collection of operator performance data by using simulators to calibrate HUNTER models, and linking HUNTER to probabilistic risk assessment (PRA) software. The present report largely addresses two topics. The first is a new function in HUNTER called the HUNTER Procedure Performance Predictor (P3). HUNTER P3 uses HUNTER’s built in Monte Carlo tools featuring human performance variability to identify potential error traps in procedures. The second topic is time distribution analysis to generate time inputs for dynamic HRA. The current analysis was performed to investigate time distributions for task primitives, which are the minimum task unit of analysis used in dynamic HRA modeling. Using the time distribution data, the elapsed time for human actions in an extended loss of AC power (ELAP) scenario is then investigated. Time data and prediction are essential for modeling procedure performance.

99 GENERAL AND MISCELLANEOUS↗

A Gradient Based Subgrid-Scale Parameterization for Ocean Mesoscale Eddies

Mesoscale eddies play an important role in transport of heat and biogeochemical tracers in the global ocean circulation. Resolving these energetic eddies, however, is challenging in ocean general circulation models (OGCM) because it requires a horizontal grid spacing of ≲1/8° that is computationally expensive. As a result, we are required to parameterize mesoscale eddy effects on large-scale ocean flows. In this work, we introduce a new subgrid-scale (SGS) model that is developed based on a Taylor series expansion of resolved variables to parameterize subgrid mesoscale eddy transports and momentum fluxes in OGCM. We have performed an a priori study to evaluate the performance of our new gradient model using high-resolution ocean simulations. Our results show that the gradient model well predicts the actual SGS thickness fluxes in the zonal and meridional directions in coarse-resolution simulations with the grid spacing ≳1/4°. The unresolved kinetic energy at the ocean surface is also skillfully estimated. More importantly, unlike current mesoscale eddy parameterizations, which are mainly developed based on an assumption of flat bottom ocean, our new SGS model can capture the structure of unresolved standing meanders at the ocean surface. We have also developed a dynamic procedure for setting in non-dimensional parameters in our new parameterization through a non-ad hoc and tuning-free method. Overall, this work suggests that implementing the gradient model in OGCM can improve the model accuracy with an affordable computational cost in eddy-permitting and non-eddying simulations.

54 ENVIRONMENTAL SCIENCES↗

A Fast Temporal Decomposition Procedure for Long-Horizon Nonlinear Dynamic Programming

We propose a fast temporal decomposition procedure for solving long-horizon nonlinear dynamic programs. The core of the procedure is sequential quadratic programming (SQP) that utilizes a differentiable exact augmented Lagrangian as the merit function. Within each SQP iteration, we approximately solve the Newton system using an overlapping temporal decomposition strategy. We show that the approximate search direction is still a descent direction of the augmented Lagrangian provided the overlap size and penalty parameters are suitably chosen, which allows us to establish the global convergence. Moreover, we show that a unit step size is accepted locally for the approximate search direction and further establish a uniform, local linear convergence over stages. This local convergence rate matches the rate of the recent Schwarz scheme (Na et al. 2022). However, the Schwarz scheme has to solve nonlinear subproblems to optimality in each iteration, whereas we only perform a single Newton step instead. Numerical experiments validate our theories and demonstrate the superiority of our method.

97 MATHEMATICS AND COMPUTING↗

Reduced basis approximations of parameterized dynamical partial differential equations via neural networks

Projection-based reduced order models are effective at approximating parameter-dependent differential equations that are parametrically separable. When parametric separability is not satisfied, which occurs in both linear and nonlinear problems, projection-based methods fail to adequately reduce the computational complexity. Devising alternative reduced order models is crucial for obtaining efficient and accurate approximations to expensive high-fidelity models. In this work, we develop a timestepping procedure for dynamical parameter-dependent problems, in which a neural-network is trained to propagate the coefficients of a reduced basis expansion. This results in an online stage with a computational cost independent of the size of the underlying problem. Here, we demonstrate our method on several parabolic partial differential equations, including a problem that is not parametrically separable.

97 MATHEMATICS AND COMPUTING↗

Successive Procedure for Solution Verification Based on User Needs

This paper discusses a revised solution verification procedure for computational fluid dynamics simulations to estimate the uncertainties in the quantities of interest based on discretization error models. This proposed procedure builds upon current procedures described in ASME V&V 20 but provides more guidance in determining the necessary number of mesh levels to build reliable discretization error models. Such guidance is particularly useful for practicing engineers without prior experience in solution verification. The key features of this proposed solution verification procedure are the ability to determine the need for additional mesh levels iteratively and the seamless treatment for underdetermined, exact, and overdetermined solutions of the power series approximation to the discretization error models. This study applies the proposed procedure to a set of synthetic examples to demonstrate the revised procedure’s clarity in determining the number of mesh solutions required for a reliable estimate of the discretization error in computational fluid dynamics settings. Additionally, this proposed procedure prevents a potential pathway in the current procedure in ASME V&V 20 that may lead to unreasonably small discretization errors.

Weinmeister, Justin↗

Morphology of shocked lateral outflows in colliding hydrodynamic flows

Supersonic interacting flows occurring in phenomena, such as protostellar jets, give rise to strong shocks and have been demonstrated in several laboratory experiments. To study such colliding flows, we use the AstroBEAR AMR code to conduct hydrodynamic simulations in three dimensions. Here, we introduce variations in the flow parameters of density, velocity, and cross-sectional radius of the colliding flows in order to study the propagation and conical shape of the bow shock formed by collisions between two, not necessarily symmetric, hypersonic flows. We find that the motion of the interaction region is driven by imbalances in ram pressure between the two flows, while the conical structure of the bow shock is a result of shocked lateral outflows being deflected from the horizontal when the flows are of differing cross sections.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Modeling the aqueous interface of amorphous TiO 2 using deep potential molecular dynamics

Amorphous titanium dioxide (a-TiO 2 ) is widely used as a coating material in applications such as electrochemistry and self-cleaning surfaces where its interface with water has a central role. However, little is known about the structures of the a-TiO 2 surface and aqueous interface, particularly at the microscopic level. In this work, we construct a model of the a-TiO 2 surface via a cut-melt-and-quench procedure based on molecular dynamics simulations with deep neural network potentials (DPs) trained on density functional theory data. After interfacing the a-TiO 2 surface with water, we investigate the structure and dynamics of the resulting system using a combination of DP-based molecular dynamics (DPMD) and ab initio molecular dynamics (AIMD) simulations. Both AIMD and DPMD simulations reveal that the distribution of water on the a-TiO 2 surface lacks distinct layers normally found at the aqueous interface of crystalline TiO 2 , leading to an ~10 times faster diffusion of water at the interface. Bridging hydroxyls (Ti 2 –O b H) resulting from water dissociation decay several times more slowly than terminal hydroxyls (Ti–O w H) due to fast Ti–O w H 2 → Ti–O w H proton exchange events. These results provide a basis for a detailed understanding of the properties of a-TiO 2 in electrochemical environments. Moreover, the procedure of generating the a-TiO 2 -interface employed here is generally applicable to studying the aqueous interfaces of amorphous metal oxides.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DeePMD-kit v2: A software package for deep potential models

DeePMD-kit is a powerful open-source software package that facilitates molecular dynamics simulations using machine learning potentials known as Deep Potential (DP) models. This package, which was released in 2017, has been widely used in the fields of physics, chemistry, biology, and material science for studying atomistic systems. The current version of DeePMD-kit offers numerous advanced features, such as DeepPot-SE, attention-based and hybrid descriptors, the ability to fit tensile properties, type embedding, model deviation, DP-range correction, DP long range, graphics processing unit support for customized operators, model compression, non-von Neumann molecular dynamics, and improved usability, including documentation, compiled binary packages, graphical user interfaces, and application programming interfaces. This article presents an overview of the current major version of the DeePMD-kit package, highlighting its features and technical details. Additionally, this article presents a comprehensive procedure for conducting molecular dynamics as a representative application, benchmarks the accuracy and efficiency of different models, and discusses ongoing developments.

97 MATHEMATICS AND COMPUTING↗

Dynamic Species Reduction for Multi-Cycle CFD Simulations (Final Technical Report)

This project primarily sought to address some of the computational cost concerns of detailed simulations by developing improved methods of handling species transport, and chemical kinetics evaluation in a commercial 3D Computational Fluid Dynamics (CFD) environment. Secondary goals were to apply these techniques to fuels and conditions of interest to better understand the key species and reactions required to adequately capture cycle to cycle coupling. Improved modeling will lead to better understanding of these combustion modes and their dependence on fuel composition, which can then enable more clean and efficient engines, ultimately benefiting the consumer as well as the general public. Two approaches were used to address the computational cost. A “Dynamic Species Reduction” (DSR) procedure was developed to remove chemical species from the simulation during periods when chemical reactions were not expected to be important, particularly during gas exchange when temperatures are low and little fuel remains. This modelling procedure automatically detects relevant species to retain in the simulation domain based on their local concentration, removes species below a specified concentration threshold, and then adjusts the remaining species mass to conserve not only the number of H, C, and O atoms in each cell, but also the relative proportions between species and the heating value of the mixture in every cell. The second procedure was a “Product Directed Remapping” (PDR) updates the algorithm used to group individual computational cells for chemical kinetics evaluation to account for non-uniform temperature distributions and the CO to CO 2 ratio in the cells. The model techniques developed in this work successfully demonstrated computational performance improvements for a range of conditions relevant for Highly Dilute SI and HCCI engine operation. Runtime reductions of 10% were observed for small mechanisms, with further reductions of up to 36% observed for larger mechanisms. Improvements were primarily related to reducing the number of chemical species tracked during the gas exchange process using the Dynamic Species Reduction method. With smaller benefits observed from changes to the kinetics binning and evaluation strategy in the post combustion region using the PDR method. The results of this work show the potential for improved computational runtime for complicated simulations. They can and should be extended to additional conditions and new bio-derived and renewable fuels as they are developed and new kinetic mechanisms become available.

10 SYNTHETIC FUELS↗

A review of fluids under nanoconfinement: Reactivity, geomechanics, phase transitions, and flow

Due to its many industrial applications, the physics associated with the nanoconfinement of fluids has garnered great attention from the scientific community in roughly the last fifteen years. One pioneer of that research has been the Multi-Scale Fluid-Solid Interactions in Architected and Natural Materials (MUSE) Energy Frontier Research Center, which produced more than 50 journal articles from 2018 to 2023. We structure the findings of MUSE into four categories and contextualize the work with the broader literature. Here, the four categories are (1) the dependence of chemical reactions on the degree of confinement, which given the lower freedom of motion of molecules yet improved availability of reaction sites generally lead to enhancement from bulk reactions; (2) the mechanical properties of the porous matrix, which are dependent on the heterogeneity of the system in terms of both composition and structure; (3) the phase transitions under nanoconfinement, which are influenced by the pore size and morphology, surface chemistry, and substrate composition; and (4) the physical controls of slip flow, which demonstrate the importance of several factors, such as wettability. These aspects of nanoconfinement are becoming clearer, but there are other elements such as mathematical theory that are still being developed.

58 GEOSCIENCES↗

Simulation-Based Recovery Action Analysis Using the EMRALD Dynamic Risk Assessment Tool

Recovery human action is defined as the action that prevents deviant conditions from producing unwanted effects. Analyzing recovery actions has been a critical part in human reliability analysis (HRA). However, there are a couple of limitations to treating recovery actions using only the current HRA methods available. Representatively, the existing recovery analysis does not specifically consider recovery actions as they have occurred in actual nuclear power plants (NPPs). To handle the challenges in the existing recovery analyses, this study suggests a way to analyze recovery actions under a dynamic HRA method, the Procedure-based Risk Investigation MEthod-Human Reliability Analysis (PRIME-HRA) method. The PRIME-HRA method suggests a way on how to develop dynamic simulation models using dynamic risk assessment tools such as the Event Modeling Risk Assessment Using Linked Diagram (EMRALD) [1] and the Human Unimodel for Nuclear Technology to Enhance Reliability (HUNTER) [2]. EMRALD and HUNTER are the dynamic probabilistic risk assessment and HRA tools developed at Idaho National Laboratory. In this paper, differences on analyzing recovery actions in the Technique for Human Error-Rate Prediction (THERP), the Cause-Based Decision Tree (CBDT) and the Korean Standard HRA (K-HRA) and challenges of these approaches are introduced. How we have developed the PRIME-HRA is also introduced in this paper. Then, the proposed approach to analyzing recovery human actions in dynamic context is partially discussed with an example.

99 GENERAL AND MISCELLANEOUS↗

Probing Quantum Telecloning on Superconducting Quantum Processors

Quantum information cannot be perfectly cloned, but approximate copies of quantum information can be generated. Quantum telecloning combines approximate quantum cloning, more typically referred to as quantum cloning, and quantum teleportation. Quantum telecloning allows approximate copies of quantum information to be constructed by separate parties, using the classical results of a Bell measurement made on a prepared quantum telecloning state. Quantum telecloning can be implemented as a circuit on quantum computers using a classical coprocessor to compute classical feedforward instructions using if statements based on the results of a midcircuit Bell measurement in real time. We present universal symmetric optimal 1 → M telecloning circuits and experimentally demonstrate these quantum telecloning circuits for M = 2 up to M = 10, natively executed with real-time classical control systems on IBM Quantum superconducting processors, known as dynamic circuits. We perform the cloning procedure on many different message states across the Bloch sphere, on seven IBM Quantum processors, optionally using the error suppression technique X–X sequence digital dynamical decoupling. Two circuit optimizations are utilized: one that removes ancilla qubits for M = 2,3 , and one that reduces the total number of gates in the circuit but still uses ancilla qubits. Parallel single-qubit tomography with maximum likelihood estimation density matrix reconstruction is used in order to compute the mixed-state density matrices of the clone qubits, and clone quality is measured using quantum fidelity. These results present one of the largest and most comprehensive noisy intermediate-scale quantum computer experimental analyses on (single qubit) quantum telecloning to date. The clone fidelity sharply decreases to 0.5 for M > 5 , but for M = 2 , we are able to achieve a mean clone fidelity of up to 0.79 using dynamical decoupling.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Foundations of magnetohydrodynamics

In this tutorial, a derivation of magnetohydrodynamics (MHD) valid beyond the usual ideal gas approximation is presented. Non-equilibrium thermodynamics is used to obtain conservation equations and linear constitutive relations. When coupled with Maxwell's equations, this provides closed fluid equations in terms of material properties of the plasma, described by the equation of state and transport coefficients. These properties are connected to microscopic dynamics using the Irving–Kirkwood procedure and Green–Kubo relations. Symmetry arguments and the Onsager–Casimir relations allow one to vastly simplify the number of independent coefficients. Importantly, expressions for current density, heat flux, and stress (conventionally Ohm's law, Fourier's law, and Newton's law) take different forms in systems with a non-ideal equation of state. The traditional form of the MHD equations, which is usually obtained from a Chapman–Enskog solution of the Boltzmann equation, corresponds to the ideal gas limit of the general equations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Small-Signal Analysis of Current-Limiting Grid-Forming Inverters

Grid-forming (GFM) inverters are equipped with a current limiter to protect the device during grid disturbances. Because the intervention of the current limiter can compromise the transient stability of the GFM inverter, various types of current limiter designs and additional frequency-stabilization control methods have been proposed in recent literature to aid in transient GFM inverter stability; however, the small-signal stability implications of adding these additional control blocks during, in particular, off-nominal conditions are not fully understood. To address this challenge, this paper presents a generic small-signal model of a GFM inverter that incorporates various types of current limiters and frequency stability-enhancing controls. With the proposed model, we analyze the root causes of inverter instability, which reveals two critical design trade-offs. First, due to current-limiter engagement caused by a disturbance, the GFM inverter dynamics are altered, which can lead to voltage oscillations. Second, additional frequency-stabilization controls can improve the small-signal stability of the GFM inverter, but at the cost of reduced power and voltage support to the grid. Comprehensive hardware experiments validate the theoretical concept and analysis. The findings in this work underscore the importance of incorporating both transient-response and small-signal dynamics requirements into the design procedure of GFM current limiters and frequency-stabilization controls.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Extreme-scale stochastic optimization and simulation via learning-enhanced decomposition and parallelization (Final Technical Report)

Stochastic optimization and simulation models ubiquitously arise in designing and operating complex service/engineering systems. They can be extreme in scale due to high-dimensional data and decisions, and can also involve decisions made sequentially in response to newly revealed data, both causing significant computational challenge. The objective of this research is to explore a unified framework that integrates machine learning with discrete optimization and risk-averse modeling, to improve the efficiency of decomposition paradigms for stochastic optimization and simulations at extreme scale. The models we consider represent a broad class of complex decision-making problems, where 0-1 or continuous decisions are made before and/or after knowing multiple sources of uncertainties that could be correlated. We will employ machine learning methods to dynamically decide and prioritize computational procedures, including cut generation, branching, and bounding of the optimal objective. Furthermore, the research will shed new lights on the traditional decomposition algorithms for extreme-scale computing. Deliverables of the research include new modeling and computational methods for advancing the state-of-the-art research in optimization and simulation, bringing many relevant risk-averse, data-driven optimization problems in practice within the range of tractability. Examples include distributed computing server scheduling and sensor deployment for monitoring critical infrastructures. Success in this effort will enable progress in solving multiple extreme-scale problems in the complex system design and operations arising from DoE missions in energy, environment, and national security.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Automatically parallelizing batch inference on deep neural networks using Fiats and Fortran 2023 `do concurrent`

This paper introduces novel programming strategies that leverage features of the Fortran 2023 standard of the International Standards Organization (ISO) to automatically parallelize computations on deep neural networks. The paper focuses on the interplay of object-oriented, parallel, and functional programming paradigms in the Fiats deep learning library. We demonstrate how several infrequently used language features play a role in enabling efficient, parallel execution. Specifically, the ability to explicitly declare that a procedure is pure facilitates inference in the context of the language’s loop-parallelism construct `do concurrent`. Also, explicitly prohibiting the overriding of a parent type’s type-bound procedures eliminates the need for dynamic dispatch in performance-critical code. Finally, this paper uses batch inference calculations on a neural network surrogate for atmospheric aerosol dynamics to demonstrate that LLVM Flang compiler’s automatic parallelization of `do concurrent` achieves roughly the same performance and scalability as achieved by OpenMP compiler directives. We also demonstrate that double-precision inference costs 37–72% longer runtime than default-real precision with most values in the range 57-60%.

Rouson, Damian↗