Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Grid computing”

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 523 records · Page 29
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

AMPS: An Augmented Matrix Formulation for Principal Submatrix Updates with Application to Power Grids

We present an augmented matrix approach to update the solution to a linear system of equations when the coefficient matrix is modified by a few elements within a principal submatrix. This problem arises in the dynamic security analysis of a power grid, where operators need to perform $N-x$ contingency analysis, i.e., determine the state of the system when up to $x$ links from $N$ fail. Our algorithms augment the coefficient matrix to account for the changes in it, and then compute the solution to the augmented system without refactoring the modified matrix. We provide two algorithms, a direct method, and a hybrid direct-iterative method for solving the augmented system. We also exploit the sparsity of the matrices and vectors to accelerate the overall computation. Our algorithms are compared on three power grids with PARDISO, a parallel direct solver, and CHOLMOD, a direct solver with the ability to modify the Cholesky factors of the coefficient matrix. We show that our augmented algorithms outperform PARDISO (by two orders of magnitude), and CHOLMOD (by a factor of up to 5). Further, our algorithms scale better than CHOLMOD as the number of elements updated increases. The solutions are computed with high accuracy. Our algorithms are capable of computing $N-x$ contingency analysis on a $778K$ bus grid, updating a solution with $x=20$ elements in $1.6 \times 10^{-2}$ seconds on an Intel Xeon processor.

Yeung, Yu-Hong↗
DOE OSTI2017

Reducing Cascading Failure Risk by Increasing Infrastructure Network Interdependence

Increased coupling between critical infrastructure networks, such as power and communication systems, has important implications for the reliability and security of these systems. To understand the effects of power-communication coupling, several researchers have studied models of interdependent networks and reported that increased coupling can increase vulnerability. However, these conclusions come largely from models that have substantially different mechanisms of cascading failure, relative to those found in actual power and communication networks, and that do not capture the benefits of connecting systems with complementary capabilities. In order to understand the importance of these details, this paper compares network vulnerability in simple topological models and in models that more accurately capture the dynamics of cascading in power systems. First, we compare a simple model of topological contagion to a model of cascading in power systems and find that the power grid model shows a higher level of vulnerability, relative to the contagion model. Second, we compare a percolation model of topological cascading in coupled networks to three different models of power networks coupled to communication systems. Again, the more accurate models suggest very different conclusions than the percolation model. In all but the most extreme case, the physics-based power grid models indicate that increased power-communication coupling decreases vulnerability. This is opposite from what one would conclude from the percolation model, in which zero coupling is optimal. Only in an extreme case, in which communication failures immediately cause grid failures, did we find that increased coupling can be harmful. Together, these results suggest design strategies for reducing the risk of cascades in interdependent infrastructure systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Quantum computing in power systems

Electric power systems provide the backbone of modern industrial societies. Enabling scalable grid analytics is the keystone to successfully operating large transmission and distribution systems. However, today's power systems are suffering from ever-increasing computational burdens in sustaining the expanding communities and deep integration of renewable energy resources, as well as managing huge volumes of data accordingly. These unprecedented challenges call for transformative analytics to support the resilient operations of power systems. Recently, the explosive growth of quantum computing techniques has ignited new hopes of revolutionizing power system computations. Quantum computing harnesses quantum mechanisms to solve traditionally intractable computational problems, which may lead to ultra-scalable and efficient power grid analytics. This paper reviews the newly emerging application of quantum computing techniques in power systems. We present a comprehensive overview of existing quantum-engineered power analytics from different operation perspectives, including static analysis, transient analysis, stochastic analysis, optimization, stability, and control. We thoroughly discuss the related quantum algorithms, their benefits and limitations, hardware implementations, and recommended practices. We also review the quantum networking techniques to ensure secure communication of power systems in the quantum era. Finally, we discuss challenges and future research directions. This paper will hopefully stimulate increasing attention to the development of quantum-engineered smart grids.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2016

An interprojection sensor fusion approach to estimate blocked projection signal in synchronized moving grid-based CBCT system

Purpose: A preobject grid can reduce and correct scatter in cone beam computed tomography (CBCT). However, half of the signal in each projection is blocked by the grid. A synchronized moving grid (SMOG) has been proposed to acquire two complimentary projections at each gantry position and merge them into one complete projection. That approach, however, suffers from increased scanning time and the technical difficulty of accurately merging the two projections per gantry angle. Herein, the authors present a new SMOG approach which acquires a single projection per gantry angle, with complimentary grid patterns for any two adjacent projections, and use an interprojection sensor fusion (IPSF) technique to estimate the blocked signal in each projection. The method may have the additional benefit of reduced imaging dose due to the grid blocking half of the incident radiation. Methods: The IPSF considers multiple paired observations from two adjacent gantry angles as approximations of the blocked signal and uses a weighted least square regression of these observations to finally determine the blocked signal. The method was first tested with a simulated SMOG on a head phantom. The signal to noise ratio (SNR), which represents the difference of the recovered CBCT image to the original image without the SMOG, was used to evaluate the ability of the IPSF in recovering the missing signal. The IPSF approach was then tested using a Catphan phantom on a prototype SMOG assembly installed in a bench top CBCT system. Results: In the simulated SMOG experiment, the SNRs were increased from 15.1 and 12.7 dB to 35.6 and 28.9 dB comparing with a conventional interpolation method (inpainting method) for a projection and the reconstructed 3D image, respectively, suggesting that IPSF successfully recovered most of blocked signal. In the prototype SMOG experiment, the authors have successfully reconstructed a CBCT image using the IPSF-SMOG approach. The detailed geometric features in the Catphan phantom were mostly recovered according to visual evaluation. The scatter related artifacts, such as cupping artifacts, were almost completely removed. Conclusions: The IPSF-SMOG is promising in reducing scatter artifacts and improving image quality while reducing radiation dose.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2021

Crystal mechanics-based thermo-elastic constitutive modeling of orthorhombic uranium using generalized spherical harmonics and first-order bounding theories

In earlier works, a mathematical procedure for invertible microstructure-property linkages was developed using computationally efficient spectral methods for polycrystalline cubic and hexagonal metals. This paper formulates such invertible microstructure–property linkages for orthorhombic polycrystalline metals relying on the generalized spherical harmonics (GSH) spectral basis. The procedure is used to compute property closures of orthorhombic polycrystals. The closures represent the complete set of theoretically possible combinations of effective properties for a selected material. The procedure relies on the first-order bounding theories and considers orientation distribution functions (ODFs) as the main microstructural descriptor influencing homogenized properties. Numerous examples of these closures involving second-rank thermal expansion and fourth-rank elastic stiffness tensorial properties over a broad range of temperatures are presented for α-uranium (α-U). In doing so, certain key properties of these closures are exploited to facilitate their computation with drastically reduced computational effort. Along with the recently developed GSH-based interpolation procedure for ODFs from coarsely spaced experimental measurement grids to finely spaced finite element mesh resolution grids presented in Barrett et al., the developed computationally efficient ODF-effective property linkages are used to establish a crystal mechanics-based simulation framework coupled with the finite element method (FEM). The ODF dependent thermal expansion and elastic stiffness tensors are efficiently calculated at every integration point and used by the FEM to predict the overall distortion of a hemispherical part made of α-U during heating. In conclusion, it is shown that the developed framework can be used to simulate microstructurally heterogeneous components under thermo-mechanical loadings in a computationally efficient manner.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Integrating DOE ASCR Computing into HEPCloud through GlideinWMS

Fermilab's HEPCloud facility expands the laboratory's computing capacity by provisioning resources beyond the local grid, using GlideinWMS to deliver pilots to where experiments such as CMS and DUNE run. The High-Performance Computing (HPC) facilities of the DOE Office of Advanced Scientific Computing Research (ASCR) are a growing part of that pool. HEPCloud currently provisions NERSC over SSH, but NERSC is moving away from that path as it adopts multi-factor authentication and directs automated access to its Superfacility API and the DOE Integrated Research Infrastructure (IRI) APIs. Maintaining and extending access across the ASCR ecosystem now requires provisioning through these interfaces. This work adds new pilot submission paths to GlideinWMS for the NERSC Superfacility API, IRI, and Globus Compute. Each uses the provisioning model GlideinWMS already applies to batch resources, so experiments can run on ASCR computing resources without changes to their existing workflows. This work finally presents a comparison of the paths to guide which interfaces are best suited for different workflows.

Majumder, Meghanto [U. Houston (main)]↗
DOE OSTI2014

Non-Galerkin Coarse Grids for Algebraic Multigrid

Algebraic multigrid (AMG) is a popular and effective solver for systems of linear equations that arise from discretized partial differential equations. And while AMG has been effectively implemented on large scale parallel machines, challenges remain, especially when moving to exascale. Particularly, stencil sizes (the number of nonzeros in a row) tend to increase further down in the coarse grid hierarchy, and this growth leads to more communication. Therefore, as problem size increases and the number of levels in the hierarchy grows, the overall efficiency of the parallel AMG method decreases, sometimes dramatically. This growth in stencil size is due to the standard Galerkin coarse grid operator, $P^T A P$, where $P$ is the prolongation (i.e., interpolation) operator. For example, the coarse grid stencil size for a simple three-dimensional (3D) seven-point finite differencing approximation to diffusion can increase into the thousands on present day machines, causing an associated increase in communication costs. We therefore consider algebraically truncating coarse grid stencils to obtain a non-Galerkin coarse grid. First, the sparsity pattern of the non-Galerkin coarse grid is determined by employing a heuristic minimal “safe” pattern together with strength-of-connection ideas. Second, the nonzero entries are determined by collapsing the stencils in the Galerkin operator using traditional AMG techniques. The result is a reduction in coarse grid stencil size, overall operator complexity, and parallel AMG solve phase times.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

nnopf

SAND2026-19433O The nnopf tool addresses the optimal power flow (OPF) problem by optimizing electricity delivery from generating plants to consumers. At the same time, it minimizes costs and adheres to power grid constraints. While traditional methods for solving OPF can be computationally intensive, the tool mitigates this challenge by training neural networks on power grids to predict optimal solutions for the OPF problem. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.

Hart, William [Sandia National Lab. (SNL-CA), Live↗
DOE OSTI2023

Modeling simultaneous particle shrinkage, dissolution and breakage using the modified moving grid technique

Simultaneous shrinkage, dissolution and breakage are important particle size reduction phenomena that characterize processes like the reactive degradation of solid chemicals. The dynamics of the particle size distribution (PSD) for such processes are non-trivial to model due to the number expending processes brought about by the eventual dissolution of particles. To this end, Population Balance Model (PBM) resolved through the sectional techniques is the natural approach. Here, we introduce a modified Moving Grid technique (m-MGT) to accurately resolve the particle size reduction phenomena. Our technique mimics the perpetual particle shrinkage through a continuously left-moving size grid and incorporates a strategic grid removal routine to capture the disappearance of particles. Coupled with the Fixed Pivot (FP) discretization for breakage, our m-MGT not only preserves the moment-related properties, but also benchmarked very well against the analytical number densities and exhibited a minimum of first-order convergence in all assessed case studies.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Local Explosion Detection and Infrasound Localization by Reverse Time Migration Using 3-D Finite-Difference Wave Propagation

Infrasound data are routinely used to detect and locate volcanic and other explosions, using both arrays and single sensor networks. However, at local distances (< km) topography often complicates acoustic propagation, resulting in inaccurate acoustic travel times leading to biased source locations when assuming straight-line propagation. Here we present a new method, termed Reverse Time Migration-Finite-Difference Time Domain (RTM-FDTD), that integrates numerical modeling into the standard RTM back-projection process. Travel time information is computed across the entire potential source grid via FDTD modeling to incorporate the effects of topography. The waveforms are then back-projected and stacked at each grid point, with the stack maximum corresponding to the likely source. We apply our method to three volcanoes with different network configurations, source-receiver distances, and topography. At Yasur Volcano, Vanuatu, RTM-FDTD locates explosions within ~20 m of the source and differentiates between multiple vents. RTM-FDTD produces a more accurate location for the two Yasur subcraters than standard RTM and doubles the number of detected events. At Sakurajima Volcano, Japan, RTM-FDTD locates the source within 50 m of the active vent despite notable topographic blocking. The RTM-FDTD location is similar to that from the Time Reversal Mirror method, but is more computationally efficient. Lastly, at Shishaldin Volcano, Alaska, RTM and RTM-FDTD both produce realistic source locations (<50 m) for ground-coupled airwaves recorded on a four-station seismic network. We show that RTM is an effective method to detect and locate infrasonic sources across a variety of scenarios, and by integrating numerical modeling, RTM-FDTD produces more accurate source locations and increases the detection capability.

58 GEOSCIENCES↗
DOE OSTI2025

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

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

24 - POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Cyber-Power Co-Simulation for End-to-End Synchrophasor Network Analysis and Applications

The resiliency, reliability and security of the next generation cyber-power smart grid depend upon efficiently leveraging advanced communication and computing technologies. Also, developing real-time data-driven applications is critical to enable wide-area monitoring and control of the cyber-power grid given high-resolution data from Phasor Measurement Units (PMUs). North American Synchrophasor Initiative Network (NASPlnet) provides guidance for PMU data exchanges. With the advancement in networking and grid operation, it is necessary to evaluate the performance of different data flow architectures suggested by NASPInet and analyze the impact on applications. Therefore, we need a cyber-power co-simulation framework that supports very large-scale co-simulation capable of running in parallel, high-performance computing platforms and capturing real-life network behavior. This work presents an end-to-end automated and user-driven cyber-power co-simulation using NS3 to model communication networks, GridPACK to model the power grid, and HELICS as a co-simulation engine. Comparative analysis of latency in synchrophasor networks and a performance evaluation of a power system stabilizer application utilizing PMU data in an IEEE 39 bus test system is presented using this cosimulation testbed.

Mustafa, Hussain M.↗
DOE OSTI2019

An Efficient, Globally Convergent Method for Optimization Under Uncertainty Using Adaptive Model Reduction and Sparse Grids

We present a new approach to efficiently solve optimization problems constrained by partial differential equations (PDEs) with uncertain coefficients. The method leverages two sources of inexactness that trade accuracy for speed: (1) stochastic collocation based on dimension-adaptive sparse grids (SGs), which approximates the stochastic objective function with a limited number of quadrature nodes, and (2) projection-based reduced-order models (ROMs), which generate efficient approximations to PDE solutions. These two sources of inexactness lead to inexact objective function and gradient evaluations, which are managed by a trust-region method that guarantees global convergence by adaptively refining the SG and ROM until a proposed error indicator drops below a tolerance specified by trust-region convergence theory. A key feature of the proposed method is that the error indicator---which accounts for errors incurred by both the SG and ROM---must be only an asymptotic error bound, i.e., a bound that holds up to an arbitrary constant that need not be computed. This allows the approach to be applicable to a wide range of problems, including those where sharp, computable error bounds are not available; this distinguishes the proposed method from previous works. Numerical experiments performed on a model problem from optimal flow control under uncertainty verify global convergence of the method and demonstrate the method's ability to outperform previously proposed alternatives.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

A procedure for the estimation of the numerical uncertainty of CFD calculations based on grid refinement studies

This paper offers a procedure for the estimation of the numerical uncertainty of any integral or local flow quantity as a result of a fluid flow computation; the procedure requires solutions on systematically refined grids. The error is estimated with power series expansions as a function of the typical cell size. These expansions, of which four types are used, are fitted to the data in the least-squares sense. The selection of the best error estimate is based on the standard deviation of the fits. The error estimate is converted into an uncertainty with a safety factor that depends on the observed order of grid convergence and on the standard deviation of the fit. For well-behaved data sets, i.e. monotonic convergence with the expected observed order of grid convergence and no scatter in the data, the method reduces to the well known Grid Convergence Index. Examples of application of the procedure are included. - Highlights: • Estimation of the numerical uncertainty of any integral or local flow quantity. • Least squares fits to power series expansions to handle noisy data. • Excellent results obtained for manufactured solutions. • Consistent results obtained for practical CFD calculations. • Reduces to the well known Grid Convergence Index for well-behaved data sets.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Efficient Temperature-Dependent Green’s Functions Methods for Realistic Systems: Compact Grids for Orthogonal Polynomial Transforms

The Matsubara Green’s function that is used to describe temperature-dependent behavior is expressed on a numerical grid. While such a grid usually has a couple of hundred points for low-energy model systems, for realistic systems with large basis sets the size of an accurate grid can be tens of thousands of points, constituting a severe computational and memory bottleneck. In this paper, we determine efficient imaginary time grids for the temperature-dependent Matsubara Green’s function formalism that can be used for calculations on realistic systems. Here we show that, because of the use of an orthogonal polynomial transform, we can restrict the imaginary time grid to a few hundred points and reach micro-Hartree accuracy in the electronic energy evaluation. Moreover, we show that only a limited number of orthogonal polynomial expansion coefficients are necessary to preserve accuracy when working with a dual representation of the Green’s function or self-energy and transforming between the imaginary time and frequency domain.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

A Real-Time Implementation and Validation of Federated Learning for Grid Services

Grid-edge devices are becoming increasingly important in the energy transition. Preserving privacy was not previously considered an important aspect for power grid operations, but with the increased proliferation of customer-owned assets, it is now an essential consideration. Several mechanisms have been proposed to provide privacy for non-utility owned assets in the power grid. Federated learning (FL) is one method gaining prominence in this area. Although FL has been used for other applications, such as auto-complete in phones, there has not been much investigation into whether these approaches are feasible for grid applications. In this work, we use a research platform with real-time simulators and hardware-in-the-loop capabilities to investigate how FL can be applied to grid-edge devices, and we present the potential grid services that can be derived for these devices. We discuss the computational challenges with deploying complex FL approaches, and we explore several grid services, including participation in retail electricity markets, voltage control, and resilience-driven reconfiguration.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

Ab Initio Computation of Rotationally-Averaged Pump–Probe X-ray and Electron Diffraction Signals

We develop a new algorithm for the computation of the rotationally averaged elastic molecular diffraction signal for the cases of perpendicular or parallel pump–probe geometries. The algorithm first collocates the charge density from an arbitrary ab initio wave function onto a Becke quadrature grid [A. Becke, J. Chem. Phys. 1988, 88, 2457], providing a high-fidelity multiresolution representation of the charge density. A double sum is then performed over the Becke grid points, and the interaction between points computed using the scattering kernels of Williamson and Zewail [J. C. Williamson and A. H. Zewail, J. Phys. Chem. 1994, 98, 2766]. These kernels analytically average over the molecular orientations with the cos 2 γ selection factor appropriate for one-photon dipole absorption in a perpendicular pump–probe geometry. We demonstrate that the method is converged with small grids containing <500 points/atom. We implement the algorithm on a GPU for increased efficiency and emonstrate the algorithm for molecules with up to a few dozen atoms. We explore the accuracy of the independent atom model (IAM) by comparison with our new and more accurate method. We also investigate the possibility of detecting signatures of electronic transitions in polyatomic pump–probe diffraction experiments.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗