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 1,009 records · Page 56
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Data-Driven Performance Optimization of Gamma Spectrometers With Many Channels

In gamma spectrometers with variable spectroscopic performance across many channels (e.g., many pixels or voxels), a tradeoff exists between including data from successively worse-performing readout channels and increasing efficiency. Brute-force calculation of the optimal set of included channels is exponentially infeasible as the number of channels grows, and approximate methods are required. In this work, we present a data-driven framework for attempting to find near-optimal sets of included detector channels. The framework leverages non-negative matrix factorization (NMF) to learn the behavior of gamma spectra across the detector and clusters similarly-performing detector channels together. Performance comparisons are then made between spectra with channel clusters removed, which is more feasible than brute force. The framework is general and can be applied to arbitrary, user-defined performance metrics depending on the application. We apply this framework to optimizing gamma spectra measured by H3D M400 CdZnTe (CZT) spectrometers, which exhibit variable performance across their crystal volumes. In particular, we show several examples optimizing various performance metrics for uranium and plutonium gamma spectra in non-destructive assay (NDA) for nuclear safeguards, and explore trends in performance versus parameters such as clustering algorithm type. We also compare the NMF + clustering pipeline to several non-machine-learning (ML) algorithms, including several greedy algorithms. Although, we find that the NMF + clustering pipeline tends to find the best-performing set of detector voxels, significantly improving over the unoptimized spectra, but that a greedy accumulation of spectra segmented by detector depth can, in some cases, give similar performance improvements in much less computation time.

Energy resolution↗
DOE OSTI2021

Network-Level Optimization for Unbalanced Power Distribution System: Approximation and Relaxation

The nonlinear programming (NLP) problem to solve distribution-level optimal power flow (D-OPF) poses convergence issues and does not scale well for unbalanced distribution systems. The existing scalable D-OPF algorithms either use approximations that are not valid for an unbalanced power distribution system, or apply relaxation techniques to the nonlinear power flow equations that do not guarantee a feasible power flow solution. In this paper, we propose scalable D-OPF algorithms that simultaneously achieve optimal and feasible solutions by solving multiple iterations of approximate, or relaxed, D-OPF subproblems of low complexity. The first algorithm is based on a successive linear approximation of the nonlinear power flow equations around the current operating point, where the D-OPF solution is obtained by solving multiple iterations of a linear programming (LP) problem. The second algorithm is based on the relaxation of the nonlinear power flow equations as conic constraints together with directional constraints, which achieves optimal and feasible solutions over multiple iterations of a second-order cone programming (SOCP) problem. Finally, it is demonstrated that the proposed algorithms are able to reach an optimal and feasible solution while significantly reducing the computation time as compared to an equivalent NLPD-OPF model for the same distribution system.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Make the Fastest Faster: Importance Mask Synthesis for Interactive Volume Visualization using Reconstruction Neural Networks

Visualizing a large-scale volumetric dataset with high resolution is challenging due to the substantial computational time and space complexity. Recent deep learning-based image inpainting methods significantly improve rendering latency by reconstructing a high-resolution image for visualization in constant time on GPU from a partially rendered image where only a portion of pixels go through the expensive rendering pipeline. However, existing solutions need to render every pixel of either a predefined regular sampling pattern or an irregular sample pattern predicted from a low-resolution image rendering. Both methods require a significant amount of expensive pixel-level rendering. In this work, we provide Importance Mask Learning (IML) and Synthesis (IMS) networks, which are the first attempts to directly synthesize important regions of the regular sampling pattern from the user’s view parameters, to further minimize the number of pixels to render by jointly considering the dataset, user behavior, and the downstream reconstruction neural network. Our solution is a unified framework to handle various types of inpainting methods through the proposed differentiable compaction/decompaction layers. Experiments show our method can further improve the overall rendering latency of state-of-the-art volume visualization methods using reconstruction neural network for free when rendering scientific volumetric datasets. Our method can also directly optimize the off-the-shelf pre-trained reconstruction neural networks without elongated retraining.

Large-scale data↗
DOE OSTI2022

Deep learning multiphysics network for imaging CO 2 saturation and estimating uncertainty in geological carbon storage

Multiphysics inversion exploits different types of geophysical data that often complement each other and aims to improve overall imaging resolution and reduce uncertainties in geophysical interpretation. Despite the advantages, traditional multiphysics inversion is challenging because it requires a large amount of computational time and intensive human interactions for preprocessing data and finding trade-off parameters. These issues make it nearly impossible for traditional multiphysics inversion to be applied as a real-time monitoring tool for geological carbon storage. In this paper, we present a deep learning (DL) multiphysics network for imaging CO 2 saturation in real time. The multiphysics network consists of three encoders for analysing seismic, electromagnetic and gravity data and shares one decoder for combining imaging capabilities of the different geophysical data for better predicting CO 2 saturation. The network is trained on pairs of CO 2 label models and multiphysics data so that it can directly image CO 2 saturation. Here we use the bootstrap aggregating method to enhance the imaging accuracy and estimate uncertainties associated with CO 2 saturation images. Using realistic CO 2 label models and multiphysics data derived from the Kimberlina CO 2 storage model, we evaluate the performance of the deep learning multiphysics network and compare its imaging results to those from the deep learning single-physics networks. Our modelling experiments show that the deep learning multiphysics network for seismic, electromagnetic, and gravity data not only improves the imaging accuracy but also reduces uncertainties associated with CO 2 saturation images. Our results also suggest that the deep learning multiphysics network for the non-seismic data (i.e., electromagnetic and gravity) can be used as an effective low-cost monitoring tool in between regular seismic monitoring.

58 GEOSCIENCES↗
DOE OSTI2022

Effect of the J-Shaped Wind Turbine Airfoil Opening Ratio and Thickness on the Performance of Symmetrical Airfoils

Abstract In this work, the effect of the inner opening ratio on the J-shaped airfoils aerodynamic performance was studied and documented for symmetrical airfoils. Three different airfoil thicknesses were investigated: small (NACA0008), medium (NACA0015), and large (NACA0024). For each airfoil thickness, effects of three inner opening ratios were analyzed: one-third, one-half, and two-thirds. The performance of each opening ratio was compared with the performance of the solid airfoil “zero opening ratio” for different angles of attack between 5 deg and 20 deg. All designs were simulated using the computational fluid dynamics (CFD) technology against experimental results for solid NACA4412 airfoil in the University of Wisconsin-Milwaukee (UWM) wind tunnel facility and other published experimental data. It was found that large eddy simulation yields accurate solutions with a smaller number of mesh cells compared to the k–ω turbulence model but with much longer computational time. The lift-to-drag ratio for all studied airfoils has a maximum value for solid airfoils compared to those equipped with openings. For airfoils equipped with 00.00% opening ratio “solid,” NACA0015 airfoil has the maximum lift-to-drag ratio. Furthermore, it was found that NACA0008 equipped with a 33.33% opening ratio has the best performance of all studied J-shaped airfoils.

Energy & Fuels↗
DOE OSTI2021

An Investigation of the Effects of Volume Fraction on Drag Coefficient of Non-Spherical Particles Using PR-DNS

Prediction of the drag coefficient is required in gas-particle multiphase flow modeling and simulation. Experimental data and correlations on the fixed-bed system of spherical particles with high volume fractions for various possible arrangements are available in the literature. However, the effect of volume fraction on the drag coefficient of non-spherical particles is not well studied. In solving the momentum equation, the volume fraction plays a vital role in determining the flow resistances. In this paper, we study the impact of volume fraction in the range of 0.069 to 0.65 on the drag coefficient using the computational fluid dynamics (CFD) simulation of air for Reynold number in the range of 10 to 10000 using particle resolved direct numerical solution (PR-DNS). Regular non-spherical particles such as a cube, tetrahedron, and spheroids are used in this study since their single particle’s drag coefficient data are available in the literature for comparison. For this work, the simulations are carried out in the Ansys Fluent using polyhedral mesh, which consumes significantly less computational time and power. The study showed the sphericity and volume fraction have significant impact on the bed pressure drop and average drag coefficient of the particles in the bed especially in high Reynolds number regime. The bed of the spheroid experiences the lowest drag being the most streamlined particle, and the particles with the edges result in a large drag coefficient due to flow separation at the discontinuity. The vector plots verify this behavior where large wake regions are observed behind the tetrahedron particle.

Mahyawansi, Pratik↗
DOE OSTI2024

Efficient Modeling of Floating Wind Arrays Including Current Loads and Seabed Bathymetry

Capabilities for modeling the effects of seabed bathymetry and current drag loads on a floating wind farm are now available in an open-source model for quasi-static analysis. In this model, mooring lines and dynamic cables are represented by a quasi-static solver that can quickly represent complex mooring/cabling arrangements and arrays of floating bodies. To account for seabed bathymetry, we expand the model to include a surface mesh that captures changes in water depth over a rectangular grid. We formulate modifications to the catenary equations that capture a mooring line's profile and tensions when contacting a slope seabed. To account for current drag loads on mooring lines and dynamic cables, we formulate a novel technique that rotates the reference frame so that the vector sum of the the weight and the current force are used in the catenary equations, while accounting for the seabed orientation. To complete the system, current drag loads on floating substructures are handled by inclusion of strip-theory drag calculations. These new capabilities are verified by comparing with results from the established offshore dynamics models MoorDyn and OrcaFlex in equivalent steady-state scenarios. The results show very good agreement for both sloped seabeds and current loads. With computation times of the quasi-static model typically under one second, the model additions are a useful capability toward rapidly evaluating a floating wind array's response to environmental loads under realistic site conditions.

bathymetry↗
DOE OSTI2023

HBMax: Optimizing Memory Efficiency for Parallel Influence Maximization on Multicore Architectures

The goal of influence maximization is to select k most-influential vertices or seeds in a network, where influence is defined by a given diffusion process. The problem has a number of important applications such as viral marketing, information spread, and epidemic control. Although computing optimal seed set is NP-Hard, due to the submodular nature of the problem efficient approximation algorithms exist. However, even state-of-the-art parallel implementations are limited by a sampling step that incurs large memory footprints. This in turn limits the problem size reach and approximation quality. In this work, we study the memory footprint of the sampling process collecting reverse reachability information in the IMM algorithm over large real-world social networks. We present an adaptive and memory-efficient optimization approach for a state-of-the-art multi-threaded parallel influence maximization algorithm. Our approach,HuffMax, uses a portion of the reverse reachable (RR) sets collected by the algorithm to learn the characteristics of the graph. Then, it compresses the intermediate reverse reachability information with Huffman coding, and queries directly on the compressed data to preserve the memory savings obtained through compression. We also propose an efficient sampling strategy based on the distribution of RR sets, which can further reduce the computation time for typical social networks with long-tail distributions. Considering a NUMA architecture, we scale up our solution on 128-core CPUs and reduce the memory footprint by up to 45.7% with negligible time overhead (or even faster) and without perceivable loss of accuracy.

Chen, Xinyu↗
DOE OSTI2023

SuperNeuro: A Fast and Scalable Simulator for Neuromorphic Computing

In many neuromorphic workflows, simulators play a vital role for important tasks such as training spiking neural networks, running neuroscience simulations, and designing, implementing, and testing neuromorphic algorithms. Currently available simulators cater to either neuroscience workflows (e.g., NEST and Brian2) or deep learning workflows (e.g., BindsNET). Problematically, the neuroscience-based simulators are slow and not very scalable, and the deep learning-based simulators do not support certain functionalities that are typical of neuromorphic workloads (e.g., synaptic delay). In this paper, we address this gap in the literature and present SuperNeuro, which is a fast and scalable simulator for neuromorphic computing capable of both homogeneous and heterogeneous simulations as well as GPU acceleration. We also present preliminary results that compare SuperNeuro to widely used neuromorphic simulators such as NEST, Brian2, and BindsNET in terms of computation times. We demonstrate that SuperNeuro can be approximately 10×--300× faster than some of the other simulators for small sparse networks. On large sparse and large dense networks, SuperNeuro can be approximately 2.2×--3.4× faster than the other simulators, respectively.

Date, Prasanna↗
DOE OSTI2023

Experiences Detecting Defective Hardware in Exascale Supercomputers

In May 2022, the newest supercomputer to top the TOP 500 list was Frontier at Oak Ridge National Laboratory, demonstrating the capability of computing more than 1.1 quintillion (1018) floating-point calculations every second. Driving this ground-breaking rate of computing is Frontier’s more than 37,000 graphics processing units (GPUs) and 9,408 central processing units (CPUs). In total, Frontier contains more than 60 million parts. At this scale, the smallest margin of error may generate hundreds of hardware errors across the system. These errors are capable of directly hindering world-class science performed on Frontier if not found. In this work, we describe and evaluate two strategies for finding hardware-level faults in Frontier’s 9,408 compute nodes. There are two strategies developed: the first uses the Slurm scheduler to scavenge available compute time to run the node screen, the second builds upon the lessons learned in the first strategy and enforces a weekly screen of each node. Using June 2023 as a case study, we find that the first scheduling strategy consumed more than ten times the resources as the second scheduling strategy, but successfully detected five hardware defects in Frontier. We summarize the lessons learned while developing and running a node screen on the world’s first exascale supercomputer.

Hagerty, Nick↗
DOE OSTI2025

Data Assimilation for Robust UQ Within Agent-Based Simulation on HPC Systems

Agent-based simulation provides a powerful tool for in silico system modeling. However, these simulations do not provide built-in methods for uncertainty quantification (UQ). Within these types of models a typical approach to UQ is to run multiple realizations of the model then compute aggregate statistics. This approach is limited due to the compute time required for a solution. When faced with an emerging biothreat, public health decisions need to be made quickly and solutions for integrating near real-time data with analytic tools are needed. We propose an integrated Bayesian UQ framework for agent-based models based on sequential Monte Carlo sampling. Given streaming or static data about the evolution of an emerging pathogen this Bayesian framework provides a distribution over the parameters governing the spread of a disease through a population. These estimates of the spread of a disease may be provided to public health agencies seeking to abate the spread. By coupling agent-based simulations with Bayesian modeling in a data assimilation, our proposed framework provides a powerful tool for modeling dynamical systems in silico. We propose a method which reduces model error and provides a range of realistic possible outcomes. Moreover, our method addresses two primary limitations of ABMs: the lack of UQ and an inability to assimilate data. Our proposed framework combines the flexibility of an agent-based model with UQ provided by the Bayesian paradigm in a workflow which scales well to HPC systems. We provide algorithmic details and results on a simulated outbreak with both static and streaming data.

Spannaus, Adam [ORNL] (ORCID:0000000225213657)↗
DOE OSTI2021

K_Road (KRoad)

KRoad is a 2-dimensional, lightweight, vehicle driver simulator that uses 3-dimensional vehicle driving model considerations, i.e. state-of-the-art friction models, and enables the driver to make control decisions with less computation time and programmer effort required than is with full-fidelity 3d simulators. KRoad is fully compatible with OpenAI gym, and contains a factored gym framework for composing gyms from various components (process, reward function, observation function, termination conditions, etc.). KRoad is additionally compatible with the RLlib distributed reinforcement learning environment, running under the Ray distributed python framework.

Tripp, CharlesEdison [National Renewable Energy La↗
DOE OSTI2024

Identifying Climate Patterns Using Clustering Autoencoder Techniques

Abstract The complexity of growing spatiotemporal resolution of climate simulations produces a variety of climate patterns under different projection scenarios. This paper proposes a new data-driven climate classification workflow via an unsupervised deep learning technique that can dimensionally reduce the vast volume of spatiotemporal numerical climate projection data into a compact representation. We aim to identify distinct zones that capture multiple climate variables as well as their future changes under different climate change scenarios. Our approach leverages convolutional autoencoders combined with k -means clustering (standard autoencoder) and online clustering based on the Sinkhorn–Knopp algorithm (clustering autoencoder) across the conterminous United States (CONUS) to capture unique climate patterns in a data-driven fashion from the Geophysical Fluid Dynamics Laboratory Earth System Model with GOLD component (GFDL-ESM2G). The developed approach compresses 70 years of GFDL-ESM2G simulation at 0.125° spatial resolution across the CONUS under multiple warming scenarios to a lower-dimensional space by a factor of 660 000 and then tested on 150 years of GFDL-ESM2G simulation data. The results show that five climate clusters capture physically reasonable and spatially stable climatological patterns matched to known climate classes defined by human experts. Results also show that using a clustering autoencoder can reduce the computational time for clustering by up to 9.2 times when compared to using a standard autoencoder. Our five unique climate patterns resulting from the deep learning–based clustering of the lower-dimensional space thereby enable us to provide insights on hydrometeorology and its spatial heterogeneity across the conterminous United States immediately without downloading large climate datasets. Significance Statement This paper presents a data-driven climate classification approach using unsupervised deep learning to dimensionally reduce climate model outputs and to identify distinct climate regions for their future changes. Our approach compresses climate information for 70 years of Geophysical Fluid Dynamics Laboratory Earth System Model data across the conterminous United States (CONUS) at 0.125° spatial resolution. The results reveal that five climate clusters capture reasonable and stable climatological patterns matched to known climate patterns. The embedded clustering process in deep learning provides ×9.2 times faster execution than the k -means clustering technique. These results give us insight about climate spatial patterns and heterogeneity of hydrological patterns across the conterminous United States without downloading large climate datasets.

Kurihana, Takuya↗
DOE OSTI2024

Should We Conserve Entropy or Energy when Computing CAPE with Mixed-Phase Precipitation Physics?

Abstract The rapidly increasing resolution of global atmospheric reanalysis and climate model datasets necessitates finding methods for computing convective available potential energy (CAPE) both efficiently and accurately. To this end, this article compares two common methods for computing CAPE which conserve either energy or entropy. Inaccuracies in these computations arise from both physical and numerical errors. For instance, computing CAPE with entropy conserved results in physical errors from nonequilibrium phase transitions but minimizes numerical errors because solutions are analytic at each height. In contrast, computing CAPE with energy conserved avoids these physical errors, but accumulates numerical errors that are grid-resolution-dependent because the numerical integration of a differential equation is required. Analysis of CAPE computed with large databases of soundings from the tropical Amazon and midlatitude storm environments shows that physical errors from the entropy method are typically 1%–3% as large as CAPE, which is comparable to the numerical errors from conserving energy with grid spacing of 25 and 250 m using explicit first-order and second-order integration schemes, respectively. Errors in entropy-based CAPE calculations are also insensitive to vertical grid spacing, in contrast to energy-based calculations whose error strongly scales with the grid spacing. It is shown that entropy-based methods are advantageous when intercomparing datasets with differing vertical resolution because they produce accurate and reasonably fast results that are insensitive to grid resolution, whereas a second-order energy-based method is advantageous when analyzing data with a consistent vertical resolution because of its superior computational efficiency. Significance Statement Convective available potential energy (CAPE) is a measure of instability in the atmosphere that helps forecasters and researchers understand when and where thunderstorms will form. The purpose of this article is to identify the most efficient and accurate methods for computing CAPE. Two methods are considered here, one that relates to the entropy (a measure of thermodynamic disorder) of an air parcel and one that relates to the energy of an air parcel. Results indicate that the entropy method is most accurate and insensitive to the resolution of the data used for the calculation (which can vary considerably), whereas the energy method uses the least computation time.

Peters, John M.↗
DOE OSTI2020

A Computationally Efficient Linear Semi-Lagrangian Scheme for the Advection of Microphysical Variables in Cloud-Resolving Models

An efficient semi-Lagrangian (SL) numerical scheme for the advection of positive-definite microphysical variables in cloud-resolving models is proposed. The scheme is a linear combination of SL schemes of the first and second order. The proposed scheme is compared with two high-order, monotonic, nonlinear Eulerian schemes, in two 2D tests. In the first test, advection of a positive scalar field with large gradients is performed within complicated idealized steering flows. In the second test, a hail storm is simulated using the 2D Hebrew University Cloud Model, describing the interactions between 15 size distributions of different microphysical quantities (each distribution is described by 43 mass bins). The proposed scheme is computationally efficient, has a low numerical diffusion and a high level of mass conservation accuracy, and preserves the sum of multiple advected variables as well as the linear relationships between the advected scalar variables. Although the proposed SL scheme is not exactly positive definite, the negative values and their number, which may appear only in the case of very strong gradients, are negligible. The scheme produces results similar to those of nonlinear Eulerian advection schemes while reducing computation time by approximately a factor of 10.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Precise 3D reactor core calculation using spherical harmonics and discontinuous Galerkin finite element methods

We study the use of P{sub N} method in angle and discontinuous Galerkin is space to solve 3D neutron transport problem. P{sub N} method consists in developing the angular flux on truncated spherical harmonics basic. In this paper, we couple this method with the discontinuous finite elements in space to obtain a complete discretization of the multigroup neutron transport equation. To investigate its precision, the method was applied to Takeda and C5G7 benchmark problems. These calculations point out that the proposed P{sub N}-DG method is capable of producing accurate solutions in small computational time, and that it is able to handle complex 3D geometries. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗