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 1,297 records · Page 72

On Two Algorithms of Wavelet Decomposition for Spaces of Linear Splines

The purpose of this paper is to construct new types of wavelets for minimal splines on an irregular grid. The approach applied to construct spline-wavelet decompositions uses approximation relations as an initial structure for constructing the spaces of minimal splines. The advantages of this approach are the possibilities of using irregular grids and sufficiently arbitrary nonpolynomial spline-wavelets.

97 MATHEMATICS AND COMPUTING↗

A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective

An optimization algorithm for nonsmooth nonconvex constrained optimization problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objective functions is proposed and analyzed. Upper- \({\boldsymbol{\mathcal{C}^2}}\) is a weakly concave property that exists in difference of convex (DC) functions and arises naturally in many applications, particularly certain classes of solutions to parametric optimization problems e.g., recourse of stochastic programming and projection onto closed sets. The algorithm can be viewed as an extension of sequential quadratic programming (SQP) to nonsmooth problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objectives or a simplified bundle method. It is globally convergent with bounded algorithm parameters that are updated with a trust-region criterion. The algorithm handles general smooth constraints through linearization and uses a line search to ensure progress. The potential inconsistencies from the linearization of the constraints are addressed through a penalty method. In conclusion, the capabilities of the algorithm are demonstrated by solving both simple upper- \({\boldsymbol{\mathcal{C}^2}}\) problems and a real-world optimal power flow problem used in current power grid industry practices.

97 MATHEMATICS AND COMPUTING↗

Structure Learning and Statistical Estimation in Distribution Networks - Part I

Traditionally power distribution networks are either not observable or only partially observable. This complicates development and implementation of new smart grid technologies, such as those related to demand response, outage detection and management, and improved load-monitoring. In this two part paper, inspired by proliferation of the metering technology, we discuss estimation problems in structurally loopy but operationally radial distribution grids from measurements, e.g. voltage data, which are either already available or can be made available with a relatively minor investment. In Part I, the objective is to learn the operational layout of the grid. Part II of this paper presents algorithms that estimate load statistics or line parameters in addition to learning the grid structure. Further, Part II discusses the problem of structure estimation for systems with incomplete measurement sets. Our newly suggested algorithms apply to a wide range of realistic scenarios. The algorithms are also computationally efficient – polynomial in time– which is proven theoretically and illustrated computationally on a number of test cases. The technique developed can be applied to detect line failures in real time as well as to understand the scope of possible adversarial attacks on the grid.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A sixth order Mehrstellen scheme with an application to the Method of Local Corrections for the 3D Poisson equation

We present a sixth order finite difference scheme for Poisson’s equation when discretized with the compact 27-point stencil based on Mehrstellen corrections of the forcing function term f. Our approach results in a sixth order accurate solution error as opposed to a fourth-order error imposed by the classical Mehrstellen correction for the 19-point and 27-point stencils. The present study is a continuation of former work of Spotz and Carey (1996) on compact finite difference schemes for Poisson’s equation where sixth order convergence may be obtained under the assumption that the fourth order derivatives of f are determined analytically. Specifically, we show that sixth order convergence can still be attained when only values of f at grid points are available. The sixth order Mehrstellen scheme is further coupled with a Method of Local Corrections (MLC) 3D Poisson solver improving to sixth order accuracy the results reported in Kavouklis and Colella (2019). The MLC test case considered involves an adaptive grid that comprises 7.5 billion cells.

97 MATHEMATICS AND COMPUTING↗

Cyber Resilient Design and Controls for Energy Systems

As the grid of today is evolving into a highly distributed and autonomous cyber-physical system with higher penetration of Distributed Energy Resources (DERs) and autonomous controls that are dependent on the cyber infrastructure, there are novel and increasing challenges to cyber-resilient operation of the grid. While the traditional mechanisms take a "bolt on" approach to cybersecurity and resiliency, this talk presents two novel technologies developed at NREL that "bake in" security and resilience into the design and control of the grid. An Adaptive Resilience Metrics framework is a novel mechanism for system owners and operators to understand the impact of cyber and physical system design and topology on the resilient operation, while also helping determine optimal policies in response to adverse cyber events. Along with that a zero-knowledge proof-based technique helps incorporate security into the controls layer by focusing on computational integrity rather than data integrity. By leveraging design and control properties unique to Operational Technology systems these technologies will not only help enhance cyber-resilience for the grid of today, but a highly distributed and autonomous grid of tomorrow.

cyber resilience↗

Electric Distribution System Planning with DERs - High-level Assessment of Tools and Methods

This document addresses analytical tools and methods to support electric distribution system planning with distributed energy resources (DERs) and grid modernization, drawing on leading-edge research and examples from around the United States. In this report, tools include computer models and software, as well as other analytical aids and practices that support distribution system planning. At its core, distribution system planning is about supporting investment decisions. Enhanced and integrated distribution system planning allows utilities to move from a passive reactive role to smart proactive planning with respect to DERs. Distribution system planning can increase transparency around utility distribution system investments before they are brought to the regulatory body for cost recovery, can support deferring traditional infrastructure investments, and can provide information and incentives to customers and third parties about where DERs can help the grid. A growing number of states are beginning to consider a comprehensive distribution system planning process that addresses the costs and benefits of DERs, reflects more choices coming from the customer/third-party domains, is integrated with resource and transmission planning, and incorporates planning scenarios that reflect the dynamic and changing nature of the electricity system

24 POWER TRANSMISSION AND DISTRIBUTION↗

Big Data, Big Solutions

Data—lots of data—generated in seconds and piling up on the internet, streaming and stored in countless databases. Big data is important for commerce, society and our nation’s security. Yet the volume, velocity, variety and veracity of data is simply too great for any single analyst to make sense of alone. It requires advanced, data-intensive computing. Simply put, data-intensive computing is the use of sophisticated computers to sort through mounds of information and present analysts with solutions in the form of graphics, scenarios, formulas, new hypotheses and more. This scientific capability is foundational to PNNL’s energy, environment and security missions. Senior Scientist and Division Director Bill Pike and his team are developing analytic tools that are used to solve important national challenges, including cyber systems defense, power grid control systems, intelligence analysis, climate change and scientific exploration.

97 MATHEMATICS AND COMPUTING↗

A conservative phase-space moving-grid strategy for a 1D-2V Vlasov–Fokker–Planck Solver

In this work, we develop a conservative configuration- and velocity-space (i.e., phase-space) moving-grid strategy for the Vlasov–Fokker–Planck (VFP) equation in a planar geometry. The velocity-space grid is normalized and shifted in terms of the thermal speed and the bulk-fluid velocity, respectively. The configuration-space grid is moved according to a mesh-motion-partial-differential equation (MMPDE), which equidistributes a monitor function that is inversely proportional to the gradient-length scales of the macroscopic plasma quantities. The resulting inertial terms in the transformed VFP equations are discretized to ensure the discrete conservation of mass, momentum, and energy. To satisfy the discrete conservation theorems in the presence of phase-space mesh motion, we employ the method of discrete nonlinear constraints – explored in previous studies – but the underlying symmetries are determined in a much more efficient manner than before. The conservative grid-adaptivity strategy provides an efficient scheme that resolves important physical structures in the phase-space while controlling the computational complexity at all times. We demonstrate the favorable features of the proposed algorithm through a set of test cases of increasing complexity. The problems test independent components of the algorithms, as well as the integrated capability on settings relevant to inertial confinement fusion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An improved multilevel Monte Carlo method for estimating probability distribution functions in stochastic oil reservoir simulations

In this paper, we develop an improved multilevel Monte Carlo (MLMC) method for estimating cumulative distribution functions (CDFs) of a quantity of interest, coming from numerical approximation of large-scale stochastic subsurface simulations. Compared with Monte Carlo (MC) methods, that require a significantly large number of high-fidelity model executions to achieve a prescribed accuracy when computing statistical expectations, MLMC methods were originally proposed to significantly reduce the computational cost with the use of multifidelity approximations. The improved performance of the MLMC methods depends strongly on the decay of the variance of the integrand as the level increases. However, the main challenge in estimating CDFs is that the integrand is a discontinuous indicator function whose variance decays slowly. To address this difficult task, we approximate the integrand using a smoothing function that accelerates the decay of the variance. In addition, we design a novel a posteriori optimization strategy to calibrate the smoothing function, so as to balance the computational gain and the approximation error. The combined proposed techniques are integrated into a very general and practical algorithm that can be applied to a wide range of subsurface problems for high-dimensional uncertainty quantification, such as a fine-grid oil reservoir model considered in this effort. The numerical results reveal that with the use of the calibrated smoothing function, the improved MLMC technique significantly reduces the computational complexity compared to the standard MC approach. Finally, we discuss several factors that affect the performance of the MLMC method and provide guidance for effective and efficient usage in practice.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An adaptive, conservative 0D-2V multispecies Rosenbluth–Fokker–Planck solver for arbitrarily disparate mass and temperature regimes

In this paper, we propose an adaptive velocity-space discretization scheme for the multi-species, multidimensional Rosenbluth–Fokker–Planck (RFP) equation, which is exactly mass-, momentum-, and energy-conserving. Unlike most earlier studies, our approach normalizes the velocity-space coordinate to the temporally varying individual plasma species' local thermal velocity, v th (t), and explicitly considers the resulting inertial terms in the Fokker–Planck equation. Our conservation strategy employs nonlinear constraints to enforce discretely the conservation properties of these inertial terms and the Fokker–Planck collision operator. To deal with situations of extreme thermal velocity disparities among different species, we employ an asymptotic v th -ratio-based expansion of the Rosenbluth potentials that only requires the computation of several velocity-space integrals. Numerical examples demonstrate the favorable efficiency and accuracy properties of the scheme. Specifically, we show that the combined use of the velocity-grid adaptivity and asymptotic expansions delivers many orders-of-magnitude savings in mesh resolution requirements compared to a single, static uniform mesh.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Automated Quantitative Analysis of Extended Irradiation Defects - Dislocations, Voids and Precipitates in Neutron Irradiated HT-9 Steel

Structural alloys that make up the core components of nuclear reactors are exposed to radiation that can substantially alter the microstructure and mechanical properties of the material. Irradiation can cause the formation of extended defects including dislocation line and loops, voids and various types of precipitates. To understand the irradiation effects, it is critical to characterize these defects individually and collectively to quantify how they evolve throughout irradiation stages. Transmission electron microscopy (TEM) is a standard tool for providing extensive size, number density and spatial distribution of extended irradiation defects, however, manual measurement of defect size and number density requires time-intensive effort to analyze enough defects that provide a statistically meaningful result and are prone to errors of subjectivity. In this work, we developed a set of MATLAB algorithms offering robust and automated identification and quantification of extended irradiation defects like dislocation lines, voids and precipitates commonly observed in neutron irradiated cladding alloys [1]. Using a neutron-irradiated HT-9 martensitic alloy irradiated at 412°C to 111.8 dpa, we demonstrate the capability of these algorithms for quantitative defect analysis. Figure 1 presents defect images of the HT-9 using an advanced diffraction contrast imaging scanning transmission electron microscopy (DCI STEM) that suppresses bend contours and provides better defect contrast compared to conventional TEM [2]. The first step of defect analysis is defect identification, a process that can be digitally achieved by contrast thresholding (for simple defect contrast) and by machine learning computer vision for defect semantic segmentation [3]. Here, labeled binary defect images (Figures 2a and 2c) were used. For dislocation density quantification, we employed an optimized circular-grid intersection method first introduced by Dr. John Steeds [4]. This method is shown in Figures 2a and 2b, where the number of intersections of dislocation lines with circular traces was measured. This produces an unbiased sampling of dislocation lines, regardless of their orientation. This process was optimized with automated digital intersection number and grid length registration. Interestingly, it was found that a relatively large number of circles in a set circular gird is was needed to produce an invariant result (Figure 2b), with a low systematic measurement error. This demonstrates the main advantage of computer-based defect analysis, in performing repetitive operations quickly with a reduced systematic error. For the quantitative analysis of voids and precipitates a challenge encountered with automated defect analysis is feature overlap, particularly when the density of voids/precipitates is high. To mitigate this problem, as shown in Figure 2d, we modified the popular circular Hough transformation and treated ‘circular shape’ as the particle descriptor for voids/precipitates, efficiently resolving the overlapping particles. In summary, this automated digital quantification together with machine learning enabled defect identification [3] opens new opportunities for standardizing the characterization workflow for quantitative analysis of extended irradiation defects.

Sainju, Rajat↗

A moving discontinuous Galerkin finite element method with interface condition enforcement for compressible flows

A variation of moving discontinuous Galerkin finite element method with interface condition enforcement (MDG-ICE) is developed for solving the compressible Euler equations. The MDG-ICE method, originating from the work of Corrigan et al. [1], [2], [3], [4], is based on the space-time DG formulation, where both flow field and grid geometry are considered as independent variables and the conservation laws are enforced both on discrete elements and element interfaces. The element conservation laws are solved in the standard discontinuous solution space to determine conservative quantities, while the interface conservation is enforced using a variational formulation in a continuous space to determine discrete grid geometry. The resulting over-determined system of nonlinear equations arising from the MDG-ICE formulation can then be solved in a least-squares sense, leading to an unconstrained nonlinear least-squares problem that is regularized and solved by Levenberg-Marquardt method. A number of numerical experiments for both 1D unsteady and 2D steady state compressible flow problems are conducted to assess the accuracy and robustness of the MDG-ICE method. Numerical results obtained indicate that the MDG-ICE method is able to implicitly detect and track all types of discontinuities via interface conservation enforcement and satisfy the conservation law on both elements and interfaces via grid movement and grid management, demonstrating that an exponential rate of convergence for Sod and Lax-Harden shock tube problems can be achieved and highly accurate solutions without overheating to both double-rarefaction wave and Noh problems can be obtained.

97 MATHEMATICS AND COMPUTING↗

Quantum Computing in Next-Generation Transportation Optimization

We explore how quantum computing (QC) can advance transportation optimization, with a focus on two high-impact areas: traffic signal control and vehicle electrification with grid integration. As transportation systems grow in complexity, classical optimization methods increasingly struggle to deliver scalable and efficient solutions, particularly for real-time, data-rich environments. This work identifies key challenges within these two domains where QC may offer advantages, particularly in handling combinatorial decision spaces and dynamic constraints. We begin by outlining the limitations of classical approaches for traffic signal control optimization and electric vehicle charging coordination, highlighting where computational limitations arise. Previous quantum formulations are presented and new formulations are proposed to demonstrate how emerging quantum algorithms, including quantum annealing and the Quantum Approximation Optimization Algorithm, could be leveraged to reformulate and address these problems. We also evaluate the suitability of current quantum hardware and discuss recent trends that indicate when QC may become a viable tool for transportation applications. While acknowledging the present limitations of QC technologies, this poster emphasizes the importance of preparing quantum-compatible models today. By reviewing and establishing formulations that align with the strengths of quantum algorithms, researchers and practitioners can better position themselves to take advantage of QC advancements as they occur. This work aims to provide a practical, forward-looking perspective on the near-term potential of quantum computing in transportation optimization.

33 ADVANCED PROPULSION SYSTEMS↗

Development of Real-Time High-Density Pulsar Data Transmission and Processing for Grid Synchronization

Taking advantage of the extreme stability of the pulsar period, it can serve as the timing source for grid synchronization to compensate for the timing drift instigated by the loss of GPS signal. Nevertheless, the real-time transmission and processing of the pulsar data suffer from its high-frequency data rate, varying from megahertz to gigahertz, resulting in reduced computing speed and increased time delay. To mitigate this issue, the hardware and software frameworks are implemented for the high-density pulsar data transmission and processing for grid synchronization in this research. Initially, the high-density pulsar data is transferred using open-source software. The complementary duty cycle timing module is designed to coordinate the operation of the dual-channel high-speed interface and software. Subsequently, the multiple-threading is applied to the receiving, parsing, and splicing pulsar data. Next, the pulsar signal extraction method is implemented based on the polyphase filterbank and time of arrival estimation. Ultimately, real-time performance verification experiments are carried out for different components under two hardware platforms. Finally, the results demonstrate that only 0.482 s is required for processing 4 Gigabyte data through multiple-threading, which is 3.8 times faster than the single thread. The pulsar signal extraction can also be executed within 707 ms for 4.8 seconds of data, thereby indicating that real-time requirements can be met.

24 POWER TRANSMISSION AND DISTRIBUTION↗

High Performance Computing Peak Shaving for Microreactor Operation

There are multiple nuclear microreactors currently under development that are designed to provide autonomous power for as many as ten or more years without refueling and are designed to power high performance computing (HPC) datacenters. But the load-follow speeds for a nuclear microreactor will be much slower than grid power and slower than the power variance typical of a HPC system. HPC datacenters experience peak power load variance driven by several factors ranging from the operation of cooling systems to remove heat from the servers to supporting a wide range of user application workflows and architectures each with different power signatures. One mechanism to support the limited load-follow of a microreactor is peak shaving where an energy storage mechanism is used to shed peak load and reduce significant power variance. This work explores peak electrical load shaving using uninterruptible power supply (UPS) systems designed for HPC support in the context of peak shaving when operating using a nuclear microreactor with a load-follow limited to 10% of load per minute. Using a self contained HPC datacenter complete with stand-alone cooling system and provisioned with an x86 cluster, an ARM cluster, and a graphics processing unit (GPU) cluster, peak shaving for microreactor operation using the UPS battery backup is explored while running two classes of typical HPC user applications. HPC architecture suitability for microreactor operation under this type of peak shaving is examined.

97 MATHEMATICS AND COMPUTING↗

Solving Unit Commitment Problems with Demand Responsive Loads

This work focuses on using variations of the Frank-Wolfe (FW) algorithm for solving unit commitment problems with high volumes of demand responsive loads on the power grid. We present a formulation of the unit commitment problem with demand responsive loads. We then show through reformulation and relaxations of the problem that variations of the Frank-Wolfe algorithm can be used to determine the time series decisions for the demand responsive loads. We show through computational experiments on the IEEE Reliability Test System that the timeseries of demand responsive load decisions obtained through our approach are near optimal and describe how large-scale parallel implementations of our approach can be highly computationally efficient.

demand response↗

Time-Domain Modeling of RF Antennas and Plasma-Surface Interactions

Recent advances in finite-difference time-domain (FDTD) modeling techniques allow plasma-surface interactions such as sheath formation and sputtering to be modeled concurrently with the physics of antenna near- and far-field behavior and ICRF power flow. Although typical sheath length scales (micrometers) are much smaller than the wavelengths of fast (tens of cm) and slow (millimeter) waves excited by the antenna, sheath behavior near plasma-facing antenna components can be represented by a sub-grid kinetic sheath boundary condition, from which RF-rectified sheath potential variation over the surface is computed as a function of current flow and local plasma parameters near the wall. These local time-varying sheath potentials can then be used, in tandem with particle-in-cell (PIC) models of the edge plasma, to study sputtering effects. Particle strike energies at the wall can be computed more accurately, consistent with their passage through the known potential of the sheath, such that correspondingly increased accuracy of sputtering yields and heat/particle fluxes to antenna surfaces is obtained. The new simulation capabilities enable time-domain modeling of plasma-surface interactions and ICRF physics in realistic experimental configurations at unprecedented spatial resolution. We will present results/animations from high-performance (10k-100k core) FDTD/PIC simulations of Alcator C-Mod antenna operation.

47 OTHER INSTRUMENTATION↗

Simplified Transactive Distribution Grids for Bulk Power System Mechanism Development

As distributed energy resources and smart devices become omnipresent in the electrical power grid, transactive energy control mechanisms are evolving. From real-time to day-ahead markets, these transactive energy algorithms involve more and more agents, whose behavior is going to affect the transmission and generation network. In order to study the interaction between the wholesale and retail energy markets, extensive co-simulations are performed. To be able to redesign, evaluate, and verify new control algorithms, the simulations need to provide results in a fast and reliable manner. This work has built and tested a transactive distribution grid model, the DSO-Stub, meant to offer a configurable distribution retail market while ensuring the computational burden is not significantly increased.

Transactive Energy, , Distribution System Operator↗