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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Verification of an improved equation-free projective integration method for neoclassical plasma-profile evolution in tokamak geometry

A brute-force, long-time gyrokinetic simulation of plasma profile evolution in magnetic fusion devices is not desirable due to large computational resource requirements and a possible accumulation of numerical error. The equation-free projective integration method of Keverekidis et al. [Commun. Math. Sci. 1(4), 715–762 (2003)] is one of the outstanding candidates in projecting micro-scale simulations to a longer timescale. However, its application to tokamak plasma has not been fruitful due to the appearance of spurious transient oscillations in the lifting process, which are present when the kinetic simulations are initialized with a simplified model distribution function and which make the kinetic simulations to deviate from the desired paths. In this work, a kinetically informed lifting algorithm is added to the equation-free projective integration method, which is then verified in the electrostatic gyrokinetic particle-in-cell code XGCa [R. Hager and C. S. Chang, Phys. Plasmas 23, 042503 (2016)] for a neoclassical ion heat transport problem with adiabatic electrons. This new lifting operator is demonstrated to control spurious transients, enabling an over four-times reduction in the overall computing time in the time-evolution of the ion temperature profile in an axisymmetric toroidal plasma. Further reduction in the computing time is found to be limited due to the stability properties of the linear least squares projective integrator.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Efficient Asynchronous I/O with Request Merging

With the advancement of exascale computing, the amount of scientific data is increasing day by day. Efficient data access is necessary for scientific discoveries. Unfortunately, the I/O performance is not improved, like the CPU and network speed. So, I/O operations take longer time than data generation or analysis. Asynchronous I/O has been proposed to extenuate the I/O bottleneck by overlapping I/O and computation time. However, multiple small write operations can diminish the benefits of asynchronous I/O, as the I/O time becomes significantly longer than the compute time, with little time to overlap with. To overcome these issues, we present an optimization technique to merge small contiguous write operations. We integrated our solution into the HDF5 asynchronous I/O VOL connector and demonstrated the effectiveness of merging HDF5 write operations automatically and transparently without requiring any code change from the application.

Chowdhury, Kamal Hossain↗
DOE OSTI2025

Field–potential finite-difference time-domain (FiPo FDTD) technique for computational electromagnetics

Modeling light–matter interactions at the nanoscale requires accurate handling of coupled quantum and electromagnetic systems. This coupling requires information about the electric scalar potential Φ and the magnetic vector potential A, which are not typically calculated in standard computational electromagnetics implementations. To that end, we have developed a field–potential finite-difference time-domain (FiPo FDTD) algorithm, which solves a set of first-order equations for Φ and A alongside equations for the electric and magnetic fields E and H. The FiPo Basic code is essentially conventional FDTD, but with an added module that calculates the potentials. The FiPo Hybrid code self-consistently calculates both fields and potentials and is particularly suitable for coupling with quantum electronic transport solvers because it can be sourced by the potentials themselves. To terminate the domain and mimic infinite space, we have derived and implemented a convolutional perfectly matched layer (CPML) absorbing boundary condition for FiPo FDTD whose performance is on par with state-of-the-art CPMLs for standard FDTD. We present FiPo simulation results on several example systems.

Avazpour, L. [University of Wisconsin-Madison, WI ↗
DOE OSTI2021

Evolving CO 2 rather than SST leads to a factor of ten decrease in GCM convergence time

The high computational cost of Global Climate Models (GCMs) is a problem that limits their use in many areas. Recently an inverse climate modeling (InvCM) method, which fixes the global mean sea surface temperature (SST) and evolves the CO 2 mixing ratio to equilibrate climate, has been implemented in a cloud resolving model. In this paper, we apply InvCM to ExoCAM GCM aquaplanet simulations, allowing the SST pattern to evolve while maintaining a fixed global-mean SST. We find that InvCM produces the same climate as normal slab-ocean simulations but converges an order of magnitude faster. We then use InvCM to calculate the equilibrium CO 2 for SSTs ranging from 290 K to 340 K at 1 K intervals and reproduce the large increase in climate sensitivity at an SST of about 315 K at much higher temperature resolution. The speedup provided by InvCM could be used to equilibrate GCMs at higher spatial resolution or to perform broader parameter space exploration in order to gain new insight into the climate system. Additionally, InvCM could be used to find unstable and hidden climate states, and to find climate states close to bifurcations such as the runaway greenhouse transition.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

High Performance Computing Traffic Simulations for Real-Time Traffic Control of Mobility in Chattanooga Region

In 2019, highway congestion wasted over 3 billion gallons of fuel and caused 8.8 billion hours of lost productivity.1 Research has shown that introducing near-real time traffic controls can significantly reduce congestion. Validated and calibrated traffic simulations enable the modeling of transportation systems and the evaluation of different traffic control actions and schemes given a variety of circumstances that represent likely future scenarios. The developed scenarios can inform the deployment of controls in near real-time to improve freight and passenger vehicle congestion and energy use. In this work, we present simulations used to model the traffic in the Chattanooga, Tennessee, metropolitan area. Simulations were constructed and calibrated using a variety of local, data science enhanced, data sources utilizing open source software including the Simulation of Urban Mobility (SUMO) simulator. High-Performance Computing (HPC) provides a scalable platform with enough computing for the high-fidelity simulation of many scenarios and the application of advance data science especially for large-scale systems. Our simulations include microscopic simulations at a corridor level for traffic signal control, and mesoscopic simulations to evaluate regional operational controls and infrastructure.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

iBLAST: Incremental BLAST of new sequences via automated e-value correction

Search results from local alignment search tools use statistical scores that are sensitive to the size of the database to report the quality of the result. For example, NCBI BLAST reports the best matches using similarity scores and expect values (i.e., e-values) calculated against the database size. Given the astronomical growth in genomics data throughout a genomic research investigation, sequence databases grow as new sequences are continuously being added to these databases. As a consequence, the results (e.g., best hits) and associated statistics (e.g., e-values) for a specific set of queries may change over the course of a genomic investigation. Thus, to update the results of a previously conducted BLAST search to find the best matches on an updated database, scientists must currently rerun the BLAST search against the entire updated database, which translates into irrecoverable and, in turn, wasted execution time, money, and computational resources. To address this issue, we devise a novel and efficient method to redeem past BLAST searches by introducing iBLAST. iBLAST leverages previous BLAST search results to conduct the same query search but only on the incremental (i.e., newly added) part of the database, recomputes the associated critical statistics such as e-values, and combines these results to produce updated search results. Our experimental results and fidelity analyses show that iBLAST delivers search results that are identical to NCBI BLAST at a substantially reduced computational cost, i.e., iBLAST performs (1 + δ )/ δ times faster than NCBI BLAST, where δ represents the fraction of database growth. We then present three different use cases to demonstrate that iBLAST can enable efficient biological discovery at a much faster speed with a substantially reduced computational cost.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

An Efficient Time-Domain Model to Simulate Parametric Resonances in a Floating Body Free to Move in Six Degrees of Freedom: Preprint

We present a computationally efficient time-domain model capable of simulating parametric resonances in a floating body in waves. The model assumes all wave forces to be linear, but the inertia and restoring forces acting on the body are expanded to second order in body motions. The simulation speed on a standard computer is approximately 40 times faster than real time. The model is applied to a soft-moored floating axisymmetric body which absorbs energy through heave, but is otherwise free to move in six degrees of freedom. Under certain conditions, we show that the body responds parametrically with large amplitudes not only in surge and pitch, but also in sway, roll, and yaw, provided it is given some small initial displacement in one of these out-of-plane modes. The predictions are confirmed by simulations using state-of-the-art nonlinear Froude-Krylov and computational fluid dynamics models.

parametric resonance↗
DOE OSTI2024

A Comprehensive Analysis of PINNs for Power System Transient Stability

The integration of machine learning in power systems, particularly in stability and dynamics, addresses the challenges brought by the integration of renewable energies and distributed energy resources (DERs). Traditional methods for power system transient stability, involving solving differential equations with computational techniques, face limitations due to their time-consuming and computationally demanding nature. This paper introduces physics-informed Neural Networks (PINNs) as a promising solution for these challenges, especially in scenarios with limited data availability and the need for high computational speed. PINNs offer a novel approach for complex power systems by incorporating additional equations and adapting to various system scales, from a single bus to multi-bus networks. Our study presents the first comprehensive evaluation of physics-informed Neural Networks (PINNs) in the context of power system transient stability, addressing various grid complexities. Additionally, we introduce a novel approach for adjusting loss weights to improve the adaptability of PINNs to diverse systems. Our experimental findings reveal that PINNs can be efficiently scaled while maintaining high accuracy. Furthermore, these results suggest that PINNs significantly outperform the traditional ode45 method in terms of efficiency, especially as the system size increases, showcasing a progressive speed advantage over ode45.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A Comprehensive Analysis of PINNs for Power System Transient Stability

The integration of machine learning in power systems, particularly in stability and dynamics, addresses the challenges brought by the integration of renewable energies and distributed energy resources (DERs). Traditional methods for power system transient stability, involving solving differential equations with computational techniques, face limitations due to their time-consuming and computationally demanding nature. This paper introduces physics-informed Neural Networks (PINNs) as a promising solution for these challenges, especially in scenarios with limited data availability and the need for high computational speed. PINNs offer a novel approach for complex power systems by incorporating additional equations and adapting to various system scales, from a single bus to multi-bus networks. Our study presents the first comprehensive evaluation of physics-informed Neural Networks (PINNs) in the context of power system transient stability, addressing various grid complexities. Additionally, we introduce a novel approach for adjusting loss weights to improve the adaptability of PINNs to diverse systems. Our experimental findings reveal that PINNs can be efficiently scaled while maintaining high accuracy. Furthermore, these results suggest that PINNs significantly outperform the traditional ode45 method in terms of efficiency, especially as the system size increases, showcasing a progressive speed advantage over ode45.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Discrete Green’s functions and spectral graph theory for computationally efficient thermal modeling

Here, this work concerns solutions of the heat equation with the spectral graph method, for which the temperature is defined at discrete points in the domain and the spatial relationship among the points is described by a graph. The heat equation on the graph is solved using matrix techniques involving the eigenvectors and eigenvalues of the Laplacian matrix. The spectral graph approach precludes the computationally intensive meshing and numerous time-integration steps of the finite element method. In the present work, the spectral graph method is extended to include heat loss at the boundaries with a generalized boundary condition, and physics-based edge weights are introduced which simplify the calibration process. From this approach a discrete Green’s function is defined which allows for solutions under a variety of heating conditions including: space-varying initial conditions; time-and-space varying internal heating; and, time-and-space-varying heating at boundaries of type 1 (Dirichlet), type 2 (Neumann) and type 3 (Robin). Results are provided for benchmark heat transfer problems in one spatial dimension and in three spatial dimensions, and verification is provided by comparison with exact analytical solutions and finite difference solutions. The spectral graph method converges within 0.4% error of the analytical solution. The practical utility of the approach is demonstrated by thermal simulation of a multilayer additive manufacturing process. The spectral graph results are compared to experimentally-obtained temperature data for two metal parts, with error less than 5% of the experimental measurements, with computation time less than one minute on a desktop computer.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Simulating Diverse HEP Workflows on Heterogeneous Architectures

We evaluate key patterns and estimate throughput bounds of simulated transformation of conventional high energy physics (HEP) data processing workflows to heterogeneous equivalents. The simulation parameter space includes the number of offloaded tasks, CPU/accelerator ratios of intra-task computations, offload latencies, and run time efficiency of offloaded computations. The simulation is performed for a diverse set of state-of-the-art event reconstruction scenarios from ATLAS, LHCb and CMS - the frontier HEP experiments of the Large Hadron Collider project.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Influence of Diffuse and Ground-Reflected Irradiance on the Spectral Modeling of Solar Reference Cells

Thermal Energy Storage (TES) is a key component for solar thermal applications to bridge the gap between the demand for thermal energy and the supply of solar energy, whose availability depends on the time of day and season. Thus, cost-effective packed-bed thermal containers filled with a solid storage medium have been proposed for high-temperature sensible heat storage as materials are abundant and relatively cheap. Thus, it is necessary to investigate their performance and temperature profiles during the charge-discharge cycle. Several models are available for this purpose. Typically, the more detailed a model, the greater the computational effort required to solve it, and hence a time-efficient model is needed to prevent excessively long computation times for long-term analysis. At the more basic level, the common Hughes E-NTU model and the less realistic simplified Infinite-NTU model are very important for their less time and computational effort. In this paper, the appropriateness of employing the Infinite-NTU model was evaluated to investigate the performance of a typical and scalable rock-bed TES as a case study. The results presented provide a methodology to quickly test the validity of the model and predict the temperature profile for the case under study. Accordingly, such simple charge-discharge cycle thermal performance predictions are important to plan, design, and rapidly deploy a reliable and economical solar thermal system for the supply of valuable heat to high-temperature demanding applications of power generation and industrial processes as part of a rapid shift towards non-polluting renewable energy. Keywords: Solar Thermal, TES, Packed-bed, NTU model, Temperature profile

PV modeling↗
DOE OSTI2022

Development and assessment of a reactor system prognosis model with physics-guided machine learning

Autonomous control systems provide recommendations to help operators in decision-making during plant operations ranging from normal operation to accident management. An important step of autonomous control is prognosis. In nuclear engineering domain, prognosis is the process of predicting future conditions of a system or equipment based on present signs and symptoms of a fault. The prognosis model allows predicting future reactor states for possible candidate control strategies so that the outcomes can be evaluated to determine the best control strategy. The prognosis model requires representing direct relationships between the symptoms and the predictions. In nuclear engineering, computational simulations are approximate representations of the operation of the real system. However, prognosis with computational simulations requires high computation power and time due to possible large number of scenarios. Necessary computation resources can be reduced with machine learning (ML) approach for fast predictions by building a surrogate function using the simulation data. A critical issue is, ML models are ignorant of physical knowledge, and these models approximate statistical relationships between the system variables. This ignorance can produce results that are inconsistent with physical laws, even if an optimal result is achieved from a mathematical point of view. Physics-guided machine learning (PGML) is an approach to tackle this issue. Here, this work formulates and illustrates a framework to guide development and assessment of the ML-based prognosis model for autonomous control systems. The development of the prognosis model considers the training of a ML model which consists of optimizing many aspects of the ML approach. The assessment of the prognosis model considers training data limitations and uncertainties of the ML approach. Prognosis models with standalone ML and PGML are developed and assessed on the loss-of-flow scenario of Experimental Breeder Reactor II. The results indicate that PGML based prognosis model has the best performance compared to other prognosis models.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2020

Domain-specific compilers for dynamic simulations of quantum materials on quantum computers

Abstract Simulation of the dynamics of quantum materials is emerging as a promising scientific application for noisy intermediate-scale quantum (NISQ) computers. Due to their high gate-error rates and short decoherence times, however, NISQ computers can only produce high-fidelity results for those quantum circuits smaller than some given circuit size. Dynamic simulations, therefore, pose a challenge as current algorithms produce circuits that grow in size with each subsequent time-step of the simulation. This underscores the crucial role of quantum circuit compilers to produce executable quantum circuits of minimal size, thereby maximizing the range of physical phenomena that can be studied within the NISQ fidelity budget. Here, we present two domain-specific (DS) quantum circuit compilers for the Rigetti and IBM quantum computers, specifically designed to compile circuits simulating dynamics under a special class of time-dependent Hamiltonians. The compilers outperform state-of-the-art general-purpose compilers in terms of circuit size reduction by around 25%–30% as well as wall-clock compilation time by around 40% (dependent on system size and simulation time-step). Drawing on heuristic techniques commonly used in artificial intelligence, both compilers scale well with simulation time-step and system size. Code for both compilers is open-source and packaged into a full-stack quantum simulation software with tutorials included for ease of use for future researchers wishing to perform dynamic simulations of quantum materials on quantum computers. As our DS compilers provide significant improvements in both compilation time and simulation fidelity, they provide a building block for accelerating progress toward physical quantum supremacy.

Physics↗
DOE OSTI2021

A compute-bound formulation of Galerkin model reduction for linear time-invariant dynamical systems

This work aims to advance computational methods for projection-based reduced-order models (ROMs) of linear time-invariant (LTI) dynamical systems. For such systems, current practice relies on ROM formulations expressing the state as a rank-1 tensor (i.e., a vector), leading to computational kernels that are memory bandwidth bound and, therefore, ill-suited for scalable performance on modern architectures. This weakness can be particularly limiting when tackling many-query studies, where one needs to run a large number of simulations. This work introduces a reformulation, called rank-2 Galerkin, of the Galerkin ROM for LTI dynamical systems which converts the nature of the ROM problem from memory bandwidth to compute bound. We present the details of the formulation and its implementation, and demonstrate its utility through numerical experiments using, as a test case, the simulation of elastic seismic shear waves in an axisymmetric domain. We quantify and analyze performance and scaling results for varying numbers of threads and problem sizes. In conclusion, we present an end-to-end demonstration of using the rank-2 Galerkin ROM for a Monte Carlo sampling study. We show that the rank-2 Galerkin ROM is one order of magnitude more efficient than the rank-1 Galerkin ROM (the current practice) and about 970 times more efficient than the full-order model, while maintaining accuracy in both the mean and statistics of the field.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Comparison of plug flow and multi-node stratified tank modeling approaches regarding computational efficiency and accuracy

Residential water heaters contain water stratified by temperature-driven density differences. This implies that a water tank can reach a state in which the top and bottom sections have different temperatures, unless mixing happens. A high degree of thermal stratification can improve the efficiency of some water heaters, by saving the amount of energy required for the heat-up process. Studies of stratification became popular in the 1970s and it remains an active research topic today. The research has led to the development of different models and techniques to better predict and define a stratified tanks behavior. By comparing these models and techniques used previously to describe thermal stratification, the phenomenon could be better understood, exploited, and used to increase efficiency and thermal energy capacity in modern water tanks. From the existing models, we found the one-dimensional standard plug-flow and a multi node model to be appropriate for analyzing the processes of the heat up and cool-down in a water tank. These two models are based on energy balances. This work involved comparing the accuracy and computational effort needed to implement these models. To assess accuracy, we compared both types of existing models to experimental data (also collected in this work) which included a heat up process using an external heat pump. This external process included a layering process that has an eddy diffusivity at five times the rate of thermal diffusion. For this project, we implemented the models in MATLAB, the multi-paradigm numerical computing environment. We quantified model accuracy using the root mean squared error between modeled data and experimental data for six measured tank temperatures. Comparing the accuracy and the computational time taken to run the simulation provides a method to contrast the performance of each model and a way to rate it. The multi node model was run using from 6 to 96 spatial nodes; the plug flow model was run using 1 to 0.001 º C temperature bin sizes. Additionally, timesteps were varied from 4 to 236 s. The results quantify the tradeoff between accuracy and computational time, providing guidance for simulations to intelligently select the best model type and simulation parameters. This research can be used to validate the pre-existing models and possibly improve the modern water tank.

Bulnes, Fernando Karg↗
DOE OSTI2025

Improving Trustworthiness of Data-Driven Power Grid Contingency Analysis With Bayesian Residual Graph Neural Networks

The evolving energy landscape requires novel tools to efficiently perform contingency analysis and reliability assessment of power grids, potentially in real-time. The high computational cost of traditional power flow solvers limits their applicability in practice. Machine learning (ML) surrogates such as deep neural networks (NNs) accelerate power flow solvers computations, enabling high-order contingency analysis and real-time decision-making by learning highly nonlinear functions and integrating grid topology via graph architectures. However, (graph) NNs lack predictive power away from training data and do not provide predictive confidence estimates. Here, we present a Bayesian residual graph NN that integrates knowledge from low-fidelity data via residual training and embeds granular quantification of uncertainties, improving trustworthiness critical for high-consequence decision-making. Applying Bayesian concepts to NNs is challenging due to the high-dimensionality of both the parameter space, complicating derivation of a meaningful prior, and the output space in large grid systems, requiring enhanced techniques to assess the predicted high-dimensional uncertainties. Our contributions include: (1) Deriving a prior for fully connected and graph NNs that leverages low-fidelity data to guide mean predictions and appropriately control prior predictive uncertainty. (2) Integrating this prior within an ensembling with anchoring scheme for efficient approximate posterior inference. (3) Deriving enhanced metrics to assess accuracy of both the mean and uncertainty predictions in high dimensions, appropriately accounting for correlations propagated through graph layers. The resulting Bayesian residual graph NN is tested on a contingency analysis task for 14-bus and 118-bus grids.

24 - POWER TRANSMISSION AND DISTRIBUTION↗