Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational costs”

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 1,117 records · Page 62
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Range-separated thermal hybrid exchange-correlation density functional for accurate band-gap calculations of warm dense matter

Here, in this study, we present a range-separated thermal hybrid exchange-correlation (XC) functional, termed RS-KDT0, which provides highly accurate band-gap predictions at elevated temperature while reducing the computational cost relative to thermal global hybrid functionals. At zero temperature, RS-KDT0 recovers the widely used ground-state range-separated hybrid functional HSE06. To assess its performance across temperature regimes, we conducted static calculations of electronic pressure, band gaps, and band structures. RS-KDT0 exhibits the same level of accuracy as HSE06 in the low-temperature regime and demonstrates improved agreement with finite-temperature GW calculations at elevated temperatures when compared to other thermal XC functionals such as the generalized gradient approximation (GGA)-level KDT16 and the global hybrid KDT0.

density functional theory↗
DOE OSTI2025

Aspects of propagator sparsening in lattice QCD

In lattice field theory, field sparsening aims to replace quantum fields, or objects constructed from them, with approximations that preserve the appropriate symmetries and maintain many aspects of the physics that the fields determine. For example, an effective sparsening of a quark propagator provides an efficient map from a quark propagator on a fine lattice geometry to a quark propagator defined on a coarser geometry in order to reduce storage and computational costs of subsequent calculational stages while maintaining long-distance correlations and corresponding low-energy physical information. Previous studies have focused on decimating lattice sites or randomly sampling lattice sites to reduce the size of the propagator and subsequent costs of Wick contractions. Here, we extend the study of sparsening to incorporate covariant averaging of spatial sites and examine the effects on two-point and three-point correlation functions involving various hadrons. We find that sparsening is most effective in reproducing the unsparsened versions of these correlation functions when weighted covariant-averaging is sequentially applied many times.

Lattice QCD↗
DOE OSTI2025

Connecting relativistic density functional theory to microscopic calculations

The development of systematic effective field theories (EFTs) for nuclear forces and advances in solving the nuclear many-body problem have greatly improved our understanding of dense nuclear matter and the structure of finite nuclei. For global nuclear calculations, density functional theories (DFTs) have been developed to reduce the complexity and computational cost required in describing nuclear systems. However, DFT often makes approximations and assumptions about terms included in the functional, which may introduce systematic uncertainties compared to microscopic calculations using EFTs. In this work, we investigate possible avenues of improving nuclear DFT using nonlinear relativistic mean-field (RMF) theory. We explore the impact of RMF model extensions by fitting the nonlinear RMF model to predictions of nuclear matter and selected closed-shell nuclei using four successful chiral EFT Hamiltonians. We find that these model extensions are impactful and important in capturing the physics present within chiral Hamiltonians, particularly for charge radii and neutron skins of closed-shell nuclei. However, there are additional effects that are not captured within the RMF model, particularly within the isoscalar sector of RMF theory. Additional model extensions and the reliability of the nonlinear RMF model are discussed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Adaptively coupled phase retrieval in multi-peak Bragg coherent diffraction imaging

Recent advances in Bragg coherent diffraction imaging (BCDI) experimental techniques permit routine measurement of multiple Bragg peaks from a single crystalline grain. The resulting images contain the full lattice distortion vector field which can be differentiated to provide lattice strain and rotation. With the advent of fourth-generation synchrotron light sources, such multi-peak datasets are produced at high rates, facilitating the need for rapid phase retrieval of the multiple peaks and subsequent image analysis. Here we describe and demonstrate a new implementation of a coupled phase retrieval technique for multi-peak BCDI which simultaneously treats each Bragg peak of the dataset and produces a three-dimensional image of the crystal's morphology and lattice distortion field. In addition, this method uses the redundant information contained in the various Bragg diffraction patterns to detect and suppress spurious signal appearing on the detector in a subset of the measurements. Compared with manual data editing, adaptive coupling produces a more consistent phase profile in reciprocal space and sharper surfaces in direct space, with no significant difference in computational cost. These improvements reduce the need for manual preprocessing and enable robust high-throughput analysis of multi-peak BCDI data, supporting near-real-time strain microscopy at modern synchrotron facilities.

36 MATERIALS SCIENCE↗
DOE OSTI2021

BraggNN : fast X-ray Bragg peak analysis using deep learning

X-ray diffraction based microscopy techniques such as high-energy diffraction microscopy (HEDM) rely on knowledge of the position of diffraction peaks with high precision. These positions are typically computed by fitting the observed intensities in detector data to a theoretical peak shape such as pseudo-Voigt. As experiments become more complex and detector technologies evolve, the computational cost of such peak-shape fitting becomes the biggest hurdle to the rapid analysis required for real-time feedback in experiments. To this end, we propose BraggNN, a deep-learning based method that can determine peak positions much more rapidly than conventional pseudo-Voigt peak fitting. When applied to a test dataset, peak center-of-mass positions obtained from BraggNN deviate less than 0.29 and 0.57 pixels for 75 and 95% of the peaks, respectively, from positions obtained using conventional pseudo-Voigt fitting (Euclidean distance). When applied to a real experimental dataset and using grain positions from near-field HEDM reconstruction as ground-truth, grain positions using BraggNN result in 15% smaller errors compared with those calculated using pseudo-Voigt. Recent advances in deep-learning method implementations and special-purpose model inference accelerators allow BraggNN to deliver enormous performance improvements relative to the conventional method, running, for example, more than 200 times faster on a consumer-class GPU card with out-of-the-box software.

36 MATERIALS SCIENCE↗
DOE OSTI2020

A Computational Efficient Space-Vector Modulation Scheme for A Hybrid Seven-Level Converter for Medium Voltage Grid-Tied Applications

In this paper, a fast space-vector modulation (SVM) scheme is proposed for a hybrid 7-level (7-L) converter, i.e., cascaded T-type converter and H-bridge converters, for grid-tied applications. Using oblique coordinate reference, the proposed SVM can quickly locate the switching triangle enclosing the reference vector in the 7-L space vector diagram. Then all available switching sequences and vector duty cycles are acquired by straightforward calculation without using any look-up tables, which significantly reduces the computational cost. The floating capacitor voltages are also stabilized by using the proposed SVM. Experimental studies on a scale-down prototype are presented in this work to validate the effectiveness of the proposed scheme.

Diao, Fei↗
DOE OSTI2024

Enhancing Photosynthesis Simulation Performance in ESMs with Machine Learning-Assisted Solvers

When simulating vegetation dynamics, photosynthesis accounts for a large fraction of the computational cost in most Earth System Models (ESMs). This is largely since photosynthesis is represented as a system of nonlinear equations, and the solution requires the use of an initial guess followed by many iterations of the numerical solver to obtain a solution. We use machine learning (ML) to replicate the response surface of the model’s numerical solver to improve the choice of initial guess, therefore requiring fewer iterations to obtain a final solution. We implemented this test on the leaf-level calculations as well as at the canopy scale, and for both we observed fewer iterations of the photosynthesis solver when a ML-based initial guess was implemented. The model tested here is the Energy Exascale Earth System Model - Land Model (ELM). The ML-based algorithms used here are trained on simulations from the model itself and used only to improve the initial guess for the solver; therefore, the model maintains its own set of physics to obtain the final solution. This work shows novel ways to utilize ML-based methods to improve the performance of numerical solvers in ESMs.

Massoud, Elias [ORNL] (ORCID:0000000217725361)↗
DOE OSTI2024

MassiveGNN: Efficient Training via Prefetching for Massively Connected Distributed Graphs

Graph Neural Networks (GNN) are indispensable in learning from graph-structured data, yet their rising computational costs, especially on massively connected graphs, pose significant challenges in terms of execution performance. To tackle this, distributed-memory solutions such as partitioning the graph to concurrently train multiple replicas of GNNs are in practice. However, approaches requiring a partitioned graph usually suffer from communication overhead and load imbalance, even under optimal partitioning and communication strategies due to irregularities in the neighborhood minibatch sampling. This paper proposes practical trade-offs for improving the sampling and communication overheads for representation learn- ing on distributed graphs (using popular GraphSAGE architecture) by developing a parameterized prefetch and eviction scheme on top of the state-of-the-art Amazon DistDGL distributed GNN framework, demonstrating about 15–40% improvement in end-to-end training performance on the NERSC Perlmutter supercomputer for various OGB datasets.

Machine Leanring, high performance comptuing, grap↗
DOE OSTI2020

Piecewise Linear Optimization for Public EV Charging Depots in Different Utility Environments

With the proliferation of electric vehicles (EVs), EV supply equipment technology is being pushed to increasingly higher power levels, such as extreme fast charging (XFC) at 300kW or more. As more public XFC depots are connected to electric distribution systems, utility operators will mitigate their impact with pricing schemes and programs such as demand response, demand charges, and time-varying prices. In this paper we describe an XFC management system that combines an on-site battery energy storage system and an optimization application that minimizes the cost to operate the depot in light of the utility pricing programs. We have designed the optimizer specially to use fast and simple linear programming so that it can be deployed to low-cost computing platforms. We also describe how several utility pricing schemes are integrated into a single piecewise model, reducing the engineering effort to implement the optimizer in different utility environments.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

Vehicle Tracking with Crop-based Detection

End-to-end production of vehicle tracking data from video in real-time and with high accuracy remains a challenging problem due to the computational cost of object detection on each frame. In this work we present Tracking with Crop-based Detection, a method for speeding object tracking in constrained contexts (with stable cameras and relatively-predictable object motion) such as vehicle traffic monitoring. We leverage this context to provide a strong prior for object locations, which we use to 1.) boost detection speed by detecting objects only in regions corresponding to object priors on most frames and 2.) inform the selection of the detector output for each object. We evaluate Crop-based Detection as an extension to the KIOU object tracker (Crop-KIOU) on the UA-DETRAC dataset. The proposed tracker outperforms all other reported algorithms in terms of PR-MOTA, PR-MOTP, and mostly tracked objects on the UA-DETRAC benchmark, establishing a new state-of-the-art. Relative to tracking by detection with KIOU, Crop-KIOU achieves a 26% higher frame-rate and increases accuracy. Furthermore, Tracking with Crop-based Detection can be combined with frame skipping; we show a 149% increase in framerate relative to KIOU with no decrease in accuracy using this combination of methods.

Gloudemans, Derek↗
DOE OSTI2026

Pixel-Resolved Long-Context Learning for Turbulence at Exascale: Resolving Small-scale Eddies Toward the Viscous Limit

Turbulence plays a crucial role in multiphysics applications, including aerodynamics, fusion, and combustion. Accurately capturing turbulence's multiscale characteristics is essential for reliable predictions of multiphysics interactions, but remains a grand challenge even for exascale supercomputers and advanced deep learning models. The extreme-resolution data required to represent turbulence, ranging from billions to trillions of grid points, pose prohibitive computational costs for models based on architectures like vision transformers. To address this challenge, we introduce a multiscale hierarchical Turbulence Transformer that reduces sequence length from billions to a few millions and a novel RingX sequence parallelism approach that enables scalable long-context learning. We perform scaling and science runs on the Frontier supercomputer. Our approach demonstrates excellent performance up to 1.1 EFLOPS on 32,768 AMD GPUs, with a scaling efficiency of 94\%. To our knowledge, this is the first AI model for turbulence that can capture small-scale eddies down to the dissipative range in three-dimensional turbulence at high Reynolds numbers.

Yin, Junqi [ORNL] (ORCID:0000000338435520)↗
DOE OSTI2020

Distributed Solution Approach for a Stackelberg Pricing Game of Aggregated Demand Response

Demand-side management is a fundamental up-to-date strategy that transforms the traditional power grid to a modern smart grid where the flexible pricing mechanisms play a critical role in its successful implementation. In this paper, the pricing-demand response between a distribution system operator (DSO) and load aggregators (LAs) is modeled as a Stackelberg game, where the DSO is the price maker that adjusts its strategy based on observed responses from LAs. With the concerns of computational cost and privacy protection, two distributed solution approaches, particle swarm optimization and pattern search algorithm, are conducted and compared with the classical centralized backward induction approach. Numerical results on a small case study demonstrate the effectiveness of the proposed distributed solution approaches in leveraging flexible demand response potential.

Chen, Yang↗
DOE OSTI2023

Load Shedding for Voltage Regulation With Probabilistic Agent Compliance

With the increased observability and controllability of distribution systems, the share of behind-the-meter systems is trending upwards rapidly. As a consequence, the impact of human behaviors on system performance can no longer be ignored and should be reflected in the energy management system models. In this paper, we discuss the problem of distribution system voltage control by active power curtailment where the agent compliance of the load curtailment signal is probabilistic. We discuss the modeling of the optimal voltage control problem with probabilistic agent compliance as a chance-constrained optimization problem, its tractable safe approximation using convex restriction, and a scenario-based mixed-integer reformulation as well as the associated solution method based on augmented Lagrangian method. The numerical simulation on IEEE test system validates the effectiveness of the proposed approach in obtaining high-quality feasible load curtailment signal with low computational cost, which makes it a viable tool for real time decision making.

augmented Lagrangian method↗
DOE OSTI2023

A Model Calibration Method for Grid-Forming Inverters Using Iterative Bayesian Optimization

As inverter-based resources (IBRs) are rapidly deployed, especially at the distribution and microgrid levels, the need to include their accurate representations in power systems models increases. With well-calibrated models, IBR-interactions can be examined, preventing any stability and operational issues, especially in islanded systems. This paper proposes a method to calibrate generic inverter models using Bayesian optimization, but with a parameter-grouping approach to improve speed and accuracy. This approach is illustrated for a grid-forming inverter using synthetic data and field measurements from a simple IBRbased microgrid. Tests show that the calibration algorithm has modest computation cost and is robust to noisy measurements..

Biswas, Shuchismita↗
DOE OSTI2020

RLScheduler: An Automated HPC Batch Job Scheduler Using Reinforcement Learning

Today’s high-performance computing (HPC) platforms are still dominated by batch jobs. Accordingly, effective batch job scheduling is crucial to obtain high system efficiency. Existing HPC batch job schedulers typically leverage heuristic priority functions to prioritize and schedule jobs. But, once configured and deployed by the experts, such priority functions can hardly adapt to the changes of job loads, optimization goals, or system settings, potentially leading to degraded system efficiency when changes occur. To address this fundamental issue, we present RLScheduler, an automated HPC batch job scheduler built on reinforcement learning. RLScheduler relies on minimal manual interventions or expert knowledge, but can learn high-quality scheduling policies via its own continuous ‘trial and error’. We introduce a new kernel-based neural network structure and trajectory filtering mechanism in RLScheduler to improve and stabilize the learning process. Through extensive evaluations, we confirm that RLScheduler can learn high-quality scheduling policies towards various workloads and various optimization goals with relatively low computation cost. Moreover, we show that the learned models perform stably even when applied to unseen workloads, making them practical for production use.

Zhang, Di↗
DOE OSTI2023

Minimizing Ground Risk in Cellular-Connected Drone Corridors With mmWave Links

Unmanned Aircraft Systems (UASs) have been receiving significant interest and support from academia, industry, and regulatory bodies over the past decade due to their various use cases. To safely integrate UAS operations into the national airspace, particularly overpopulated regions, the risk posed to ground users, buildings, and vehicles due to unmanned aerial vehicle (UAV) flight should be minimized. This risk can be represented by a numerical metric, which we refer to in this article as the “ground risk.” Many UAS applications also depend on the presence of a reliable wireless communication link between the UAV and a control station for the transmission of UAV position, surveillance video, UAV payload commands, and other mission-related data. Such wireless communication requirements also need to be considered in the design of UAS operations. In this article, we consider both these aspects and study the design of nonintersecting trajectories for UAS operations to minimize ground risk, subject to constraints on the wireless signal strength and geometry of the trajectory, specified in terms of: 1) an enclosing cylinder within which the trajectory must lie and 2) an integrated angular change along the UAV's trajectory. The performance of a computationally expensive optimal algorithm is compared with that of a computationally faster heuristic approach within the dense urban environment of Manhattan, NY, USA. Performance evaluation using ray-tracing simulations shows that the heuristic approach performs close to the optimal algorithm at a reduced computation cost. In conclusion, this research can be utilized to make UAS operations safe and reliable and accelerate their adoption.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2022

Layered Coordination Architecture for Resilient Restoration of Power Distribution Systems

The current practices for restoring critical services in the distribution system during a disaster, align with the traditional centralized ideology of distribution systems operations. A central processor evaluates the distribution system after a disruption and attains a restoration plan. However, the centralized operational paradigm is susceptible to single-point failures, requires full situational awareness of the distribution system, and poses scalability challenges for large multifeeder distribution systems. This motivates a distributed decision-making paradigm where multiple agents solve smaller subproblems and jointly coordinate their individual decisions to achieve the global/network-level objective. Toward this goal, we propose a layered architecture for distributed algorithms for resilience and a two-stage distributed algorithm for distribution system restoration. The proposed distributed decision-making framework enables the bottom-up restoration of the distribution system using all available resources, including distributed generation, while only requiring local awareness and limited communications with neighboring connected regions. The proposed framework is robust to single-point failures, enables autonomy using distributed algorithms, and had reduced computational cost compared to centralized optimization solutions.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Deep Cellular Recurrent Network for Efficient Analysis of Time-Series Data With Spatial Information

Efficient processing of large-scale time series data is an intricate problem in machine learning. Conventional sensor signal processing pipelines with hand engineered feature extraction often involve huge computational cost with high dimensional data. Deep recurrent neural networks have shown promise in automated feature learning for improved time-series processing. However, generic deep recurrent models grow in scale and depth with increased complexity of the data. This is particularly challenging in presence of high dimensional data with temporal and spatial characteristics. Consequently, this work proposes a novel deep cellular recurrent neural network (DCRNN) architecture to efficiently process complex multi-dimensional time series data with spatial information. Here, the cellular recurrent architecture in the proposed model allows for location-aware synchronous processing of time series data from spatially distributed sensor signal sources. Extensive trainable parameter sharing due to cellularity in the proposed architecture ensures efficiency in the use of recurrent processing units with high-dimensional inputs. This study also investigates the versatility of the proposed DCRNN model for classification of multi-class time series data from different application domains. Consequently, the proposed DCRNN architecture is evaluated using two time-series datasets: a multichannel scalp EEG dataset for seizure detection, and a machine fault detection dataset obtained in-house. The results suggest that the proposed architecture achieves state-of-the-art performance while utilizing substantially less trainable parameters when compared to comparable methods in the literature.

60 APPLIED LIFE SCIENCES↗