Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “time step”

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 307 records · Page 17

A Deep Learning Pipeline for Optimizing Large-scale Phase Field Simulations

Phase field (PF) simulations are computationally expensive but remain a key analysis tool to understand the complex mechanisms of additive manufacturing (AM) processes. Each PF simulation-aided analysis requires thousands of node hours on leadership-class supercomputers. One of the main goals of these analyses is the study of microstructure evolution during the build process which begins with the onset of nucleation. Nucleation occurs under certain thermomechanical conditions which are not known a priori and many PF simulations are required to identify ranges of input thermo-mechanical parameters that can result in the onset of nucleation. Since many of the simulations do not result in nucleation, an analysis campaign often ends up wasting tremendous amounts of precious computing resources executing nucleation-absent simulations. The goal of this work is to design and train deep learning models to inform a PF simulation about the likelihood of the occurrence of nucleation in a future simulation time-step based on the state summary over a finite number of past time-steps of a running simulation. If the prediction determines that the running simulation is unlikely to reach nucleation in the allotted time, then its execution is stopped immediately ultimately resulting in vast reduction in wasted computations when accrued over all the PF simulations typically performed in a single or multiple analysis campaign(s). The paper presents the performance of a machine learning pipeline that uses a convolutional neural network (CNN) model to learn an embedding which is then used with a self-attention network to build a multi-task deep learning model to predict the likelihood of nucleation. The model also predicts the input parameters used in a simulation. Performance is compared with a baseline pipeline that uses an off-the-shelf LeNet-5 model to learn the initial embedding. Despite their smaller size, performance results indicate significant improvement in accuracy of the proposed models compared to the larger baseline models.

Kannan, Ramakrishnan {ramki}↗

Encoder–decoder neural network for solving the nonlinear Fokker–Planck–Landau collision operator in XGC

An encoder–decoder neural network has been used to examine the possibility for acceleration of a partial integro-differential equation, the Fokker–Planck–Landau collision operator. This is part of the governing equation in the massively parallel particle-in-cell code XGC, which is used to study turbulence in fusion energy devices. The neural network emphasizes physics-inspired learning, where it is taught to respect physical conservation constraints of the collision operator by including them in the training loss, along with the ℓ 2 loss. In particular, network architectures used for the computer vision task of semantic segmentation have been used for training. A penalization method is used to enforce the ‘soft’ constraints of the system and integrate error in the conservation properties into the loss function. During training, quantities representing the particle density, momentum and energy for all species of the system are calculated at each configuration vertex, mirroring the procedure in XGC. This simple training has produced a median relative loss, across configuration space, of the order of 10 –4 , which is low enough if the error is of random nature, but not if it is of drift nature in time steps. The run time for the current Picard iterative solver of the operator is O(n 2 ), where n is the number of plasma species. As the XGC1 code begins to attack problems including a larger number of species, the collision operator will become expensive computationally, making the neural network solver even more important, especially since its training only scales as O(n). Here, a wide enough range of collisionality has been considered in the training data to ensure the full domain of collision physics is captured. An advanced technique to decrease the losses further will be subject of a subsequent report. Eventual work will include expansion of the network to include multiple plasma species.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An Orbital Basis Set for Double Photoionization of Atoms and Molecules

The ab initio theoretical treatment of one-photon double photoionization processes has been limited to atoms and diatomic molecules by the challenges posed by large grid-based representations of the double ionized continuum wave function. To provide a path for extensions to polyatomics, an energy-adapted orbital basis approach is demonstrated that reduces the dimensions of such representations and simultaneously allows larger time steps in time-dependent computational descriptions of double ionization. Additionally, an algorithm that exploits the diagonal nature of the two-electron integrals in the grid basis and dramatically accelerates the transformation between grid and orbital representations is presented. Excellent agreement between the present results and benchmark theoretical calculations is found for H – and Be atoms, as well as the hydrogen molecule, including for the triply differential cross sections that relate the angular distribution and energy sharing of all of the particles in the molecular frame.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Toward continuum gyrokinetic study of high-field mirrors

High-temperature superconducting (HTS) magnetic mirrors under development exploit strong fields with high mirror ratio to compress loss cones and enhance confinement and may offer cheaper, more compact fusion power plant candidates. This new class of devices could exhibit largely unexplored interchange and gradient-driven modes. Such instabilities, and methods to stabilize them, can be studied with gyrokinetics, given the strong magnetization and prevalence of kinetic effects. Our focus here is to (a) determine if oft-used gyrokinetic models for open field lines produce the electron-confining (Pastukhov) electrostatic potential and (b) examine and address challenges faced by gyrokinetic codes in studying HTS mirrors. Here, we show that a one-dimensional limit of said models self-consistently develops a potential qualitatively approaching the analytical Pastukhov level. Additionally, we describe the computational challenges of studying high mirror ratios with open field line gyrokinetic solvers and offer a force softening method to mitigate small time steps needed for time integration in colossal magnetic field gradients produced by HTS coils, providing a 19X speedup.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Hydroboost

HydroBoost is the most realistic revenue optimization tool for the hybridization of hydropower and battery energy storage systems to date. The innovative representation of how operators actually schedule hydropower in practice results in more realistic predictions of revenue and operations. Unlike other optimization tools, HydroBoost generates forecast energy prices with uncertainty to use in the optimization. This allows HydroBoost to give users a range of potential revenue with an upper bound using the perfect foresight pricing and a lower bound using a naive persistence forecast model. Additional forecast can be generated and used in the optimization, such as additive models, random forest, and neural networks to give further insight into potential revenue. HydroBoost has been designed to be applicable for both run-of-river and reservoir storage sites. The primary focus is on the day-ahead market and requires year-long data with an hour time-step. All time-series input and constraints are contained in an Excel worksheet for convince. The user will run the forecasting generation first with a Python script to give the optimization model the necessary requirements. Next the optimization is ran using Julia and results are generated and stored into a directory as csv files. HydroBoost includes an additional module to generate figures based on the results of the optimization simulation. The results help analyze the results and users to draw insights into how the hydro and battery systems are operated and the revenue each is producing. Additionally, the difference between the perfect foresight model and models that include forecast can easily be inspected.

Phillips, TylerB. [Idaho National Laboratory (INL)↗

time-resolved spectroscopy fit (trspecfit) v0.01

Analyze 2D time- and energy-resolved data, such as from a pump-probe spectroscopy experiment. User can select and input different peak shapes/ functions and background types to first fit a ground state/ unperturbed spectrum. This would be similar to how standard spectroscopy data is fit. Subsequently, to describe the time domain, users can choose functions that describe the temporal dynamics of one or more spectral features, such as a peak amplitude, peak position, etc. These time dynamics functions can be added or convoluted (e.g. describing an instrument response function) with each other. Functionality to integrate implicit variables leading to distributions of certain parameters/ functions is in development. Alternatively, 2D data can be analyzed one time step at a time to get an idea of the time dynamics of the system before deploying the global 2D fit described above. Typically people write custom software for this purpose. During my PhD I've seen five internal LBL and external researchers write one-off code in different languages to analyze time- and energy-resolved spectra. While this was specifically was for a laser pump - X-ray probe spectroscopy experiment, I'm trying to write a general package for the time-resolved spectroscopy community.

Mahl, Johannes [Lawrence Berkeley National Laborat↗

Monotone implicit algorithms for the small-disturbance and full potential equations applied to transonic flows

Numerical calculations of transonic flows by potential equations typically use algorithms that change the method of calculation for regions of subsonic and supersonic flow. In this paper, implicit approximate-factorization algorithms are modified to use the monotonic switch in the type of finite-differencing that was developed by Godunov for the Euler equations. Calculations of flows over airfoils by these algorithms are compared with calculations by other methods that are in common usage. For the small-disturbance potential equation, comparisons are made with the Murman-Cole method and the monotone method of Engquist and Osher for both steady and unsteady flows. For the full potential equation, comparisons are made with the methods of Jameson and of Holst and Ballhaus for steady flows. The comparisons show that the monotone methods are more stable. For steady flows, solutions are obtained for cases where the Murman-Cole switch requires a time step over ten times smaller in order for the calculations to remain stable. These improvements are achieved with no increase in computer storage and only minor modifications in current codes.

Goorjian, P. M.↗

ADI on staggered mesh - A method for the calculation of compressible convection

An alternating direction implicit (ADI) method has been applied to a staggered grid for the computation of convection in a highly stratified fluid. Since artificial viscosity is not needed, subtle effects like the onset of convection can be studied. These computations compare well with the 2-D results by Graham (1975) and also agree with standard Boussinesq results when taken to that limit. Good efficiency has been achieved with a time step hundreds of times larger than the stability limit imposed by the explicit treatment of diffusion and the Courant number is not restricted to be below 1. The Navier-Stokes equation contains cross spatial derivatives which are treated explicitly in most ADI schemes. The destabilizing effect of such a practice on a 2-D model system with second-order spatial derivative terms only was analyzed and found to be not excessive.

Chan, K. L.↗

An unconditionally stable Runge-Kutta method for unsteady flows

A quasi-three dimensional analysis was developed for unsteady rotor-stator interaction in turbomachinery. The analysis solves the unsteady Euler or thin-layer Navier-Stokes equations in a body fitted coordinate system. It accounts for the effects of rotation, radius change, and stream surface thickness. The Baldwin-Lomax eddy viscosity model is used for turbulent flows. The equations are integrated in time using a four stage Runge-Kutta scheme with a constant time step. Implicit residual smoothing was employed to accelerate the solution of the time accurate computations. The scheme is described and accuracy analyses are given. Results are shown for a supersonic through-flow fan designed for NASA Lewis. The rotor:stator blade ratio was taken as 1:1. Results are also shown for the first stage of the Space Shuttle Main Engine high pressure fuel turbopump. Here the blade ratio is 2:3. Implicit residual smoothing was used to increase the time step limit of the unsmoothed scheme by a factor of six with negligible differences in the unsteady results. It is felt that the implicitly smoothed Runge-Kutta scheme is easily competitive with implicit schemes for unsteady flows while retaining the simplicity of an explicit scheme.

Jorgenson, Philip C. E.↗

An unconditionally stable Runge-Kutta method for unsteady flows

A quasi-three-dimensional analysis was developed for unsteady rotor-stator interaction in turbomachinery. The analysis solves the unsteady Euler or thin-layer Navier-Stokes equations in a body-fitted coordinate system. It accounts for the effects of rotation, radius change, and stream surface thickness. The Baldwin-Lomax eddy viscosity model is used for turbulent flows. The equations are integrated in time using a four-stage Runge-Kutta scheme with a constant time step. Implicit residual smoothing was employed to accelerate the solution of the time accurate computations. The scheme is described and accuracy analyses are given. Results are shown for a supersonic through-flow fan designed for NASA Lewis. The rotor:stator blade ratio was taken as 1:1. Results are also shown for the first stage of the Space Shuttle Main Engine high pressure fuel turbopump. Here the blade ratio is 2:3. Implicit residual smoothing was used to increase the time step limit of the unsmoothed scheme by a factor of six with negligible differences in the unsteady results. It is felt that the implicitly smoothed Runge-Kutta scheme is easily competitive with implicit schemes for unsteady flows while retaining the simplicity of an explicit scheme.

Jorgenson, Philip C. E.↗

A parallel structure transient response algorithm using independent substructure response computation

An algorithm for parallel computation of transient response for structures is presented in which responses of substructures are computed independently for dozens of time steps at a time, and these substructure responses are then corrected to obtain the response of the overall coupled structure. The correction of the uncoupled substructure responses only requires the responses computed for interfaces at occasional points in time, and is done independently for different substructures in a very efficient procedure. A numerical example is presented to demonstrate the method and show the accuracy of the method.

Bennighof, Jeffrey K.↗

Interactive real time flow simulations

An interactive real time flow simulation technique is developed for an unsteady channel flow. A finite-volume algorithm in conjunction with a Runge-Kutta time stepping scheme was developed for two-dimensional Euler equations. A global time step was used to accelerate convergence of steady-state calculations. A raster image generation routine was developed for high speed image transmission which allows the user to have direct interaction with the solution development. In addition to theory and results, the hardware and software requirements are discussed.

Sadrehaghighi, I.↗

Computation of propulsion-related flowfields using unstructured adaptive meshes

In this paper, we describe a computational fluid dynamics (CFD) technique based on unstructured triangular/tetrahedral meshes. A finite-volume scheme is used in conjunction with a multi-stage Runge-Kutta algorithm. Convergence enhancements in the form of dual time-stepping and time-derivative preconditioning are used to overcome the limitations of conventional multi-stage schemes. The method is applied to propulsion-related flows and shown to perform satisfactorily.

Weiss, Jonathan M.↗

Unstructured grid methods for the simulation of 3D transient flows

A description of the research work undertaken under NASA Research Grant NAGW-2962 has been given. Basic algorithmic development work, undertaken for the simulation of steady three dimensional inviscid flow, has been used as the basis for the construction of a procedure for the simulation of truly transient flows in three dimensions. To produce a viable procedure for implementation on the current generation of computers, moving boundary components are simulated by fixed boundaries plus a suitably modified boundary condition. Computational efficiency is increased by the use of an implicit time stepping scheme in which the equation system is solved by explicit multistage time stepping with multigrid acceleration. The viability of the proposed approach has been demonstrated by considering the application of the procedure to simulation of a transonic flow over an oscillating ONERA M6 wing.

Morgan, K.↗

Unsteady Analysis of Separated Aerodynamic Flows Using an Unstructured Multigrid Algorithm

An implicit method for the computation of unsteady flows on unstructured grids is presented. The resulting nonlinear system of equations is solved at each time step using an agglomeration multigrid procedure. The method allows for arbitrarily large time steps and is efficient in terms of computational effort and storage. Validation of the code using a one-equation turbulence model is performed for the well-known case of flow over a cylinder. A Detached Eddy Simulation model is also implemented and its performance compared to the one equation Spalart-Allmaras Reynolds Averaged Navier-Stokes (RANS) turbulence model. Validation cases using DES and RANS include flow over a sphere and flow over a NACA 0012 wing including massive stall regimes. The project was driven by the ultimate goal of computing separated flows of aerodynamic interest, such as massive stall or flows over complex non-streamlined geometries.

Pelaez, Juan↗

Time-Extended Policies in Mult-Agent Reinforcement Learning

Reinforcement learning methods perform well in many domains where a single agent needs to take a sequence of actions to perform a task. These methods use sequences of single-time-step rewards to create a policy that tries to maximize a time-extended utility, which is a (possibly discounted) sum of these rewards. In this paper we build on our previous work showing how these methods can be extended to a multi-agent environment where each agent creates its own policy that works towards maximizing a time-extended global utility over all agents actions. We show improved methods for creating time-extended utilities for the agents that are both "aligned" with the global utility and "learnable." We then show how to crate single-time-step rewards while avoiding the pi fall of having rewards aligned with the global reward leading to utilities not aligned with the global utility. Finally, we apply these reward functions to the multi-agent Gridworld problem. We explicitly quantify a utility's learnability and alignment, and show that reinforcement learning agents using the prescribed reward functions successfully tradeoff learnability and alignment. As a result they outperform both global (e.g., team games ) and local (e.g., "perfectly learnable" ) reinforcement learning solutions by as much as an order of magnitude.

Tumer, Kagan↗

Construction of Low Dissipative High Order Well-Balanced Filter Schemes for Non-Equilibrium Flows

The goal of this paper is to generalize the well-balanced approach for non-equilibrium flow studied by Wang et al. [26] to a class of low dissipative high order shock-capturing filter schemes and to explore more advantages of well-balanced schemes in reacting flows. The class of filter schemes developed by Yee et al. [30], Sjoegreen & Yee [24] and Yee & Sjoegreen [35] consist of two steps, a full time step of spatially high order non-dissipative base scheme and an adaptive nonlinear filter containing shock-capturing dissipation. A good property of the filter scheme is that the base scheme and the filter are stand alone modules in designing. Therefore, the idea of designing a well-balanced filter scheme is straightforward, i.e., choosing a well-balanced base scheme with a well-balanced filter (both with high order). A typical class of these schemes shown in this paper is the high order central difference schemes/predictor-corrector (PC) schemes with a high order well-balanced WENO filter. The new filter scheme with the well-balanced property will gather the features of both filter methods and well-balanced properties: it can preserve certain steady state solutions exactly; it is able to capture small perturbations, e.g., turbulence fluctuations; it adaptively controls numerical dissipation. Thus it shows high accuracy, efficiency and stability in shock/turbulence interactions. Numerical examples containing 1D and 2D smooth problems, 1D stationary contact discontinuity problem and 1D turbulence/shock interactions are included to verify the improved accuracy, in addition to the well-balanced behavior.

Wang, Wei↗

Work Experience Report

The NASA Platform for Autonomous Systems (NPAS) toolkit is currently being used at the NASA John C. Stennis Space Center (SSC) to develop the INSIGHT program, which will autonomously monitor and control the Nitrogen System of the High Pressure Gas Facility (HPGF) on site. The INSIGHT program is in need of generic timing capabilities in order to perform timing based actions such as pump usage timing and sequence step timing. The purpose of this project was to develop a timing module that could fulfill these requirements and be adaptable for expanded use in the future. The code was written in Gensym G2 software platform, the same as INSIGHT, and was written generically to ensure compatibility with any G2 program. Currently, the module has two timing capabilities, a stopwatch function and a countdown function. Although the module has gone through some functionality testing, actual integration of the module into NPAS and the INSIGHT program is contingent on the module passing later checks.

Guo, Daniel↗