Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “grid application”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Solution of free-boundary problems using finite-element/Newton methods and locally refined grids - Application to analysis of solidification microstructure

A new method is presented for the solution of free-boundary problems using Lagrangian finite element approximations defined on locally refined grids. The formulation allows for direct transition from coarse to fine grids without introducing non-conforming basis functions. The calculation of elemental stiffness matrices and residual vectors are unaffected by changes in the refinement level, which are accounted for in the loading of elemental data to the global stiffness matrix and residual vector. This technique for local mesh refinement is combined with recently developed mapping methods and Newton's method to form an efficient algorithm for the solution of free-boundary problems, as demonstrated here by sample calculations of cellular interfacial microstructure during directional solidification of a binary alloy.

Tsiveriotis, K.↗
NASA NTRS1994

Overset grid applications on distributed memory MIMD computers

Analysis of modern aerospace vehicles requires the computation of flowfields about complex three dimensional geometries composed of regions with varying spatial resolution requirements. Overset grid methods allow the use of proven structured grid flow solvers to address the twin issues of geometrical complexity and the resolution variation by decomposing the complex physical domain into a collection of overlapping subdomains. This flexibility is accompanied by the need for irregular intergrid boundary communication among the overlapping component grids. This study investigates a strategy for implementing such a static overset grid implicit flow solver on distributed memory, MIMD computers; i.e., the 128 node Intel iPSC/860 and the 208 node Intel Paragon. Performance data for two composite grid configurations characteristic of those encountered in present day aerodynamic analysis are also presented.

Chawla, Kalpana↗
DOE OSTI2022

Dynamic Role-Based Access Control Policy for Smart Grid Applications: An Offline Deep Reinforcement Learning Approach

Role-based access control (RBAC) is adopted in the information and communication technology domain for authentication purposes. However, due to a very large number of entities within organizational access control (AC) systems, static RBAC management can be inefficient, costly, and can lead to cybersecurity threats. In this paper, a novel hybrid RBAC model is proposed, based on the principles of offline deep reinforcement learning (RL) and Bayesian belief networks. The considered framework utilizes a fully offline RL agent, which models the behavioral history of users as a Bayesian belief-based trust indicator. Thus, the initial static RBAC policy is improved in a dynamic manner through off-policy learning while guaranteeing compliance of the internal users with the security rules of the system. By deploying our implementation within the smart grid domain and specifically within a Distributed Energy Resources (DER) ecosystem, we provide an end-to-end proof of concept of our model. Finally, detailed analysis and evaluation regarding the offline training phase of the RL agent are provided, while the online deployment of the hybrid RL-based RBAC model into the DER ecosystem highlights its key operation features and salient benefits over traditional RBAC models.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2022

Analysis of Multi-Output Hybrid Energy Systems Interacting with the Grid: Application of Improved Price-Taker and Price-Maker Approaches to Nuclear-Hydrogen Systems

The growing recognition of the value of hydrogen as an energy intermediate in supporting future power systems with high shares of variable renewable energy has prompted many studies to quantify the economic potential of multi-output hybrid systems, which are one type of integrated energy systems (IES). Because of the complexity of modeling multiple sectors, these studies typically use simplified modeling approaches to capture the interactions between sectors. In this study, we explore the implications of alternative modeling approaches for nuclear-hydrogen IES focusing on a power system in the Midwest United States. We combine highly resolved capacity expansion and production cost modeling tools of the power system with a detailed hydrogen system optimization tool to determine the optimal electrolyzer and storage sizing and optimal operations of the nuclear-hydrogen hybrid resource across three future study years. We compare economic and operational outcomes across a spectrum of modeling approaches, including a non-hybridized base approach; a traditional price-taker approach that does not include the impact of hydrogen production on the electricity system; a power-system-focused price-maker approach that does not account for temporal hydrogen constraints; and two improved price-taker and price-maker approaches that each address the impact of revenue-optimal levels of electricity production on the resulting power system and temporal hydrogen constraints on the overall feasible solution. Results show how a traditional price-taker approach can overestimate the economic benefits of multi-output nuclear-hydrogen IES compared to our two improved approaches that estimate both hydrogen system constraints and power system interaction. We find that hydrogen output requirements and storage size limits are key drivers to overall operations and some economic outcomes. Under our assumed constant hydrogen output requirement, storage costs, test system, and modeling approaches, our results indicate that hybridization can provide a net benefit, but results are sensitive to the treatment of hydrogen revenues and electricity prices as impacted by the power system evolution.

capacity expansion modeling↗
DOE OSTI2020

Real-Time Coupling of Geographically Distributed Research Infrastructures: Taxonomy, Overview, and Real-World Smart Grid Applications

Novel concepts enabling a resilient future power system and their subsequent experimental evaluation are experiencing a steadily growing challenge: large scale complexity and questionable scalability. The requirements on a research infrastructure (RI) to cope with the trends of such a dynamic system therefore grow in size, diversity and costs, making the feasibility of rigorous advancements questionable by a single RI. Analysis of large scale system complexity has been made possible by the real-time coupling of geographically separated RIs undertaking geographically distributed simulations (GDS), the concept of which brings the equipment, models and expertise of independent RIs, in combination, to optimally address the challenge. This article presents the outputs of IEEE PES Task Force on Interfacing Techniques for Simulation Tools towards standardization of GDS as a concept. First, the taxonomy for setups utilized for GDS is established followed by a comprehensive overview of the advancements in real-time couplings reported in literature. The overview encompasses fundamental technological design considerations for GDS. The article further presents four application oriented case studies (real-world implementations) where GDS setups have been utilized, demonstrating their practicality and potential in enabling the analysis of future complex power systems.

distributed laboratories↗
NASA NTRS1992

Implicit upwind-Euler solution algorithms for unstructured-grid applications

The development of implicit upwind algorithms for the solution of the three-dimensional, time-dependent Euler equations on unstructured tetrahedral meshes is described. The implicit temporal discretization involves either a two-sweep Gauss-Seide relaxation procedure, a two-sweep Point-Jacobi relaxation procedure, or a single-sweep Point-Implicit procedure; the upwind spatial discretization is based on the flux-difference splitting of Roe. Detailed descriptions of the three implicit solution algorithms are given, and calculations for the Boeing 747 transport configuration are presented to demonstrate the algorithms. Advantages and disadvantages of the implicit algorithms are discussed. A steady-state solution for the 747 configuration, obtained at transonic flow conditions using a mesh of over 100,000 cells, required less than one hour of CPU time on a Cray-2 computer, thus demonstrating the speed and robustness of the general capability.

Batina, John T.↗
NASA NTRS1992

Implicit upwind-Euler solution algorithms for unstructured-grid applications

The development of implicit upwind algorithms for the solution of the three-dimensional, time-dependent Euler equations on unstructured tetrahdral meshes is described. The implicit temporal discretization involves either a two-sweep Gauss-Seidel relaxation procedure, a two-sweep Point-Jacobi relaxation procedure, or a single-sweep Point-Implicit procedure; the upwind spatial discretization is based on the flux-difference splitting of Roe. Detailed descriptions of the three implicit solution algorithms are given, and calculations for the Boeing 747 transport configuration are presented to demonstrate the algorithms. Advantages and disadvantages of the implicit algorithms are discussed. A steady-state solution for the 747 configuration, obtained at transonic flow conditions using s mesh of over 100,000 cells, required less than one hour of CPU time on a Cray-2 computer, thus demonstrating the speed and robustness of the general capability.

Batina, John T.↗
NASA NTRS1999

Portable Parallel Programming for the Dynamic Load Balancing of Unstructured Grid Applications

The ability to dynamically adapt an unstructured -rid (or mesh) is a powerful tool for solving computational problems with evolving physical features; however, an efficient parallel implementation is rather difficult, particularly from the view point of portability on various multiprocessor platforms We address this problem by developing PLUM, tin automatic anti architecture-independent framework for adaptive numerical computations in a message-passing environment. Portability is demonstrated by comparing performance on an SP2, an Origin2000, and a T3E, without any code modifications. We also present a general-purpose load balancer that utilizes symmetric broadcast networks (SBN) as the underlying communication pattern, with a goal to providing a global view of system loads across processors. Experiments on, an SP2 and an Origin2000 demonstrate the portability of our approach which achieves superb load balance at the cost of minimal extra overhead.

Biswas, Rupak↗
NASA NTRS2016

An Optimized Multicolor Point-Implicit Solver for Unstructured Grid Applications on Graphics Processing Units

In the field of computational fluid dynamics, the Navier-Stokes equations are often solved using an unstructuredgrid approach to accommodate geometric complexity. Implicit solution methodologies for such spatial discretizations generally require frequent solution of large tightly-coupled systems of block-sparse linear equations. The multicolor point-implicit solver used in the current work typically requires a significant fraction of the overall application run time. In this work, an efficient implementation of the solver for graphics processing units is proposed. Several factors present unique challenges to achieving an efficient implementation in this environment. These include the variable amount of parallelism available in different kernel calls, indirect memory access patterns, low arithmetic intensity, and the requirement to support variable block sizes. In this work, the solver is reformulated to use standard sparse and dense Basic Linear Algebra Subprograms (BLAS) functions. However, numerical experiments show that the performance of the BLAS functions available in existing CUDA libraries is suboptimal for matrices representative of those encountered in actual simulations. Instead, optimized versions of these functions are developed. Depending on block size, the new implementations show performance gains of up to 7x over the existing CUDA library functions.

Zubair, Mohammad↗