SEARCH · Engineering Papers

Results for “computing methods”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,351 records · Page 75

All sources NASA NTRS DOE OSTI

DOE OSTI2021

System and method for characterization of retrofit opportunities in building using data from communicating thermostats

Systems and methods for characterization of retrofit opportunities are described. The methods may comprise computing, using at least one computing device disposed remote from a building and based at least in part on heating, ventilation and air conditioning (HVAC) runtime data associated with the building, one or more thermal characteristics of the building. In some embodiments, a model-predicted indoor temperature may be fitted against thermal data measured by a thermostat at the building. The thermal characteristic of the building may comprise a thermal insulation, an air leakage rate and/or an HVAC efficiency. The method may be used to determine, using the at least one computing device, suitability of the building for a retrofit opportunity to improve energy efficiency of the building. Determining the suitability may comprise evaluating the one or more thermal characteristics. The HVAC runtime data may be computed based on data received from a thermostat or a meter, such as an electric or a gas meter.

Zeifman, Michael↗

DOE OSTI2021

System and method for characterization of retrofit opportunities in building using data from interval meters

Zeifman, Michael↗

DOE OSTI2026

A Comprehensive Comparison of Methods for Evaluating Dispatch of Long-Duration Energy Storage in Power Systems Models

Long-duration energy storage (LDES) could play a pivotal role in the transformation of electricity grids with high shares of variable renewable energy (VRE) such as solar and wind. However, the weather-dependent nature of VRE introduces challenges for grid balancing and stability, which LDES - along with short-duration energy storage (SDES) - can help address. However, modeling LDES in production cost models (PCMs) is particularly challenging due to the need for high temporal resolution over extended optimization windows while preserving chronology, which ensures the alignment of energy storage operations with VRE generation over multi-day periods. This report compares traditional dispatch methods with advanced LDES dispatch strategies, such as the extended horizon approach, across different PCM platforms and examines tradeoffs and scalability. The comparison reveals that the traditional 1-day optimization horizon within the PCM leads to inefficient utilization of LDES. In contrast, extending the optimization horizon as much as possible significantly reduces curtailment and improves storage dispatch, especially in renewable-dense systems. There is also promise in using state-of-charge or end volume targets set by an external model, however this requires an additional modeling set and generally increases computational burden. This paper presents a comparison of these various methods in a number of power systems, showing algorithms initially in small test systems and scaling up to large, country-wide simulations. Overall, the research presents the trade-offs of various computational methods and illustrates how LDES may play an essential role in power systems of the future.

14 SOLAR ENERGY↗

DOE OSTI2025

Efficient proximal subproblem solvers for a nonsmooth trust-region method

In [R. J. Baraldi and D. P. Kouri, Mathematical Programming, (2022), pp. 1-40], we introduced an inexact trust-region algorithm for minimizing the sum of a smooth nonconvex and nonsmooth convex function. The principle expense of this method is in computing a trial iterate that satisfies the so-called fraction of Cauchy decrease condition—a bound that ensures the trial iterate produces sufficient decrease of the subproblem model. In this paper, we expound on various proximal trust-region subproblem solvers that generalize traditional trust-region methods for smooth unconstrained and convex-constrained problems. We introduce a simplified spectral proximal gradient solver, a truncated nonlinear conjugate gradient solver, and a dogleg method. Finally, we compare algorithm performance on examples from data science and PDE-constrained optimization.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Computer-aided design file format for additive manufacturing and methods of file generation

A method of generating a tessellated output file comprising receiving a computer-aided design (CAD) model file defining a CAD model including a plurality of vertices, a plurality of curves, a plurality of surfaces, and at least one volume; generating base polygon data defining the CAD model for additive manufacturing, the base polygon data including a plurality of connected polygons, each polygon including a plurality of nodes, a plurality of edges, and a face; generating data for a vertex metadata container including a listing of CAD model vertices and one polygon node associated with each CAD model vertex; generating data for a curve metadata container including a listing of CAD model curves and at least one polygon edge associated with each CAD model curve; and generating data for a surface metadata container including a listing of CAD model surfaces and at least one polygon face associated with each CAD model surface.

Vernon, Gregory John↗

DOE OSTI2024

Exact enforcement of temporal continuity in sequential physics-informed neural networks

The use of deep learning methods in scientific computing represents a potential paradigm shift in engineering problem solving. One of the most prominent developments is Physics-Informed Neural Networks (PINNs), in which neural networks are trained to satisfy partial differential equations (PDEs). While this method shows promise, the standard version has been shown to struggle in accurately predicting the dynamic behavior of time-dependent problems. To address this challenge, methods have been proposed that decompose the time domain into multiple segments, employing a distinct neural network in each segment and directly incorporating continuity between them in the loss function of the minimization problem. In this work we introduce a method to exactly enforce continuity between successive time segments via a solution ansatz. This hard constrained sequential PINN (HCS-PINN) method is simple to implement and eliminates the need for any loss terms associated with temporal continuity. The method is tested for a number of benchmark problems involving both linear and non-linear PDEs. Examples include various first order time dependent problems in which traditional PINNs struggle, namely advection, Allen–Cahn, and Korteweg–de Vries equations. Furthermore, second and third order time-dependent problems are demonstrated via wave and Jerky dynamics examples, respectively. Notably, the Jerky dynamics problem is chaotic, making the problem especially sensitive to temporal accuracy. Finally, the numerical experiments conducted with the proposed method demonstrated superior convergence and accuracy over both traditional PINNs and the soft-constrained counterparts.

42 ENGINEERING↗

DOE OSTI2022

Effective properties of semitransparent radiative cooling materials with spectrally variable properties

Radiative cooling is a promising solid-state, non-vapor-compression technology for passive refrigeration and air conditioning. Although this phenomenon occurs naturally, achieving a significant amount of cooling to make it a technically and economically viable technology requires highly engineered, spectrally selective radiative surfaces. These characteristics make radiative cooling difficult to estimate, particularly when it is integrated with other systems such as photovoltaic panels or building envelopes. The complexity further increases when the substrate also participates in the radiative cooling (along with the radiative coating). Energy estimation is becoming increasingly critical because of the recent focus on the semitransparent radiative coatings that transmit a variety of colors to enhance the aesthetic appeal of the system. In this work, we propose an iterative method to calculate the effective radiative properties, which provides the same net radiative cooling that would be observed using the spectral properties at both the coating and substrate surfaces. Compared to traditional methods that rely on either computationally expensive full spectral analysis or methods for averaging each radiative surface parameter locally, our proposed method focuses on calculating effective properties that provide the same the net cooling effect as a full spectral analysis by accounting the emissivity, absorptivity, and transmissivity collectively, thereby providing an overall estimation error of less than 0.2%. We believe that this study will be beneficial to the engineering communities that employ complex simulation codes and require lumped solar and thermal radiation related parameters.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2020

Rapid data-driven model reduction of nonlinear dynamical systems including chemical reaction networks using ℓ 1 -regularization

We develop a new data-driven paradigm for efficient model reduction of a broad class of nonlinear dynamical systems. Our model reduction method directly enables the interpretation of key components of the dynamical system, unlike traditional projection-based model reduction methods that focus on reducing computational complexity more than interpretability. Our method is not application specific and is simple to implement on nonlinear dynamical systems arising from a variety of different fields. It requires minimal parameterization using a single parameter to trade-off between model complexity and estimation error. We use a data-driven paradigm to formulate model reduction as an efficient convex optimization problem that scales polynomially in the original size of the complex system, enabling systems with as many as thousands of components to be reduced in a matter of minutes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

HPDR: High-Performance Portable Scientific Data Reduction Framework

The rapid growth in scientific data generation is outpacing advancements in computing systems necessary for efficient storage, transfer, and analysis, particularly in the context of exascale computing. With the deployment of first-generation exascale computing systems and next-generation experimental facilities, this gap is widening and necessitates effective data reduction techniques to manage enormous data volumes. Over the past decade, various data reduction methods, including lossless compression, error-controlled lossy compression, and data refactoring, have been developed to accelerate I/O in scientific workflows. Despite significant reductions in data volume, these methods introduce considerable computational overhead, which can become the new bottleneck in data processing. To mitigate this, GPU-accelerated data reduction algorithms have been introduced. However, challenges remain in their integration into exascale workflows, including limited portability across different GPU architectures, substantial memory transfer overhead, and reduced scalability on dense multi-GPU systems. To address these challenges, we propose HPDR, a high-performance and portable data reduction framework. HPDR is designed to enable the execution of state-of-the-art reduction algorithms across diverse processor architectures while reducing memory transfer overhead to 2.3 % of the original, resulting in up to 3.5× faster throughput compared to existing solutions. It also achieves up to 96% of the theoretical speedup in multi-GPU settings. In addition, evaluations on accelerating I/O operations at scale up to 1,024 nodes of the Frontier supercomputer demonstrate that HPDR can achieve up to 103 TB/s reduction throughput, providing up to 4× acceleration in parallel I/O performance compared to existing data reduction routines. This work highlights the potential of HPDR to significantly enhance data reduction efficiency in exascale computing environments.

Chen, Jieyang [University of Oregon]↗

DOE OSTI2026

Machine learning approach for vibronically renormalized electronic band structures

Here, we present a machine learning (ML) method for efficient computation of vibrational thermal expectation values of physical properties from first principles. Our approach is based on the nonperturbative frozen phonon formulation in which stochastic Monte Carlo algorithm is employed to sample configurations of nuclei in a supercell at finite temperatures based on a first-principles phonon model. A deep-learning neural network is trained to accurately predict physical properties associated with sampled phonon configurations, thus bypassing the time-consuming ab initio calculations. To incorporate the point-group symmetry of the electronic system into the ML model, group-theoretical methods are used to develop a symmetry-invariant descriptor for phonon configurations in the supercell. We apply our ML approach to compute the temperature dependent electronic energy gap of silicon based on density functional theory (DFT). We show that, with less than a hundred DFT calculations for training the neural network model, an order of magnitude larger number of sampling can be achieved for the computation of the vibrational thermal expectation values. Our work highlights the promising potential of ML techniques for finite temperature first-principles electronic structure methods.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2021

Flow-driven spectral chaos (FSC) method for simulating long-time dynamics of arbitrary-order non-linear stochastic dynamical systems

Uncertainty quantification techniques such as the time-dependent generalized polynomial chaos (TD-gPC) use an adaptive orthogonal basis to better represent the stochastic part of the solution space (aka random function space) in time. However, because the random function space is constructed using tensor products, TD-gPC-based methods are known to suffer from the curse of dimensionality. Here, we introduce a new numerical method called the flow-driven spectral chaos (FSC) which overcomes this curse of dimensionality at the random-function-space level. The proposed method is not only computationally more efficient than existing TD-gPC-based methods but is also far more accurate. The FSC method uses the concept of enriched stochastic flow maps to track the evolution of a finite-dimensional random function space efficiently in time. To transfer the probability information from one random function space to another, two approaches are developed and studied herein. In the first approach, the probability information is transferred in the mean-square sense, whereas in the second approach the transfer is done exactly using a new theorem that was developed for this purpose. The FSC method can quantify uncertainties with high fidelity, especially for the long-time response of stochastic dynamical systems governed by ODEs of arbitrary order. Six representative numerical examples, including a nonlinear problem (the Van-der-Pol oscillator), are presented to demonstrate the performance of the FSC method and corroborate the claims of its superior numerical properties. Finally, a parametric, high-dimensional stochastic problem is used to demonstrate that when the FSC method is used in conjunction with Monte Carlo integration, the curse of dimensionality can be overcome altogether.

(nonlinear) stochastic dynamical systems↗

DOE OSTI2022

Dynamic Parameter Estimation with Physics-based Neural Ordinary Differential Equations

Accurate estimation of dynamic parameters of gen-erators is crucial to building a reliable model for dynamical studies and reliable operation of the power system. This paper develops a physics-based neural ordinary differential equations (ODE) approach to learn the parameters of generator dynamic model using phasor measurement units (PMU) data. We design a physics-based neural network to represent the swing equations of the power system dynamics. A loss function is defined as the difference between dynamic simulation results from the physics-based neural networks and pseudo PMU measurements. The parameters of generator dynamic model are iteratively updated using the neural ODEs and the adjoint method. By exploiting the mini-batch scheme in neural ODE training, the parameter estimation performance is significantly improved. Numerical study results on a 3-machine 9-bus system show that the proposed algorithm outperforms state-of-the-art baseline method in both computation time and dynamic parameter estimation accuracy.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2025

Efficient Signal Processing in BOTDA: Utilizing PCA and PCA-Based Neural Networks for Temperature Monitoring

This work presents a comparative analysis of the various signal processing techniques used in the Brillouin gain spectrum (BGS) peak estimation. Traditional fitting methods such as Lorentzian curve fitting (LCF) are slow and less effective in noisy data. PCA-based methods were tested on the experimental data: A Euclidian distance-based approach, and a probabilistic deep neural network (PDNN) based approach, both using 5 principal components to represent a single BGS. Both methods significantly reduce computational time with respect to LCF, whereas PDNN offers uncertainty insights along with the parameter value. Measuring a range of temperatures, analyzing accuracy, and speed, it can be concluded that PCA trained PDNN outperforms other methods, and appears to be helpful in scenario where large datasets are generated.

Brillouin optical time domain analysis↗

DOE OSTI2024

Deep Learning and Likelihood Approaches for Viral Phylogeography Converge on the Same Answers Whether the Inference Model Is Right or Wrong

Abstract Analysis of phylogenetic trees has become an essential tool in epidemiology. Likelihood-based methods fit models to phylogenies to draw inferences about the phylodynamics and history of viral transmission. However, these methods are often computationally expensive, which limits the complexity and realism of phylodynamic models and makes them ill-suited for informing policy decisions in real-time during rapidly developing outbreaks. Likelihood-free methods using deep learning are pushing the boundaries of inference beyond these constraints. In this paper, we extend, compare, and contrast a recently developed deep learning method for likelihood-free inference from trees. We trained multiple deep neural networks using phylogenies from simulated outbreaks that spread among 5 locations and found they achieve close to the same levels of accuracy as Bayesian inference under the true simulation model. We compared robustness to model misspecification of a trained neural network to that of a Bayesian method. We found that both models had comparable performance, converging on similar biases. We also implemented a method of uncertainty quantification called conformalized quantile regression that we demonstrate has similar patterns of sensitivity to model misspecification as Bayesian highest posterior density (HPD) and greatly overlap with HPDs, but have lower precision (more conservative). Finally, we trained and tested a neural network against phylogeographic data from a recent study of the SARS-Cov-2 pandemic in Europe and obtained similar estimates of region-specific epidemiological parameters and the location of the common ancestor in Europe. Along with being as accurate and robust as likelihood-based methods, our trained neural networks are on average over 3 orders of magnitude faster after training. Our results support the notion that neural networks can be trained with simulated data to accurately mimic the good and bad statistical properties of the likelihood functions of generative phylogenetic models.

Evolutionary Biology↗

DOE OSTI2025

A Domain-Decomposed A-ϕ Formulation Based on Lagrange Multipliers for Low-Frequency Problems

A domain-decomposed A-ϕ formulation based on Lagrange multipliers is proposed to simulate low-frequency elec- tromagnetic problems. This method partitions the computational domain into smaller subdomains, allowing each subdomain to be independently formulated using Lagrange multipliers as Dirichlet boundary conditions, while ensuring continuity of the fields across the interfaces. A mixed finite element method, utilizing both vector and scalar basis functions, is employed to discretize the formulation, resulting in a global system to be solved. The proposed method is validated using TEAM Problem 7 at 50 Hz, demonstrating its effectiveness in handling complex geometries and addressing the low-frequency breakdown issues commonly encountered in traditional finite element methods.

Hossain, Amzad↗

DOE OSTI2022

A mixed, unified forward/inverse framework for earthquake problems: fault implementation and coseismic slip estimate

SUMMARY We introduce a new finite-element (FE) based computational framework to solve forward and inverse elastic deformation problems for earthquake faulting via the adjoint method. Based on two advanced computational libraries, FEniCS and hIPPYlib for the forward and inverse problems, respectively, this framework is flexible, transparent and easily extensible. We represent a fault discontinuity through a mixed FE elasticity formulation, which approximates the stress with higher order accuracy and exposes the prescribed slip explicitly in the variational form without using conventional split node and decomposition discrete approaches. This also allows the first order optimality condition, that is the vanishing of the gradient, to be expressed in continuous form, which leads to consistent discretizations of all field variables, including the slip. We show comparisons with the standard, pure displacement formulation and a model containing an in-plane mode II crack, whose slip is prescribed via the split node technique. We demonstrate the potential of this new computational framework by performing a linear coseismic slip inversion through adjoint-based optimization methods, without requiring computation of elastic Green’s functions. Specifically, we consider a penalized least squares formulation, which in a Bayesian setting—under the assumption of Gaussian noise and prior—reflects the negative log of the posterior distribution. The comparison of the inversion results with a standard, linear inverse theory approach based on Okada’s solutions shows analogous results. Preliminary uncertainties are estimated via eigenvalue analysis of the Hessian of the penalized least squares objective function. Our implementation is fully open-source and Jupyter notebooks to reproduce our results are provided. The extension to a fully Bayesian framework for detailed uncertainty quantification and non-linear inversions, including for heterogeneous media earthquake problems, will be analysed in a forthcoming paper.

58 GEOSCIENCES↗

DOE OSTI2022

Threat emulation framework

A method for emulating threats in virtual network computing environment is provided. The method comprises creating a number of virtual machines in the virtual network computing environment. A number of threat actors are emulated, wherein each threat actor comprises a number of threat artifacts that form a sequence of attack steps against the virtual network computing environment. The threat actors are then deployed against the virtual network computing environment. Behavioral data about actions of the threat actors in the virtual network computing environment is collected, as is performance data about the virtual network computing environment in response to the threat actors. The collected behavioral and performance data is then presented to a user via an interface.

Urias, Vincent↗

DOE OSTI2022

MPACT Theory Manual (V.4.3)

This manual presents the theory underlying the three-dimensional (3D) whole-core, pin-resolved neutron transport calculation methodologies employed in the MPACT code. MPACT’s primary goal is to provide accurate sub-pin power distributions in a computationally efficient manner. To accomplish this, MPACT offers several different transport method options. The 2D/1D method, in which 3D problems are decomposed into an axial stack of radial “slices,” is currently the most commonly used. In this option, two-dimensional (2D) planar solutions are provided by the method of characteristics (MOC), and axial solutions are provided via one-dimensional (1D) approximate diffusion, or P3 solutions. The radial and axial solutions are coupled by (i) axial and radial transverse leakages, and (ii) a global 3D coarse mesh finite difference (CMFD) solve, which provides both acceleration and stability to the solution iteration scheme. The subsequent chapters of this manual present a range of topics, including MOC, CMFD, axial nodal transport solvers, 2D/1D, self-shielding, depletion, thermal-hydraulics, and transient methods. Development of the underlying theory of the 2D/1D method is presented, diagrams are included to highlight important algorithmic flow, and important concepts are discussed as appropriate. This manual is intended to be self-sufficient, but references to published articles and other materials are included for further reading. MPACT is a relatively new code, with new capabilities and many computational methods that did not exist until recently. This manual is an even newer document, with chapters written by several different code contributors working under time constraints. For these reasons, the manual is not yet complete and finalized. Future versions of this manual will address current deficiencies.

97 MATHEMATICS AND COMPUTING↗