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,171 records · Page 65
All sourcesNASA NTRSDOE OSTI
DOE OSTI2014

Compiler generation and autotuning of communication-avoiding operators for geometric multigrid

This paper describes a compiler approach to introducing communication-avoiding optimizations in geometric multigrid (GMG), one of the most popular methods for solving partial differential equations. Communication-avoiding optimizations reduce vertical communication through the memory hierarchy and horizontal communication across processes or threads, usually at the expense of introducing redundant computation. We focus on applying these optimizations to the smooth operator, which successively reduces the error and accounts for the largest fraction of the GMG execution time. Our compiler technology applies both novel and known transformations to derive an implementation comparable to manually-tuned code. To make the approach portable, an underlying autotuning system explores the tradeoff between reduced communication and increased computation, as well as tradeoffs in threading schemes, to automatically identify the best implementation for a particular architecture and at each computation phase. Results show that we are able to quadruple the performance of the smooth operation on the finest grids while attaining performance within 94% of manually-tuned code. Overall we improve the overall multigrid solve time by 2.5× without sacrificing programer productivity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Development of a Multiphase Adjoint Capability in OpenFOAM

Thermal hydraulic predictions of flow regimes within nuclear reactor cores require significant computational resources and accuracy to ensure that the core design does not violate the thermal limits of materials. Multiphase computational fluid dynamics (CFD) has become a valuable computational capability for predicting flow characteristics as they relate to applications such as nuclear reactor safety and mixing phenomena around spacer grids within fuel assemblies. Multiphase CFD requires closure relationships for both the effects of turbulence as well as the transfer of mass, momentum, and energy between phases. Understanding the sensitivity of the parameters used in closure relationships is important for improving accuracy, but performing rigorous sensitivity analysis is computationally expensive. Adjoint mathematics have been utilized for reactor physics and fluid dynamics applications with respect to verification, sensitivity analysis, adaptive mesh refinement, and optimization. The usage of adjoint methods to predict the sensitivities of a variety of closure relationship parameters within a given problem has been shown to return sensitivity responses with significantly fewer computations than normal 'large-scale' methods. As the complexity of multiphase CFD methods increases, the demand for accurate verification tools and improvements in computational efficiency also increases, making the development of adjoint capabilities an attractive option. Closure relationships that describe interphase momentum physics in multiphase CFD modelling rely heavily on prescribed constants determined from experimental data. Due to the computational efficiency of an adjoint approach, the time to derive these closure relationships could be dramatically reduced, and data assimilation techniques could be used to return probability density functions of closure models derived using experimental data. This work develops a multiphase adjoint capability for the Eulerian-Eulerian two field, two phase equations. Specifically, the adjoint capability has been developed for the sub-cooled nucleate boiling solver boilEulerFoam developed by Dr. Nam Dinh of NC State University within the open-source CFD library OpenFOAM.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Quantum computation of stopping power for inertial fusion target design

Stopping power is the rate at which a material absorbs the kinetic energy of a charged particle passing through it—one of many properties needed over a wide range of thermodynamic conditions in modeling inertial fusion implosions. First-principles stopping calculations are classically challenging because they involve the dynamics of large electronic systems far from equilibrium, with accuracies that are particularly difficult to constrain and assess in the warm-dense conditions preceding ignition. Here, we describe a protocol for using a fault-tolerant quantum computer to calculate stopping power from a first-quantized representation of the electrons and projectile. Our approach builds upon the electronic structure block encodings of Su et al. [ PRX Quant. 2 , 040332 (2021)], adapting and optimizing those algorithms to estimate observables of interest from the non-Born–Oppenheimer dynamics of multiple particle species at finite temperature. We also work out the constant factors associated with an implementation of a high-order Trotter approach to simulating a grid representation of these systems. Ultimately, we report logical qubit requirements and leading-order Toffoli costs for computing the stopping power of various projectile/target combinations relevant to interpreting and designing inertial fusion experiments. We estimate that scientifically interesting and classically intractable stopping power calculations can be quantum simulated with roughly the same number of logical qubits and about one hundred times more Toffoli gates than is required for state-of-the-art quantum simulations of industrially relevant molecules such as FeMoco or P450.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Simulation of gas mixture dynamics in a pipeline network using explicit staggered-grid discretization

Here we develop an explicit staggered finite difference discretization scheme for simulating the transport of highly heterogeneous gas mixtures through pipeline networks. This study is motivated by the proposed blending of hydrogen into natural gas pipelines to reduce end use carbon emissions while using existing pipeline systems throughout their planned lifetimes. Our computational method accommodates an arbitrary number of constituent gases with very different physical properties that may be injected into a network with significant spatiotemporal variation. In this setting, the gas flow physics are highly location- and time- dependent, so that local composition and nodal mixing must be accounted for. The resulting conservation laws are formulated in terms of pressure, partial densities and flows, and volumetric and mass fractions of the constituents. We include non-ideal equations of state that employ linear approximations of gas compressibility factors, so that the pressure dynamics propagate locally according to a variable wave speed that depends on mixture composition and density. We derive compatibility relationships for network edge boundary values that are more complex than for a homogeneous gas. The simulation method is evaluated on initial boundary value problems for a single pipe and a small network, is cross-validated with a lumped element simulation, and used to demonstrate a local monitoring and control policy for maintaining allowable concentration levels.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Investigation of grid-based vorticity-velocity large eddy simulation off-body solvers for application to overset CFD

Accurately predicting unsteady wakes and vortex-dominated flows is essential to a wide range of engineering applications, including aircraft, rotorcraft, shipboard operations, bio-inspired unsteady flight and propulsion, wind turbines, and urban flows. While current CFD software can model the complete flow field and wake system, the computational costs incurred in high Reynolds number unsteady turbulent flow simulations often remain prohibitive for routine engineering use, particularly for applications involving moving components. Prior work has demonstrated that by adopting a vorticity-velocity formulation in a grid-based off-body flow solver (VorTran-M and VorTran-M2) one can lower these costs by several orders of magnitude when compared to conventional approaches. This paper describes the extensions made to VorTran-M2 to support turbulent flows, and associated benchmarking activity to assess its performance for problems involving strong stretching and diffusion processes, whose competing contributions to the vorticity field are core drivers of turbulent flow evolution. Predictions are presented for: (i) the Kida-Pelz problem whose inviscid form is of mathematical interest due to its apparent formation of singular flow in finite time; and (ii) the Taylor Green vortex arrangement, which has been extensively studied as a fundamental simulation challenge in the turbulent modeling community. Here, the results are used to evaluate the overall predictive ability and performance of two sub-grid scale models incorporated into VorTran-M2. Results indicate that the computational cost savings seen previously for inviscid and convection dominated problems extend to turbulent flow simulations supporting the viability of VorTran-M2 as a low cost means for accurately modeling the far-field and background flow, particularly when long duration vorticity evolution is of interest.

42 ENGINEERING↗
DOE OSTI2014

Sub-Second Parallel State Estimation

This report describes the performance of Pacific Northwest National Laboratory (PNNL) sub-second parallel state estimation (PSE) tool using the utility data from the Bonneville Power Administrative (BPA) and discusses the benefits of the fast computational speed for power system applications. The test data were provided by BPA. They are two-days’ worth of hourly snapshots that include power system data and measurement sets in a commercial tool format. These data are extracted out from the commercial tool box and fed into the PSE tool. With the help of advanced solvers, the PSE tool is able to solve each BPA hourly state estimation problem within one second, which is more than 10 times faster than today’s commercial tool. This improved computational performance can help increase the reliability value of state estimation in many aspects: (1) the shorter the time required for execution of state estimation, the more time remains for operators to take appropriate actions, and/or to apply automatic or manual corrective control actions. This increases the chances of arresting or mitigating the impact of cascading failures; (2) the SE can be executed multiple times within time allowance. Therefore, the robustness of SE can be enhanced by repeating the execution of the SE with adaptive adjustments, including removing bad data and/or adjusting different initial conditions to compute a better estimate within the same time as a traditional state estimator’s single estimate. There are other benefits with the sub-second SE, such as that the PSE results can potentially be used in local and/or wide-area automatic corrective control actions that are currently dependent on raw measurements to minimize the impact of bad measurements, and provides opportunities to enhance the power grid reliability and efficiency. PSE also can enable other advanced tools that rely on SE outputs and could be used to further improve operators’ actions and automated controls to mitigate effects of severe events on the grid. The power grid continues to grow and the number of measurements is increasing at an accelerated rate due to the variety of smart grid devices being introduced. A parallel state estimation implementation will have better performance than traditional, sequential state estimation by utilizing the power of high performance computing (HPC). This increased performance positions parallel state estimators as valuable tools for operating the increasingly more complex power grid.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Operator Insights and Usability Evaluation of Machine Learning Assistance for Power Grid Contingency Analysis

Introducing machine learning (ML) assistance into any established process comes with adoption barriers, including entrenched procedures, technological and human readiness levels, human-machine trust, and work culture resistance to change. These barriers are even greater in critical operations such as operating a national or regional power grid, in which both regulatory frameworks and the importance of maintaining reliability levels causes additional resistance to the adoption of new computational support. Developers of future systems and job aides must consider not only technical aspects, but also whether new systems are usable by power system operators. This work presents the methodology and results of a study to evaluate the usability and readiness of a prototype recommender system for power grid contingency analysis. We explore operator cognitive load and evaluate operator performance when solving a collection of scenarios both with and without recommender assistance. We also examine operator trust in the system. We report insights gained on the readiness of the system using a collection of evaluation techniques.

Human-Machine Teaming, Power Systems, usability ev↗
DOE OSTI2014

Estimating uncertainties in statistics computed from direct numerical simulation

Rigorous assessment of uncertainty is crucial to the utility of direct numerical simulation (DNS) results. Uncertainties in the computed statistics arise from two sources: finite statistical sampling and the discretization of the Navier–Stokes equations. Due to the presence of non-trivial sampling error, standard techniques for estimating discretization error (such as Richardson extrapolation) fail or are unreliable. This work provides a systematic and unified approach for estimating these errors. First, a sampling error estimator that accounts for correlation in the input data is developed. Then, this sampling error estimate is used as part of a Bayesian extension of Richardson extrapolation in order to characterize the discretization error. These methods are tested using the Lorenz equations and are shown to perform well. These techniques are then used to investigate the sampling and discretization errors in the DNS of a wall-bounded turbulent flow at Reτ ≈ 180. Both small (Lx/δ × Lz/δ = 4π × 2π) and large (Lx/δ × Lz/δ = 12π × 4π) domain sizes are investigated. For each case, a sequence of meshes was generated by first designing a “nominal” mesh using standard heuristics for wall-bounded simulations. These nominal meshes were then coarsened to generate a sequence of grid resolutions appropriate for the Bayesian Richardson extrapolation method. In addition, the small box case is computationally inexpensive enough to allow simulation on a finer mesh, enabling the results of the extrapolation to be validated in a weak sense. For both cases, it is found that while the sampling uncertainty is large enough to make the order of accuracy difficult to determine, the estimated discretization errors are quite small. This indicates that the commonly used heuristics provide adequate resolution for this class of problems. However, it is also found that, for some quantities, the discretization error is not small relative to sampling error, indicating that the conventional wisdom that sampling error dominates discretization error for this class of simulations needs to be reevaluated.

Oliver, Todd A.↗
DOE OSTI2015

Postprocessing Mixed Finite Element Methods For Solving Cahn–Hilliard Equation: Methods and Error Analysis

A postprocessing technique for mixed finite element methods for the Cahn-Hilliard equation is developed and analyzed. Once the mixed finite element approximations have been computed at a fixed time on the coarser mesh, the approximations are postprocessed by solving two decoupled Poisson equations in an enriched finite element space (either on a finer grid or a higher-order space) for which many fast Poisson solvers can be applied. The nonlinear iteration is only applied to a much smaller size problem and the computational cost using Newton and direct solvers is negligible compared with the cost of the linear problem. The analysis presented here shows that this technique remains the optimal rate of convergence for both the concentration and the chemical potential approximations. The corresponding error estimate obtained in our paper, especially the negative norm error estimates, are non-trivial and different with the existing results in the literatures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Hardware-in-the-Loop (HIL) Simulations for Smart Grid Impact Studies: Preprint

Hardware-in-the-loop (HIL) simulation is increasingly employed in power engineering as more inverter-based generation and smart appliances are connected to the electric grid. HIL techniques allow for co-simulation of analytical models with actual devices whose complex behavior is computationally inefficient or difficult to capture. It also allows for testing of the behavior of these devices under adverse conditions that only occur rarely in the field, but that are important to evaluate. An overview of how HIL simulation has been used to date is provided. This paper further proposes that HIL simulation should play an important role in evaluating new control strategies, especially at the distribution level, that are being proposed to allow for continued affordable and reliable operation of the electric grid with the introduction of these new technologies. It presents a new capability that was developed to enable evaluation of interactions between residential loads and the smart grid: smart home hardware-in-the-loop. The paper includes results from an HIL simulation that incorporates multiple technologies and controls.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Satellite Embedding-Based Population Imputation for Areas with Missing Building Footprint Data: A Computer Vision-Based Approach

High-resolution population modeling is important for supporting effective decision-making across diverse sectors. LandScan Mosaic generates population estimates at the level of individual buildings and aggregates them to 3 arc-second grids, and this approach performs well in regions where building footprint data are comprehensive and reliable. However, large portions of the globe still suffer from incomplete, sparse, or entirely missing building stock datasets, creating a structural limitation for strictly building-based population models. To address this research gap, this study proposes a computer vision-based framework that employs Google Earth Engine satellite embeddings and UNet, which allows us to directly impute grid-level population estimates in building-data-deficient areas. Applied to Taiwan as a case study, the framework achieved strong predictive performance with R$^{2}$ of 0.89, RMSE of 18.70, and MAE of 8.41, outperforming traditional machine learning approaches. Notably, the proposed framework effectively addressed building false-positive errors inherent in Global Human Settlement Layer (GHSL) data, correctly identifying uninhabited areas that were erroneously classified as populated. The framework also offers significant advantages for global population mapping, particularly in terms of scalability and temporal consistency, thereby extending the coverage and accuracy of high-resolution population products in data-scarce regions worldwide. Urban planners, decision makers, and related stakeholders can obtain granular population distributions to support more accurate and targeted infrastructure investment, service delivery, resource allocation, and risk assessment decisions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Dynamic Transmission Line Switching Amid Wildfire-Prone Weather Under Decision-Dependent Uncertainty

During dry and windy seasons, environmental conditions significantly increase the risk of wildfires, exposing power grids to disruptions caused by transmission line failures. Wildfire propagation exacerbates grid vulnerability, potentially leading to prolonged power outages. To address this challenge, we propose a multistage optimization model that dynamically adjusts transmission grid topology in response to wildfire propagation, aiming to develop an optimal response policy. By accounting for decision-dependent uncertainty, where line survival probabilities depend on usage, we employ distributionally robust optimization to model uncertainty in line survival distributions. We adapt the stochastic nested decomposition algorithm and derive a deterministic upper bound for its finite convergence. To enhance computational efficiency, we exploit the Lagrangian dual problem structure for a faster generation of Lagrangian cuts. Using realistic data from the California transmission grid, we demonstrate the superior performance of dynamic response policies against two-stage alternatives through a comprehensive case study. In addition, after solving the multistage formulation, we construct easy-to-implement policies that significantly reduce computational burden while maintaining good performance in real-time deployment. History: Accepted by Russell Bent, Area Editor for Network Optimization: Algorithms and Applications. Funding: This work was supported by the U.S. Department of Energy, Office of Electricity [Grant DE-AC02-05CH11231]. The work of R. Jiang was supported in part by the U.S. National Science Foundation, Division of Electrical, Communications and Cyber Systems [Grant ECCS-1845980] and the U.S. Air Force Office of Scientific Research [Grant FA9550-23-1-0323]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2025.1210 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2025.1210 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

Estrada-Garcia, Juan-Alberto↗
DOE OSTI2023

Recent Developments in Security-Constrained AC Optimal Power Flow: Overview of Challenge 1 in the ARPA-E Grid Optimization Competition

In “Recent Developments in Security-Constrained AC Optimal Power Flow: Overview of Challenge 1 in the ARPA-E Grid Optimization Competition,” we review the state of the art in practical algorithms for scheduling power-systems operations in the short term and the results of the recent competition organized by the U.S. Advanced Research Projects Agency–Energy. We explain the mixed-integer nonlinear formulation used in the competition for nonspecialists in electrical engineering, the context and organization of the competition, and the performance of competitors. We find that the collective approaches and results of competitors provide support for efforts to move nonlinear optimization techniques into industrial applications, as they have proven to be a robust and efficient alternative to current linear approximation techniques.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2018

Internet-of-Things Hardware-in-the-Loop Simulation Architecture for Providing Frequency Regulation With Demand Response

Following recent advances in network infrastructure, cloud computing, and embedded systems, fascinating work is underway exploring the utility of demand response in increasing grid stability while permitting high penetration of intermittent renewable distributed generation resources. Although works have demonstrated diverse theoretical advantages of demand response programs, little real-world data are available and utilities generally remain reticent in moving forward with large-scale implementation due to risks inherent to any modification of the power system. Deciding that the next pertinent step in bringing demand response from theory to technology is developing an Internet-of-things hardware-in-the-loop simulation power system integrated device capable of empirically testing the theoretical mechanisms, this work presents an architecture testbed for providing demand response (telemetric monitoring and actuation of loads), which is real node in a power system simulation where virtual node's parameters derive real node data. Finally, we test a demand response algorithm, which provides frequency regulation services.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Implementation of Parallel Dynamic Simulation on Shared-Memory vs. Distributed-Memory Environments

Power system dynamic simulation computes the system response to a sequence of large disturbance, such as sudden changes in generation or load, or a network short circuit followed by protective branch switching operation. It consists of a large set of differential and algebraic equations, which is computational intensive and challenging to solve using single-processor based dynamic simulation solution. High-performance computing (HPC) based parallel computing is a very promising technology to speed up the computation and facilitate the simulation process. This paper presents two different parallel implementations of power grid dynamic simulation using Open Multi-processing (OpenMP) on shared-memory platform, and Message Passing Interface (MPI) on distributed-memory clusters, respectively. The difference of the parallel simulation algorithms and architectures of the two HPC technologies are illustrated, and their performances for running parallel dynamic simulation are compared and demonstrated.

dynamic simulation↗
DOE OSTI2025

FLAMES─Fast, Low-Storage, Accurate, and Memory-Efficient Adaptive Sampling─Approach to Resolve Spatially Dependent Dynamics of Molecular Liquids

Many critical phenomena in soft matter occur at large length scales, necessitating the resolution of their structure and dynamics at low wavenumbers. However, resolving wavenumber-dependent dynamics computationally via molecular dynamics simulations presents significant challenges, as these phenomena span several orders of magnitude in both time and length scales, resulting in high computational costs and memory demands. Here, this work highlights the computational and memory challenges associated with analyzing molecular trajectories in reciprocal space and demonstrates a method to address them. We introduce FLAMESFast, Low-storage, Accurate, and Memory-Efficient adaptive Sampling, which is a direct method for calculation of structure factors, allowing us to select only the required number of wavevectors for binning. We also use wavenumber-dependent time steps to extract dynamics. Our FLAMES approach effectively mitigates computational and memory/storage bottlenecks. We demonstrate the method using simulations of a model system, liquid octane, at various temperatures. Comparisons with experimental data and real space computation show that the FLAMES technique achieves high accuracy in resolving temperature- and spatially dependent dynamics while being significantly more computationally efficient and requiring less memory and storage than methods based on a uniform wavevector grid and fixed temporal spacing.

Chen, Guang [Argonne National Laboratory (ANL), Ar↗
DOE OSTI2013

Solving the Schroedinger equation using Smolyak interpolants

In this paper, we present a new collocation method for solving the Schroedinger equation. Collocation has the advantage that it obviates integrals. All previous collocation methods have, however, the crucial disadvantage that they require solving a generalized eigenvalue problem. By combining Lagrange-like functions with a Smolyak interpolant, we device a collocation method that does not require solving a generalized eigenvalue problem. We exploit the structure of the grid to develop an efficient algorithm for evaluating the matrix-vector products required to compute energy levels and wavefunctions. Energies systematically converge as the number of points and basis functions are increased.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Gyroaveraging operations using adaptive matrix operators

A new adaptive scheme to be used in particle-in-cell codes for carrying out gyroaveraging operations with matrices is presented. This new scheme uses an intermediate velocity grid whose resolution is adapted to the local thermal Larmor radius. The charge density is computed by projecting marker weights in a field-line following manner while preserving the adiabatic magnetic moment μ. These choices permit to improve the accuracy of the gyroaveraging operations performed with matrices even when strong spatial variation of temperature and magnetic field is present. Accuracy of the scheme in different geometries from simple 2D slab geometry to realistic 3D toroidal equilibrium has been studied. As a result, a successful implementation in the gyrokinetic code XGC is presented in the delta-f limit.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗