Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computation time”

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 577 records · Page 32
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Using Computer Simulations to Optimize Biofuel Production

The DOE strives to ensure America's security and prosperity by addressing energy challenges. NREL shares this goal and tries to achieve a clean energy world. Fossil fuels are problematic for both organizations. Using them endangers American security. Their supply is finite and burning them causes environmental damage. Biofuels are a good alternative to fossil fuels. They are renewably produced on American soil and can lower greenhouse gas emissions. Also, cars and planes need no costly mechanical adjustments to use biofuels. However, the fuels themselves are expensive. For my SULI project, I reduced the cost of biofuels by optimizing the production process through computer simulations. Existing simulations were accurate but slow. One simulation takes up to eight hours, and researchers must do hundreds. My solution reduces the computing time. I treated the biomass particles in the simulation as one-dimensional. That simplified the simulation equations, making them easier for the computer to solve. Still, biomass particles are three-dimensional. The 1D assumption was wrong and produced inaccurate results. To maintain accuracy while increasing speed, I developed a method to convert 1D simulation results into usable 3D data. I adjusted the 1D simulation until the output matched the 3D results for a specific environment. I found out how much the simulation changed when the environment changed. Machine learning algorithms defined a relationship between 1D and 3D data for all environments. This lets scientists convert fast 1D simulation results into valid 3D data.

1D↗
DOE OSTI2025

Efficient Training of Deep Neural Operator Networks via Randomized Sampling

Neural operators (NOs) employ deep neural networks to learn the mappings between infinitedimensional function spaces. Deep operator network (DeepONet), a popular NO architecture, has demonstrated success in the real-time prediction of complex dynamics across various scientific and engineering applications. In this work, we introduce a random sampling technique to be adopted during the training of DeepONet, aimed at improving the generalization ability of the model, while significantly reducing the computational time. The proposed approach targets the trunk network of the DeepONet model that outputs the basis functions corresponding to the spatiotemporal locations of the bounded domain on which the physical system is defined. While constructing the loss function, DeepONet training traditionally considers a uniform grid of spatiotemporal points at which all the output functions are evaluated for each iteration. This approach leads to a larger batch size, resulting in poor generalization and increased memory demands, due to the limitations of the stochastic gradient descent (SGD) optimizer. The proposed random sampling over the inputs of the trunk net mitigates these challenges, improving generalization and reducing the memory requirements during training, resulting in significant computational gains. We validate our hypothesis through three benchmark examples, demonstrating substantial reductions in training time while achieving comparable or lower overall test errors relative to the traditional training approach. Our results indicate that incorporating randomization in the trunk network inputs during training enhances the efficiency and robustness of DeepONet, offering a promising avenue for improving the framework’s performance in modeling complex physical systems.

Karumuri, Sharmila [Department of Civil & Systems ↗
DOE OSTI2022

Inputs and Outputs for paper "The DESC stellarator code suite. Part 1. Quick and accurate equilibria computations"

Contains the DESC and VMEC input and output files used in the paper, as well as the plotting scripts used to create the figures in the paper (Current with the arXiv Mar 31 2022 version, https://arxiv.org/abs/2203.17173v1): 3D equilibrium codes are vital for stellarator design and operation, and high-accuracy equilibria are also necessary for stability studies. This paper details comparisons of two 3D equilibrium codes, VMEC, which uses a steepest-descent algorithm to reach a minimum-energy plasma state, and DESC, which minimizes the MHD force error in real space directly. Accuracy as measured by final plasma energy and satisfaction of MHD force balance, as well as other metrics, will be presented for each code, along with the computation time. It is shown that DESC is able to achieve more accurate solutions, especially near-axis. DESC's global Fourier-Zernike basis also yields the solution everywhere in the plasma volume, not just on discrete flux surfaces. Further, DESC can compute the same accuracy solution as VMEC in an order of magnitude less time.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1988

Tabulation of Mie scattering calculation results for microwave radiative transfer modeling

In microwave radiative transfer model simulations, the Mie calculations usually consume the majority of the computer time necessary for the calculations (70 to 86 percent for frequencies ranging from 6.6 to 183 GHz). For a large array of atmospheric profiles, the repeated calculations of the Mie codes make the radiative transfer computations not only expensive, but sometimes impossible. It is desirable, therefore, to develop a set of Mie tables to replace the Mie codes for the designated ranges of temperature and frequency in the microwave radiative transfer calculation. Results of using the Mie tables in the transfer calculations show that the total CPU time (IBM 3081) used for the modeling simulation is reduced by a factor of 7 to 16, depending on the frequency. The tables are tested by computing the upwelling radiance of 144 atmospheric profiles generated by a 3-D cloud model (Tao, 1986). Results are compared with those using Mie quantities computed from the Mie codes. The bias and root-mean-square deviation (RMSD) of the model results using the Mie tables, in general, are less than 1 K except for 37 and 90 GHz. Overall, neither the bias nor RMSD is worse than 1.7 K for any frequency and any viewing angle.

Yeh, Hwa-Young M.↗
DOE OSTI2026

Machine Learning Based Metamodel for Faster Life Cycle Assessment of Large Portfolio of Buildings

Managing a large portfolio of buildings involves decisions on reuse, retrofit, renovation, rehabilitation, and new construction, influenced by trade-offs between performance metrics such as cost, time, and operational flexibility over the building's life cycle. Traditional life cycle assessment tools for evaluating these metrics can be labor- and compute-intensive, requiring extensive data and modeling for each building. Metamodels (or surrogate models) using machine learning have been explored as faster alternatives, but training these models has been hindered by the limited availability of comprehensive data on key life cycle metrics. Recent advancements in machine learning, particularly deep learning techniques like zero-shot and few-shot learning, allow models to learn from sparse or limited data. We propose a machine learning-based metamodel that leverages these techniques for rapid estimation of key building life cycle metrics. This presentation will cover the model architecture, data collection, training, and validation processes, along with an ongoing case study applied to a large portfolio of buildings. We will discuss the model's performance in terms of accuracy, compute time, limitations, and its potential for expanding to additional life cycle metrics. This data-driven approach offers a promising direction for the rapid evaluation of large building portfolios.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2023

Multi-Objective Adaptive Mesh Refinement Using Reinforcement Learning

Finite element methods approximate the solution to a partial differential equation (PDE) on a mesh consisting of many elements. In general, using more, smaller elements results in a lower error in the approximation. However, it is often possible to lower the error substantially by only refining, or decreasing the size of, the few elements in the mesh that have the highest error. Adaptive mesh refinement (AMR) is a process that selectively refines regions of a mesh with high error to achieve a desired accuracy in as few degrees of freedom (DOFs) as possible. AMR is favorable compared to uniform refinement, which refines all elements of the mesh equally, because it can often achieve the same accuracy without wasting extra computation time on refinement of elements that already have low error. However, it is difficult to know which elements to refine. In this report we explore ways to choose which elements to refine such that we minimize both the resulting error and the cumulative DOFs used in computation. In particular, we introduce a Pareto-front learning algorithm that trains a policy to give the optimal refinement actions to minimize the cumulative DOFs used to achieve a given target error. Such a policy is useful because it can be deployed on many different problem types where different accuracy levels are desired. Furthermore, training a single policy for a range of target errors allows us to use transfer learning to reduce the required training time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

NEAMS Milestone Report: M2MS–20OR030102 FW–CADIS PWR Ex-Core Analysis with Shift Through VERA

This report presents the work completed for the NEAMS milestone M2MS–20OR030102 titled "FW–CADIS PWR Ex-Core Analysis with Shift through VERA." The work completed for this milestone includes the implementation, integration, and optimization of memory and performance improvement methods in Shift for fully coupled ex-core calculations through Virtual Environment for Reactor Applications (VERA). Fully coupled in this context means the transfer of moderator boron concentration, pin-wise fission source, depleted compositions, temperatures, and moderator densities from MPACT (with COBRA-TF (CTF)) to Shift. The ability to run ex-core calculations with VERA has been enabled and used for several years by Consortium for Advanced Simulation of Light Water Reactors (CASL) partners. However, this implementation was limited and potentially computationally burdensome. This work has enabled the ability to run higher-fidelity ex-core calculations on moderate computing clusters by focusing on multithreading, domain decomposition, and Forward-Weighted CADIS (FW-CADIS) variance reduction. Tests performed on small cores, a small modular reactor (SMR), and CASL progression problems show very promising memory reduction and computational performance. Recommendations for settings when running fully coupled high-fidelity ex-core calculations with VERA are documented. Without these optimization methods, many processors on a compute node would be left unused for the entire ex-core calculation. Therefore, these methods enable the user to better use the resources available and reduce computation time.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2020

Reproducibility and Optimization Techniques for Evaluated Data in the Resolved Resonance Region [Slides]

This presentation discusses the experimental setup input parameters that are basic quantities for reproducibility. The goal is to increase quality of the evaluated data and decrease time needed for an evaluation. Full reproducibility should be achieved efficiently by including any type of constraints in the optimization procedure and to improve computational time to reach convergence. The goal of an automated reproducibility aligns to the goal of “certified” evaluated data, i.e., defined by a well-defined metric.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1972

Control system estimation and design for aerospace vehicles with time delay

The problems of estimation and control of discrete, linear, time-varying systems are considered. Previous solutions to these problems involved either approximate techniques, open-loop control solutions, or results which required excessive computation. The estimation problem is solved by two different methods, both of which yield the identical algorithm for determining the optimal filter. The partitioned results achieve a substantial reduction in computation time and storage requirements over the expanded solution, however. The results reduce to the Kalman filter when no delays are present in the system. The control problem is also solved by two different methods, both of which yield identical algorithms for determining the optimal control gains. The stochastic control is shown to be identical to the deterministic control, thus extending the separation principle to time delay systems. The results obtained reduce to the familiar optimal control solution when no time delays are present in the system.

Allgaier, G. R.↗
NASA NTRS1978

A modular minicomputer based Navier-Stokes solver

The basic module consists of a minicomputer, low cost peripheral storage device (disk) and a modest number (8-12) of microcomputer modules. A simple arrangement, where the microcomputers are connected to a single time multiplexed bus, only communicating to the host minicomputer, will be efficient. By running the machine in a dedicated mode for long periods of time, it will be possible to obtain a large number of solutions. As such, the device should be useful as a research tool. A scheme is outlined to assemble a number of these computing modules in parallel to decrease computing time. The advantages and disadvantages are discussed of using a number of these systems assembled in a loosely coupled configuration, each independently computing a separate flow, to give a very high throughput.

Steinhoff, J.↗
NASA NTRS1984

Numerical optimization design of advanced transonic wing configurations

A computationally efficient and versatile technique for use in the design of advanced transonic wing configurations has been developed. A reliable and fast transonic wing flow-field analysis program, TWING, has been coupled with a modified quasi-Newton method, unconstrained optimization algorithm, QNMDIF, to create a new design tool. Fully three-dimensional wing designs utilizing both specified wing pressure distributions and drag-to-lift ration minimization as design objectives are demonstrated. Because of the high computational efficiency of each of the components of the design code, in particular the vectorization of TWING and the high speed of the Cray X-MP vector computer, the computer time required for a typical wing design is reduced by approximately an order of magnitude over previous methods. In the results presented here, this computed wave drag has been used as the quantity to be optimized (minimized) with great success, yielding wing designs with nearly shock-free (zero wave drag) pressure distributions and very reasonable wing section shapes.

Cosentino, G. B.↗
NASA NTRS1985

Numerical optimization design of advanced transonic wing configurations

A computationally efficient and versatile technique for use in the design of advanced transonic wing configurations has been developed. A reliable and fast transonic wing flow-field analysis program, TWING, has been coupled with a modified quasi-Newton method, unconstrained optimization algorithm, QNMDIF, to create a new design tool. Fully three-dimensional wing designs utilizing both specified wing pressure disributions and drag-to-lift ratio minimization as design objectives are demonstrated. Because of the high computational efficiency of each of the components of the design code, in particular the vectorization of TWING and the high speed of the Cray X-MP vector computer, the computer time required for a typical wing design is reduced by approximately an order of magnitude over previous methods. In the results presented here, this computed wave drag has been used as the quantity to be optimized (minimized) with great success, yielding wing designs with nearly shock-free (zero wave drag) pressure distributions and very reasonable wing section shapes.

Cosentino, G. B.↗
NASA NTRS1989

Efficient detection of a CW signal with a linear frequency drift

An efficient method is presented for the detection of a continuous wave (CW) signal with a frequency drift that is linear in time. Signals of this type occur in transmissions between any two locations that are accelerating relative to one another, e.g., transmissions from the Voyager spacecraft. We assume that both the frequency and the drift are unknown. We also assume that the signal is weak compared to the Gaussian noise. The signal is partitioned into subsequences whose discrete Fourier transforms provide a sequence of instantaneous spectra at equal time intervals. These spectra are then accumulated with a shift that is proportional to time. When the shift is equal to the frequency drift, the signal to noise ratio increases and detection occurs. Here, we show how to compute these accumulations for many shifts in an efficient manner using a variety of Fast Fourier Transformations (FFT). Computing time is proportional to L log L where L is the length of the time series.

Swarztrauber, Paul N.↗
NASA NTRS1992

Working Notes from the 1992 AAAI Spring Symposium on Practical Approaches to Scheduling and Planning

The symposium presented issues involved in the development of scheduling systems that can deal with resource and time limitations. To qualify, a system must be implemented and tested to some degree on non-trivial problems (ideally, on real-world problems). However, a system need not be fully deployed to qualify. Systems that schedule actions in terms of metric time constraints typically represent and reason about an external numeric clock or calendar and can be contrasted with those systems that represent time purely symbolically. The following topics are discussed: integrating planning and scheduling; integrating symbolic goals and numerical utilities; managing uncertainty; incremental rescheduling; managing limited computation time; anytime scheduling and planning algorithms, systems; dependency analysis and schedule reuse; management of schedule and plan execution; and incorporation of discrete event techniques.

Drummond, Mark↗
DOE OSTI2020

Models and Strategies for Optimal Demand Side Management in the Chemical Industries

Deregulation and the increase of renewable electricity generation from wind and solar photovoltaics have transformed the U.S. electricity market. Economic and environmental benefits notwithstanding, the presence of renewables has increased variability and uncertainty on the supply side of the grid. Managing demand, rather than generation – a strategy referred to as “demand response (DR)” – is an attractive approach for mitigating this imbalance. DR efforts aim to reduce electricity usage during peak demand times, lessening stress on the grid. Industrial users are particularly attractive entities for DR participation since they present large, localized loads that can provide significant relief on grid demand and –unlike other large loads, such as buildings – are minimally dependent on human needs and preferences. In this project, we accomplished three main objectives. (1) We developed data-driven low-order DR scheduling-relevant dynamic models of chemical processes. Concurrently, we studied the formulation and solution of the associated optimal DR production scheduling problems. (a) A prototype air separation unit (ASU) model was used to generate simulated operating data for initial modeling efforts, which enabled the later use of industrial data for data-driven modeling. (b) We utilized Hammerstein-Wiener (HW) and Finite Step Response (FSR) models to represent nonlinear plant dynamics. (c) The HW models were linearized using exact linearization so they could potentially be embedded in power system models, which are formulated as mixed integer linear programs (MILPs). (d) We solved DR optimization problems under uncertainty and found that even naïve predictions of electricity price and product demand led to significant cost savings benefits. (2) Our DR scheduling optimization problem formulations are amenable to real-time solution. (a) We utilized Lagrangian Relaxation (LR) to efficiently solve the optimization problem by decoupling subproblems linked by complicating constraints. (b) We have achieved computation times for the 3-day DR scheduling problem of an ASU as low as 1.88 minutes. (3) Our representations of the DR behavior of chemical process as grid-level batteries were embedded in power system models. (a) For a small-scale grid, we found that incorporating the dynamics of the chemical plant in the optimal power flow calculations resulted in better resource management leading to up to 15% and 46% cost reduction for the grid and chemical plant operations, respectively, during periods of power line congestion. We have published several works dedicated to modeling and solving DR optimization problems from the user side. These were published in top peer-reviewed journals and are summarized in this report. The most recent work (and papers in preparation) considers DR scheduling from the grid side. Future efforts will consider networked plants (e.g., air separation units operating on a common pipeline) for DR participation, which is expected to amplify the capabilities of industrial DR participants to perform load-shifting. Our consideration of uncertainty in DR has inspired future directions in this area as well: we plan to develop multistage methods to fully account for the effects of uncertainty in DR scheduling.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Cooperative fault management for resilient integration of renewable energy

Cooperative fault management (CFM) is designed herein to control different types of renewable energy resources cooperatively during electrical faults. This paper studies systems with a high penetration of photovoltaic (PV) energy and wind energy. First, CFM leverages power converters of PV farms to boost the ride-through capability of nearby doubly-fed induction generators (DFIGs). By controlling PV farms’ output voltages to change smoothly during both fault initiation and fault clearance, the widely used crowbar in DFIGs is less likely to be activated. Crowbar activation adversely makes DFIGs lose controllability and absorb reactive power. The second contribution is the development of a software-defined CFM controller and a controller in-the-loop demonstration of the real-time performance of this optimization-based CFM. CFM capitalizes on distributed optimization formulation to enable flexibility, plug-and-play, and privacy-preserving. Computation time, however, is a major concern for optimization-based dynamics control. Here, real-time controller-in-the-loop simulation results show optimization-based CFM can output reference values around 60 ms and is quick enough for dynamic control.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
NASA NTRS1973

Choice: 36 band feature selection software with applications to multispectral pattern recognition

Feature selection software was developed at the Earth Resources Laboratory that is capable of inputting up to 36 channels and selecting channel subsets according to several criteria based on divergence. One of the criterion used is compatible with the table look-up classifier requirements. The software indicates which channel subset best separates (based on average divergence) each class from all other classes. The software employs an exhaustive search technique, and computer time is not prohibitive. A typical task to select the best 4 of 22 channels for 12 classes takes 9 minutes on a Univac 1108 computer.

Jones, W. C.↗
NASA NTRS1987

Validation of a real-time engineering simulation of the UH-60A helicopter

A real-time simulation of the UH-60A Black Hawk Helicopter based on the Sikorsky Gen Hel mathematical model is compared with flight test data and Sikorsky's nonreal-time computer program. An overview of the mathematical model is given, including a description of updates and expansion of the model by NASA. Also, real-time programming requirements and techniques are explained. The simulation displays very good agreement with flight test data and excellent with the nonreal-time program on which it is based. The large dedication of effort required to develop the real-time program suggests a need for development of generalized techniques for real-time simulation of high-fidelity physical models of rotorcraft.

Ballin, Mark G.↗