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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Large-scale Gravitational Lens Modeling with Bayesian Neural Networks for Accurate and Precise Inference of the Hubble Constant

We investigate the use of approximate Bayesian neural networks (BNNs) in modeling hundreds of time delay gravitational lenses for Hubble constant (H 0 ) determination. Here, our BNN was trained on synthetic Hubble Space Telescope quality images of strongly lensed active galactic nuclei with lens galaxy light included. The BNN can accurately characterize the posterior probability density functions (PDFs) of model parameters governing the elliptical power-law mass profile in an external shear field. We then propagate the BNN-inferred posterior PDFs into an ensemble H 0 inference, using simulated time delay measurements from a plausible dedicated monitoring campaign. Assuming well-measured time delays and a reasonable set of priors on the environment of the lens, we achieve a median precision of 9.3% per lens in the inferred H 0 . A simple combination of a set of 200 test lenses results in a precision of 0.5 km s –1 Mpc –1 (0.7%), with no detectable bias in this H 0 recovery test. The computation time for the entire pipeline—including the generation of the training set, BNN training and H0 inference—translates to 9 minutes per lens on average for 200 lenses and converges to 6 minutes per lens as the sample size is increased. Being fully automated and efficient, our pipeline is a promising tool for exploring ensemble-level systematics in lens modeling for H 0 inference.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Visual HPC Workflows for the Analysis of System Dynamics Models

Visual analytics supported by high performance computing (HPC) accelerates and enhances the discovery, exploration, and analysis of causal patterns in complex system dynamics (SD) models. We present a suite of visualization-assisted ensemble-based techniques for hypothesis generation and testing, and for sensitivity analysis. By employing HPC to provide parallel, on-demand simulation of SD models, one can “steer” an ensemble of simulated scenarios in real time as one first formulates and then informally tests those hypotheses: this provides rapid feedback for analysts to refine their understanding of the causal relationships emergent from a model. Such understandings can be followed and augmented by rigorous application of statistical methods, namely global variance-based sensitivity analysis, Monte-Carlo filtering, adaptive regional sensitivity analysis, and self-organized maps: here timely computation relies on HPC, while effective presentation emphasizes high-dimensional multivariate data visualization. Immersive visualization in virtual 3D environments provides an excellent adjunct to the traditional 2D graphics typically used for SD models, as it generates an embodied understanding of model behavior and facilitates an active, collaborative critique of model structure and output. Finally, we summarize prospects for HPC-enabled visual analytics applied to SD modeling.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2022

Controller-Based Energy-Aware Wireless Sensor Network Routing Using Quantum Algorithms

Energy-efficient routing in wireless sensor networks has attracted attention from researchers in both academia and industry, most recently motivated by the opportunity to use software-defined network-inspired approaches. These problems are NP-hard, with algorithms needing computation time that scales faster than polynomials in the problem size. Consequently, heuristic algorithms are used in practice, which are unable to guarantee optimally. In this article, we show proof-of-principle for the use of a quantum annealing processor instead of a classical processor, to find optimal or nearly optimal solutions very quickly. Our preliminary results for small networks show that this approach using quantum computing has great promise and may open the door for other significant improvements in the efficacy of network algorithms.

42 ENGINEERING↗
DOE OSTI2022

Hybrid large-eddy simulation with adaptive downstream anisotropic eddy viscosity model

Turbulence pervades most flows of engineering interest, and its prediction remains a challenge on both accuracy and cost. One promising predictive approach that reduces cost combines large-eddy simulation (LES) with simulation based on Reynolds averaged Navier–Stokes equations (RANS). This study presents a method to overcome stability and accuracy issues associated with these hybrid LES-RANS methods. The method developed involves extracting the Reynolds stresses from the upstream LES solution and then using that information to convert the downstream RANS model from a scalar eddy-viscosity model to an anisotropic nonlinear eddy-viscosity model. The method developed differs from the downstream tensorial eddy-viscosity model by being independent of the coordinate system. The method developed was evaluated by computing film cooling of a flat plate with the coolant injected through one row of circular holes. Results obtained show instabilities at the LES-to-RANS interface to be eliminated. Also, the method developed yielded solutions that compare reasonably well with those from LES, even though a significant portion of the flow is computed by the adapted anisotropic RANS model instead of LES, which significantly reduced the number of grid points and computational time needed. Since modification of the downstream RANS model is based on information extracted from the upstream LES solution, the method developed is adaptive to the problem being studied.

42 ENGINEERING↗
DOE OSTI2022

A fast and accurate modeling approach for water and steam thermodynamics with practical applications in district heating system simulation

In U.S. district heating (DH) systems, steam is the most common heat transport medium. Industry demand for new advanced modeling capabilities of complete steam DH systems is increasing; however, the existing models for water/steam thermodynamics are too slow for large system simulations because of computationally expensive algebraic loops that require the solution to nonlinear systems of equations. For practical applications, this work presents a novel split-medium approach that implements numerically efficient liquid water models alongside various water/steam models, breaking costly algebraic loops by decoupling mass and energy balance equations. New component models for steam DH systems are also presented. We implemented the models in the equation based Modelica language and evaluated accuracy and computing speed across multiple scales: from fundamental thermodynamic properties to complete districts featuring 10 to 200 buildings. Compared to district models with the IF97 water/steam model and equipment models from the Modelica Standard Library, the new implementation improves the scaling rate for large districts from cubic to quadratic with negligible compromise to accuracy. Additionally, for an annual simulation with 180 buildings, this translates to a computing time reduction from 33 to 1-1.5 h. These results are critically important for industry practitioners to simulate steam DH systems at large scales.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2023

Grid Event Signature Library Analytics Report: Signature Matching Tool Development Efforts

This report describes the purpose and features of the Signature Matching Tool (SMT), employed in the Department of Energy (DOE) Grid Event Signature Library (GESL). The SMT supports a user of GESL to identify snippets of electric signatures, usually from sensor devices measuring electric characteristics such as phase voltages and currents, frequency, etc., suspected to represent certain events in the power grid but are not known to the user. The SMT uses a classification method to identify an event of the unknown signature, using the repository of known and labeled signatures in the GESL. The classifier applies a local binary classifier per node (LCN) approach to the unique event tag taxonomy used in the GESL, where training phases are separated based on the Primary labels in the taxonomy, sensor type, and voltage level. Results show that this method helps with computing time during training, in comparison to a flat, multinomial classifier, and produces acceptable average accuracy of 83% across all Primary labels. The report concludes with planned future work including integration to the web interface and API.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Sequence2Self: Self-supervised image sequence denoising of pixel-level spray breakup morphology

Optical imaging of fast and transient phenomena such as the turbulent breakup of liquid sprays exhibit low signal-to-noise ratios due to the limited illumination intensity relative to the short exposure time. Image denoising is required to facilitate physical studies over these data but is challenging due to the absence of clean ground-truths and the stringency of the denoising task (e.g., strong and complex noise, limited resolution, preserving physical fidelity), preventing supervised and existing un-/self-supervised deep learning methods. To this end, Sequence2Self (Seq2S) is proposed, an extension of Self2Self (S2S) to image sequences that leverages both the signal’s spatial and temporal correlation. Seq2S is demonstrated on time-resolved x-ray phase contrast imaging of liquid jet fuel sprays in a gas turbine combustor, which possesses all of challenges detailed above. Experiments are conducted across four fuels with different breakup morphology using various state-of-the-art methods. Overall, many of the methods failed and Seq2S was most successful: (1) Accurate spray structures were reconstructed with consistent evolution across frames void of artifacts. (2) The performance was robust, invariant to the hyperparameter choice. (3) Computational time is short and can be made eligible for real-time denoising. In particular, the images denoised by Seq2S showed spray droplet diameter distributions with near-zero Kullback–Leibler divergence (0.01 ± 0.01) to a cleaner reference, whereas the second best method yielded 0.06 ± 0.03. In conclusion, this suggests that Seq2S can be reliably used prior to subsequent quantitative spray analyses as it retains (if not, improves) the statistical physical properties of the data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Towards fast, accurate predictions of RF simulations via data-driven modeling: Forward and lateral models

Three machine learning techniques (multilayer perceptron, random forest, and Gaussian process) provide fast surrogate models for lower hybrid current drive (LHCD) simulations. A single GENRAY/CQL3D simulation without radial diffusion of fast electrons requires several minutes of wall-clock time to complete, which is acceptable for many purposes, but too slow for integrated modeling and real-time control applications. More accurate simulations with fast electron diffusion are even slower, requiring multiple hours of run time with parallel processing. The machine learning models use a database of 16,000+ GEN-RAY/CQL3D simulations for training, validation, and testing. Latin hypercube sampling methods implemented in πScope ensure that the database covers the range of 9 input parameters (n e0 , T e0 , I p , B t , R 0 , n ∥︀ , Z e f f , V loop , P LHCD ) with sufficient density in all regions of parameter space. The surrogate models reduce the computation time from minutes-hours to ms with high accuracy across the input parameter space. Data-driven surrogate models also allow for solving inverse and “lateral” problems. A surrogate model for the inverse problem maps from a desired current drive or power deposition profile to a set of input parameters that would result in such a profile, while a surrogate model for the lateral problem maps from a measured experimental quantity such as hard x-ray emission to a current drive or power deposition profile. In conclusion, the πScope database creation workflow is flexible and applicable to other RF simulation codes such as TORIC.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Efficient Topology Design Algorithms for Power Grid Stability

The dynamic response of power grids to small disturbances influences their overall stability. This letter examines the effect of network topology on the linearized time-invariant dynamics of electric power systems. The proposed framework utilizes H 2 -norm based stability metrics to study the optimal placement of lines on existing networks as well as the topology design of new networks. The design task is first posed as an NP-hard mixed-integer nonlinear program (MINLP) that is exactly reformulated as a mixed-integer linear program (MILP) using McCormick linearization. To improve computation time, graph-theoretic properties are exploited to derive valid inequalities (cuts) and tighten bounds on the continuous optimization variables. Moreover, a cutting plane generation procedure is put forth that is able to interject the MILP solver and augment additional constraints to the problem on-the-fly. Finally, the efficacy of our approach in designing optimal grid topologies is demonstrated through numerical tests on the IEEE 39-bus network.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Universal parameters of bulk-solvent masks

The bulk solvent is a major component of biomacromolecular crystals that contributes significantly to the observed diffraction intensities. Accurate modelling of the bulk solvent has been recognized as important for many crystallographic calculations. Owing to its simplicity and modelling power, the flat (mask-based) bulk-solvent model is used by most modern crystallographic software packages to account for disordered solvent. In this model, the bulk-solvent contribution is defined by a binary mask and a scale (scattering) function. The mask is calculated on a regular grid using the atomic model coordinates and their chemical types. The grid step and two radii, solvent and shrinkage, are the three parameters that govern the mask calculation. They are highly correlated and their choice is a compromise between the computer time needed to calculate the mask and the accuracy of the mask. It is demonstrated here that this choice can be optimized using a unique value of 0.6 Å for the grid step irrespective of the data resolution, and the radii values adjusted correspondingly. The improved values were tested on a large sample of Protein Data Bank entries derived from X-ray diffraction data and are now used in the computational crystallography toolbox ( CCTBX ) and in Phenix as the default choice.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Latent heat thermal energy storage performance maps enabling fast & accurate building energy simulations

Thermal energy storage (TES) using phase change materials (PCMs) has gained attention as an effective approach to manage energy demand fluctuations and shift peak building loads. PCM embedded heat exchangers (PCM-HXs) offer high energy storage density and low temperature variation during phase change, being suitable for load-shifting applications. However, this component is typically evaluated using computationally expensive methods, which present significant challenges when the ultimate goal is to assess the performance of PCM-HX integrated thermal energy storage systems in the full building context. In this paper, we present a methodology to generate highly accurate and computationally efficient PCM-HX performance maps which can be easily integrated into building energy simulation tools to analyze the feasibility of space conditioning systems with latent heat PCM-based TES. The performance maps are generated using a computationally efficient PCM-HX simulation tool based on a Generalized Resistance-Capacitance Model (GRCM) which can simulate arbitrary PCM-HXs with high accuracy and significantly less computational effort compared to full CFD simulations. The methodology was verified for a case study considering a 5-ton (~17.5 kW) air-to-water heat pump-thermal energy storage system (HP-TES), which was co-simulated in Modelica for a DOE prototype small-office building in Vienna, Austria, using Spawn of EnergyPlus™. The TES performance maps provided accurate predictions of PCM-HX behavior when used as Modelica component, with deviations within 2-4% while also achieving at least 103 computational time reduction. Leveraging this faster prediction capability, four PCMs with different melting temperatures for cooling (12°C, 16°C) and heating (31°C, 36°C) were assessed to investigate their impact on system performance. This work highlights the importance of robust PCM-HX models for efficient and high-fidelity building-level simulations, presenting new opportunities for advanced control strategy development and parametric analysis of TES configurations in a computationally efficient manner

Modelica Building Simulations↗
DOE OSTI2020

Optimal 1D Ly α forest power spectrum estimation – I. DESI-lite spectra

ABSTRACT The 1D Ly α forest flux power spectrum P1D is sensitive to scales smaller than a typical galaxy survey, and hence ties to the intergalactic medium’s thermal state, suppression from neutrino masses, and new dark matter models. It has emerged as a competitive framework to study new physics, but also has come with various challenges and systematic errors in analysis. In this work, we revisit the optimal quadratic estimator for P1D, which is robust against the relevant problems such as pixel masking, time evolution within spectrum, and quasar continuum errors. We further improve the estimator by introducing a fiducial power spectrum, which enables us to extract more information by alleviating the discreteness of band powers. We meticulously apply our method to synthetic Dark Energy Spectroscopic Instrument (DESI) spectra and demonstrate how the estimator overcomes each challenge. We further apply an optimization scheme that approximates the Fisher matrix to three elements per row and reduces computation time by 60 per cent. We show that we can achieve per cent precision in P1D with 5-yr DESI data in the absence of systematics and provide forecasts for different spectral qualities.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Fast and flexible analysis of direct dark matter search data with machine learning

We present the results from combining machine learning with the profile likelihood fit procedure, using data from the Large Underground Xenon (LUX) dark matter experiment. This approach demonstrates reduction in computation time by a factor of 30 when compared with the previous approach, without loss of performance on real data. We establish its flexibility to capture non-linear correlations between variables (such as smearing in light and charge signals due to position variation) by achieving equal performance using pulse areas with and without position-corrections applied. Its efficiency and scalability furthermore enables searching for dark matter using additional variables without significant computational burden. We demonstrate this by including a light signal pulse shape variable alongside more traditional inputs such as light and charge signal strengths. Furthermore, this technique can be exploited by future dark matter experiments to make use of additional information, reduce computational resources needed for signal searches and simulations, and make inclusion of physical nuisance parameters in fits tractable.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Design-Space Exploration for Inverse-Design of Wind Turbine Blades Using Data-Driven Methods

The state-of-the-practice aerodynamic design methods for wind turbine blades is typically based on Blade-Element Momentum (BEM) theory using a pre-designed frozen family of airfoils. The airfoils are themselves typically designed using panel methods. The design of the next-generation of large flexible rotors will need to capture the non-linear aerodynamics and three-dimensional flow to reduce the levelized cost of wind energy. Data-driven methods for aerodynamic design using data generated by computational fluid dynamics offer an attractive alternative to BEM-based methods that captures the non-linear aerodynamics of the component airfoils as well as the root and tip sections. In this work, we develop and demonstrate a framework to "smartly" explore the relevant design space in combination with an appropriate automated CFD pipeline to evaluate the aerodynamics of each design. The design-space exploration framework uses appropriate perturbations to the airfoil shape and induction profile from a baseline shape in combination with the inverse-design using BEM. The resulting designs are evaluated using an automated CFD pipeline using the in-house CFD solver framework "Mercury". We perform verification and validation to establish the capability of the Mercury framework to predict the aerodynamic performance of wind turbines. The CFD simulation of the perturbed blade shapes are optimized to restart from the converged baseline simulation to reduce the computational time. Finally, we demonstrate the design-space exploration technique for the design of the outboard section and the full rotor using perturbations to the shape and operating conditions of the NREL 5-MW turbine.

aerodynamic design methods↗
DOE OSTI2024

Developing And Scaling an OpenFOAM Model to Study Turbulent Flow in a HFIR Coolant Channel

Improving the understanding of how computational fluid dynamics (CFD) direct numerical simulations (DNS) of flows in the High Flux Isotope Reactor (HFIR) perform when run in parallel using the high performance computing (HPC) platform Summit at the Oak Ridge Leadership Computing Facility (OLCF) is of particular importance to boost the computational tools used to support HFIR conversion to low enriched fuel (LEU). Evaluation of scaling performance was driven by the increasing importance of graphics processing unit (GPU) usage in HPC, which is becoming the standard for modern supercomputers such as Summit. The desired results are to obtain a strong positive correlation between the computational resources dedicated to a problem and the relative speed-up of the simulation in comparison to a benchmark. This capability will allow substantially improvement in HFIR flow analytical capabilities, specifically when predicting turbulence properties at high Reynolds numbers. The study leverages previous simulation results performed with code PHASTA (finite element) on HPC platforms Cori (NERSC) and Theta (ALCF) [1] with computing options provided in the computing platform OpenFOAM (finite volume) at OLCF. Transitioning from PHASTA to OpenFOAM will (1) eliminate dependence on third-party software for mesh generation and manipulation, (2) reduce resource needs by employing modern architectures, and (3) build expertise for future modeling of HFIR-specific problems like heat transfer in involute geometry, entrance effects, flow structure in channel corners, and so on—all important issues when defining the available thermal margins in the transition to LEU. CPUs and GPUs differ significantly in their architecture and utilization, as discussed in the literature [2]. The most important differences are in the approach to computations and their memory. A single GPU contains a large quantity of cores, enabling it to perform with a much higher throughput than a CPU, but execution requires a different approach. GPU codes execute instructions using the Single-Instruction Multiple-Thread (SIMT) approach in which a single instruction is used for groups of threads called warps. A warp typically consists of 32 threads which must execute the same set of instructions, although on separate threads. Alternately, a CPU has far fewer cores that are much more flexible in their operation, excelling at quickly performing more complex serial computations. This is why GPUs have greater throughput when properly utilized. The second important difference is seen when comparing their memory spaces. Limited memory allocations and CPU–GPU communications cause a significant bottleneck in GPU-accelerated programs. Further study was required to properly take advantage of GPU resources. A comprehensive analysis of code performance and the model-specific features of turbulence constitutes the core of this work. In this study, a DNS simulation of HFIR channel turbulence was performed with the finite volume CFD code OpenFOAM v2112 and CUDA v11.0 on Red Hat Enterprise Linux v8.2. The OpenFOAM installation had AMGx integrated to enable GPU acceleration and utilizes the PETSc4FOAM library. The computational resources and the problem size were scaled on CPU and CPU + GPU architectures to gain a better understanding of the performance of a DNS problem on modern computing hardware. The study aimed to analyze the scaling of the code exclusively on CPUs and then to examine the scaling of the codes with GPU acceleration enabled. Scaling studies included CPU and GPU acceleration on a mesh of varying resolution to analyze the impact of problem size relative to computational resources. In the course of preparing the GPU configuration on Summit, mainly using the AMGX solvers, difficulties were encountered stemming from constant changes resulting from extensive ongoing development activities and the changing environment. This resulted in the inability to complete the GPU portion of the work. The code was compiled and tested, but production runs to assess acceleration were not performed because the used discretional compute time allocation expired as year-end approached. The Summit HPC platform is scheduled for decommissioning in 2024, making it unattractive for future use with Nvidia-based GPUs. Therefore, the work will be moved onto NERSC machines in FY24. An application was prepared and submitted, and sufficient node-hours were awarded to continue the research in the next calendar year. This report summarizes work performed thus far, which mostly focused on CPU OpenFOAM computing.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2022

Scalable Predictive Control and Optimization for Grid Integration of Large-Scale Distributed Energy Resources

Integrating a large number of distributed energy resources (DERs) into the power grid needs a scalable power balancing method. We formulate the power balancing problem as a look-ahead optimization problem to be solved sequentially by a power distribution system aggregator based on a model predictive control (MPC) framework. Solving large-scale look-ahead control problems requires proper configuration of the control steps. In this paper, to solve large-scale control problems, we propose a variable time granularity where control time steps nearby the current control step have finer resolutions. The aggregator objective includes maximization of power production revenue and minimization of power purchasing expense, renewable power curtailment, and mileage costs for energy storage and electric vehicle (EV) charging stations while satisfying system capacity and operational constraints. The control problem is formulated as a mixed-integer linear program (MILP) and solved using the XpressMP solver. We perform simulations considering a copper plate representation of a large distribution network consisting of 2507 devices (controllable DERs), including curtailable photovoltaics (PVs), energy storage batteries, EV charging stations, and buildings with heating, ventilation, and air conditioning units (HVACs). We show the effectiveness of the proposed approach in managing DERs interactively for maximum energy trading profit and local supply-demand power balancing. Finally, we demonstrate that the proposed method outperforms other benchmark controllers regarding computation time without compromising operational performance.

DER↗
DOE OSTI2023

Aggregation of Inverter-Based Resources for Modeling and Simulation

In order to conduct system dynamic studies, it is necessary to have dynamic models of both inverter and plant levels. Detailed and aggregated modeling approaches are two essential options. The detailed modeling method involves capturing the dynamic characteristics of each individual device (e.g., wind turbine or PV array), as well as their interconnections. However, as the scale of the IBR plant increases, the complexity and computation time required for detailed modeling also increase. On the other hand, aggregated modeling offers a more efficient way of representing large-scale IBRs in power system dynamic studies. This approach involves aggregating a large number of wind turbines, PV arrays, inverters, and/or plant controllers into one or a smaller number of equivalent models. In order to analyze the impact of a high-level IBR penetration in power systems, it is important to develop accurate and computationally efficient models for both the detailed and aggregated methods.

14 SOLAR ENERGY↗
DOE OSTI2025

Enabling Real-Time Communication in Multi-Agent Systems: A Graph Neural Network Based Approach

Global connectivity enables effective coordination in Multi-Agent Systems (MAS). Solving these connection problems under hardware constraints is an NP-hard non-Euclidean Degree Constrained Minimum Spanning Tree (DCMST) problem. Prior MAS controllers coordinate team movement for task completion and collision avoidance; some considering Line-of-Sight (LOS) maintenance but prioritizing flexibility over guarantees. Evolutionary Algorithms (EA) have been shown to find good solutions for DCMST, but their performance degrades with larger populations required to support a large MAS. We present a method based on edge graph attention networks, trained offline to reduce online computation times. Empirical comparisons with greedy polynomial-time solvers and EA show that our method leverages latent graph information to consistently find constraint-satisfying solutions in less time.

connectivity maintenance↗