Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Grid Partition”

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 253 records · Page 14

Design of Zone-Based Hierarchical Protection System for 100% Renewable Microgrids

Design of a reliable and secure protection system for a 100% renewable microgrid with only inverter-based resources (IBRs), is quite challenging. Most of the existing protection schemes in the state-of-the-art are suitable for microgrids with mixed-type of distributed energy resources (DERs) that covers both rotating machine-based DERs as well as IBR-based DERs, where the fault current level is moderately high. Due to drastic reduction in fault current level based on mode of operation and the variation of the low fault current level based on the operating level of the IBRs, the existing protection schemes face critical challenges, in case of a 100% renewable microgrid. This article proposes a zone-based hierarchical protection scheme that partitions a microgrid into various zones-of-protection and assigns speed-based hierarchical protection schemes in order to address the fundamental challenges of such microgrids. The performance of the proposed scheme is evaluated using time-domain simulation study on a microgrid test system. The results corroborates that the proposed hierarchical zone-based protection scheme exhibits enhanced reliability, security and dependability while tested with various fault cases (fault types, locations, and impedances), and non-fault cases during both grid-tied and islanded mode.

grid-forming inverter↗

Design of Zone-Based Hierarchical Protection System for 100% Renewable Microgrids: Preprint

Design of a reliable and secure protection system for a 100% renewable microgrid with only inverter-based resources (IBRs), is quite challenging. Most of the existing protection schemes in the state-of-the-art are suitable for microgrids with mixed-type of distributed energy resources (DERs) that covers both rotating machine-based DERs as well as IBR-based DERs, where the fault current level is moderately high. Due to drastic reduction in fault current level based on mode of operation and the variation of the low fault current level based on the operating level of the IBRs, the existing protection schemes face critical challenges, in case of a 100% renewable microgrid. This article proposes a zone-based hierarchical protection scheme that partitions a microgrid into various zones-of-protection and assigns speed-based hierarchical protection schemes in order to address the fundamental challenges of such microgrids. The performance of the proposed scheme is evaluated using time-domain simulation study on a microgrid test system. The results corroborates that the proposed hierarchical zone-based protection scheme exhibits enhanced reliability, security and dependability while tested with various fault cases (fault types, locations, and impedances), and non-fault cases during both grid-tied and islanded mode.

grid-forming inverter↗

A stable and accurate partitioned algorithm for conjugate heat transfer

We describe a new partitioned approach for solving conjugate heat transfer (CHT) problems where the governing temperature equations in different material domains are time-stepped in a implicit manner, but where the interface coupling is explicit. The new approach, called the CHAMP scheme (Conjugate Heat transfer Advanced Multi-domain Partitioned), is based on a discretization of the interface coupling conditions using a generalized Robin (mixed) condition. The weights in the Robin condition are determined from the optimization of a condition derived from a local stability analysis of the coupling scheme. The interface treatment combines ideas from optimized-Schwarz methods for domain-decomposition problems together with the interface jump conditions and additional compatibility jump conditions derived from the governing equations. For many problems (i.e. for a wide range of material properties, grid-spacings and time-steps) the CHAMP algorithm is stable and second-order accurate using no sub-time-step iterations (i.e. a single implicit solve of the temperature equation in each domain). In extreme cases (e.g. very fine grids with very large time-steps) it may be necessary to perform one or more sub-iterations. Each sub-iteration generally increases the range of stability substantially and thus one sub-iteration is likely sufficient for the vast majority of practical problems. The CHAMP algorithm is developed first for a model problem and analyzed using normal-mode the- ory. The theory provides a mechanism for choosing optimal parameters in the mixed interface condition. A comparison is made to the classical Dirichlet-Neumann (DN) method and, where applicable, to the optimized- Schwarz (OS) domain-decomposition method. For problems with different thermal conductivities and dif- fusivities, the CHAMP algorithm outperforms the DN scheme. For domain-decomposition problems with uniform conductivities and diffusivities, the CHAMP algorithm performs better than the typical OS scheme with one grid-cell overlap. Lastly, the CHAMP scheme is also developed for general curvilinear grids and CHT ex- amples are presented using composite overset grids that confirm the theory and demonstrate the effectiveness of the approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data traffic reduction schemes for sparse Cholesky factorizations

Load distribution schemes are presented which minimize the total data traffic in the Cholesky factorization of dense and sparse, symmetric, positive definite matrices on multiprocessor systems with local and shared memory. The total data traffic in factoring an n x n sparse, symmetric, positive definite matrix representing an n-vertex regular 2-D grid graph using n (sup alpha), alpha is equal to or less than 1, processors are shown to be O(n(sup 1 + alpha/2)). It is O(n(sup 3/2)), when n (sup alpha), alpha is equal to or greater than 1, processors are used. Under the conditions of uniform load distribution, these results are shown to be asymptotically optimal. The schemes allow efficient use of up to O(n) processors before the total data traffic reaches the maximum value of O(n(sup 3/2)). The partitioning employed within the scheme, allows a better utilization of the data accessed from shared memory than those of previously published methods.

Naik, Vijay K.↗

A multi-domain method for subsonic viscous flows

We have developed a Schwarz type domain decomposition method for a pressure base, two- and three-dimensional Navier-Stokes solver. This technique allows one to partition a flow path, which can be characterized by complex geometry and/or complicated flow physics, into smaller sub-domains according to the local geometric simplicity or estimated flow scales. We can, then, sweep the sub-domains in some order and solve the Navier-Stokes equations using as boundary conditions, along the domain interfaces, the Dirichlet conditions which are taken from the most recent update of the solution in the adjacent neighboring domains. With this technique, one can minimize the adverse effects caused by grid skewness and the stiffness problem caused by disparate flow scales. Here, we report the results of a few fundamental flow cases to demonstrate that a judicious use of the multi-domain method can offer a significant convergence acceleration over the traditional one-domain method. This method can be extended to exploit the architecture of a parallel computer to further improve the speed.

Chan, Daniel C.↗

A Path to Improving Simulated Properties of Low Clouds over the Beaufort Sea using Airborne In Situ Observations of Subgrid-Scale Variability

Arctic low clouds influence the evolution of the Arctic system through their effects on radiative fluxes, boundary layer mixing, stability, turbulence, humidity, and precipitation. Unfortunately, atmospheric models and retrospective analysis (reanalysis) products struggle to accurately simulate the occurrence and properties of low clouds in the Arctic. One of the main reasons for this problem are the possible unrealistic assumptions that models/reanalyses make about the subgrid-scale (SGS) variability of meteorological properties, as well as the relationship between SGS variability and grid-scale (GS) cloud properties. We utilize cloud and thermodynamic data of low level (primarily) liquid clouds collected from two aircraft campaigns conducted over the Beaufort Sea to better understand and characterize this problem. Examining data from the September 2014 Arctic Radiation-IceBridge Sea and Ice Experiment (ARISE) airborne campaign reveals that GS cloud water variability is closely related with SGS distribution of total water (i.e. water vapor + cloud water). Multiple models/reanalyses use SGS supersaturated total water (relative to GS saturation) as a threshold for partitioning available water for condensation, and indeed we find significant correlation between GS cloud water and SGS supersaturation. However, we also find that the assumption of a static threshold of 100% saturation to be unrealistic. Empirical calculations from the ARISE data show a large sensitivity of this threshold to GS relative humidity, and so a microphysical parameterization allowing the threshold to vary according to GS thermodynamic properties may result in more realistic GS cloud water values. Finally, to determine how sensitive the ARISE-derived results are to that particular campaign, we include additional data from the First International Satellite Cloud Climatology Project (ISCCP) Regional Experiment (FIRE)–Arctic Cloud Experiment (ACE) conducted in 1998. The inclusion of the second dataset will help with demonstrating the robustness of the results and their utility in improving the representation of Arctic clouds in models and reanalyses.

J Brant Dodson↗

The Use of Indirect Estimates of Soil Moisture to Initialize Coupled Models and its Impact on Short-Term and Seasonal Simulations

It is well known that soil moisture is a characteristic of the land surface that strongly affects the partitioning of outgoing radiation into sensible and latent heat which significantly impacts both weather and climate. Detailed land surface schemes are now being coupled to mesoscale atmospheric models in order to represent the effect of soil moisture upon atmospheric simulations. However, there is little direct soil moisture data available to initialize these models on regional to continental scales. As a result, a Soil Hydrology Model (SHM) is currently being used to generate an indirect estimate of the soil moisture conditions over the continental United States at a grid resolution of 36 Km on a daily basis since 8 May 1995. The SHM is forced by analyses of atmospheric observations including precipitation and contains detailed information on slope soil and landcover characteristics.The purpose of this paper is to evaluate the utility of initializing a detailed coupled model with the soil moisture data produced by SHM.

Lapenta, William M.↗

A Domain-Decomposed Multi-Level Method for Adaptively Refined Cartesian Grids with Embedded Boundaries

The work presents a new method for on-the-fly domain decomposition technique for mapping grids and solution algorithms to parallel machines, and is applicable to both shared-memory and message-passing architectures. It will be demonstrated on the Cray T3E, HP Exemplar, and SGI Origin 2000. Computing time has been secured on all these platforms. The decomposition technique is an outgrowth of techniques used in computational physics for simulations of N-body problems and the event horizons of black holes, and has not been previously used by the CFD community. Since the technique offers on-the-fly partitioning, it offers a substantial increase in flexibility for computing in heterogeneous environments, where the number of available processors may not be known at the time of job submission. In addition, since it is dynamic it permits the job to be repartitioned without global communication in cases where additional processors become available after the simulation has begun, or in cases where dynamic mesh adaptation changes the mesh size during the course of a simulation. The platform for this partitioning strategy is a completely new Cartesian Euler solver tarcreted at parallel machines which may be used in conjunction with Ames' "Cart3D" arbitrary geometry simulation package.

Aftosmis, M. J.↗

Distributed ADMM Using Private Blockchain for Power Flow Optimization in Distribution Network With Coupled and Mixed-Integer Constraints

The optimization problem for scheduling distributed energy resources (DERs) and battery energy storage systems (BESS) integrated with the power grid is important to minimize energy consumption from conventional sources in response to demand. Conventionally this optimization problem is solved in a centralized manner, limiting the size of the problem that can be solved and creating a high communication overhead because all the data is transferred to the central controller. These limitations are addressed by the proposed distributed consensus-based alternating direction method of multiplier (DC-ADMM) optimization algorithm, which decomposes the optimization problem into subproblems with private cost function and constraints. The distribution feeder is partitioned into low coupling subnetworks/regions, which solves the private subproblem locally and exchanges information with the neighboring regions to reach consensus. The relaxation strategy is employed for mixed-integer and coupled constraints introduced in the optimal power flow (OPF) problem by stationary and transportable BESS because DC-ADMM convergence is only guaranteed for strict convex problems. The information exchange and synchronization between subnetworks/regions are vital for distributed optimization. In this work, both of these aspects are addressed by the blockchain. The smart contract deployed on the blockchain network acts as a mediator for secure data exchange and synchronization in distributed computation. The blockchain-based distributed optimization problem’s effectiveness is tested for a 0.5-MW laboratory microgrid for one hour ahead and day-ahead for the IEEE 123-bus and EPRI J1 test feeders, and results are compared with a centralized solution.

25 ENERGY STORAGE↗

TrustDER: Trusted, Private and Scalable Coordination of Distributed Energy Resources

In this project, the Stanford and SLAC Teams have developed a Trusted, Private and Scalable platform for coordinating Coordination of Distributed Energy Resources (TrustDER). This is a layered system that ensures private, trusted and scalable coordination and monitoring of DERs. It accommodates a variety of resources, such as solar generation, gensets and loads, with a particular focus on battery systems-based resources, as they are a transformational technology experiencing fast growth in adoption by large critical facilities. The platform can be used as standalone or added to existing aggregation systems to enable trust, privacy and resilience. TrustDER consists of layers that address each of the shortcomings of the existing state of the art. Each layer in the platform can operate independently but provides information to the layers above it to enable a novel form of overall coordination architecture. The project consists of several tasks, with each task dedicated to the design of each layer. Task 2 Resource Virtualization defined a software abstraction layer for distributed energy resources (DERs). The goal of this abstraction was to simplify the implementation of algorithms utilizing cooperation of DERs resources in a variety of use cases. Task 3 is on Secure ID for Asset Authentication. Identity Management Systems (IDMS) are a foundational infrastructure for interactions between entities (organizations, users, devices, and services). Secure ID is blockchain-based a distributed identity management system allowing (1) identity provisioning, (2) authentication, (3) authorization, and (4) identity data sharing for IoT-enabled assets on the electricity grid. In this project, the SLAC team focused on designing and testing Keymaker, a protocol for authenticating device identity managed by Secure ID. Task 5 Private and Safe Integration is focused on the design and evaluation of a DER cooperation scheme which allows for the aggregation of DERs without impacting network reliability. The approach is designed based on realistic assumptions regarding data availability, communication infrastructure limitations, and privacy. Task 6 Scalable Distributed Privacy for Information explored how virtualized batteries could be managed privately. Specifically, it examined the case in which a principal provides a partitioned battery to multiple clients. Task 7 Use Cases was to ensure that this technology was applied in relevant situations and scenarios. Primarily, this means that virtualization needed to be employed in a manner that either improved flexibility, bolstered security or privacy, or decreased costs.

25 ENERGY STORAGE↗

Photovoltaic Degradation Rates -- An Analytical Review

As photovoltaic penetration of the power grid increases, accurate predictions of return on investment require accurate prediction of decreased power output over time. Degradation rates must be known in order to predict power delivery. This article reviews degradation rates of flat-plate terrestrial modules and systems reported in published literature from field testing throughout the last 40years. Nearly 2000 degradation rates, measured on individual modules or entire systems, have been assembled from the literature, showing a median value of 0.5%/year. The review consists of three parts: a brief historical outline, an analytical summary of degradation rates, and a detailed bibliography partitioned by technology.

14 SOLAR ENERGY↗

Impacts of climate change on subannual hydropower generation: a multi-model assessment of the United States federal hydropower plant

Abstract Hydropower is a low-carbon emission renewable energy source that provides competitive and flexible electricity generation and is essential to the evolving power grid in the context of decarbonization. Assessing hydropower availability in a changing climate is technically challenging because there is a lack of consensus in the modeling representation of key dynamics across scales and processes. Focusing on 132 US federal hydropower plants, in this study we evaluate the compounded impact of climate and reservoir-hydropower models’ structural uncertainties on monthly hydropower projections. In particular, instead of relying on one single regression-based hydropower model, we introduce another conceptual reservoir operations-hydropower model in the assessment framework. This multi-model assessment approach allows us to partition uncertainties associated with both climate and hydropower models for better clarity. Results suggest that while at least 70% of the uncertainties at the annual scale and 50% at the seasonal scale can be attributed to the choice of climate models, up to 50% of seasonal variability can be attributed to the choice of hydropower models, particularly in regions over the western US where the reservoir storage is substantial. The analysis identifies regions where multi-model assessments are needed and presents a novel approach to partition uncertainties in hydropower projections. Another outcome includes an updated evaluation of Coupled Model Intercomparison Project Phase 5 (CMIP5)-based federal hydropower projection, at the monthly scale and with a larger ensemble, which can provide a baseline for understanding future assessments based on CMIP6 and beyond.

54 ENVIRONMENTAL SCIENCES↗

Preconditioned implicit solvers for the Navier-Stokes equations on distributed-memory machines

The GMRES method is parallelized, and combined with local preconditioning to construct an implicit parallel solver to obtain steady-state solutions for the Navier-Stokes equations of fluid flow on distributed-memory machines. The new implicit parallel solver is designed to preserve the convergence rate of the equivalent 'serial' solver. A static domain-decomposition is used to partition the computational domain amongst the available processing nodes of the parallel machine. The SPMD (Single-Program Multiple-Data) programming model is combined with message-passing tools to develop the parallel code on a 32-node Intel Hypercube and a 512-node Intel Delta machine. The implicit parallel solver is validated for internal and external flow problems, and is found to compare identically with flow solutions obtained on a Cray Y-MP/8. A peak computational speed of 2300 MFlops/sec has been achieved on 512 nodes of the Intel Delta machine,k for a problem size of 1024 K equations (256 K grid points).

Ajmani, Kumud↗

A Parallel Computing Infrastructure for Building Energy Simulation

In order to study grid-interactive efficient buildings, Pacific Northwest National Laboratories (PNNL) needs an infrastructure for urban-scale building energy modeling. Such an infrastructure should be fast, scalable, and easy-to-use. Given a set of data from the Energy Information Administration’s Commercial Building Energy Consumption Survey (CBECS) and tool to translate survey data into simulation inputs, this project aimed to conduct the simulation of the entire dataset in parallel. Before running the simulations, the necessary software was bundled into a container for use on the PNNL supercomputing network. Then, the parallel simulation workflow was designed using GNU Make, a file creation software, and submitted to a supercomputing partition which could run hundreds of simulations simultaneously. The EnergyPlus simulations output hourly electric meter data for each CBECS sample, which represents the electricity consumption of similar commercial buildings across the United States. Analyzing and visualizing the meter data is important to the future of the work, and this project wrote code to make common analysis methods simple, fast, and accessible. Moving forwards, the model will need to be expanded to include data from other sources and its accuracy will need to be improved and eventually validated.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A Scalable Space-Time Domain Decomposition Approach for Solving Large Scale Nonlinear Regularized Inverse Ill Posed Problems in 4D Variational Data Assimilation

We address the development of innovative algorithms designed to solve the strong-constraint Four Dimensional Variational Data Assimilation (4DVar DA) problems in large scale applications. We present a space-time decomposition approach which employs the whole domain decomposition, i.e. both along the spacial and temporal direction in the overlapping case, and the partitioning of both the solution and the operator. Starting from the global functional defined on the entire domain, we get to a sort of regularized local functionals on the set of sub domains providing the order reduction of both the predictive and the Data Assimilation models. The algorithm convergence is developed. Performance in terms of reduction of time complexity and algorithmic scalability is discussed on the Shallow Water Equations on the sphere. The number of state variables in the model, the number of observations in an assimilation cycle, as well as numerical parameters as the discretization step in time and in space domain are defined on the basis of discretization grid used by data available at repository Ocean Synthesis/Reanalysis Directory of Hamburg University.

97 MATHEMATICS AND COMPUTING↗

A Data-Driven Approach to Nation-Scale Building Energy Modeling

In 2019, 125 million U.S. residential and commercial buildings consumed $412 billion in energy bills. These buildings currently consume 40% of the nation's primary energy, 73% of electricity, 80% of energy during peak electric grid use, and responsible for 39% of greenhouse gas emissions [14]. Urban-scale building energy modeling has grown significantly in the past decade, allowing individual campuses or communities of buildings to be modeled, simulated, and cost-effective solutions for intelligent management to be identified and implemented. While traditionally limited to individual counties and usually less than 2,000 buildings, the Automatic Building Energy Modeling (AutoBEM) soft-ware suite has been developed to process unconventional, nation-scale data sources to generate unique OpenStudio and EnergyPlus models of each building. Through the use of High Performance Computing (HPC) resources, every U.S. building has been simulated. This paper showcases the data layout, node partitioning, algorithmic approaches, and analytic results that were used to create, share, and analyze 124.4 million U.S. building models.

Berres, Andy↗

Reassessing the Market—Computation Interface to Enhance Grid Security and Efficiency

The goal of this project is to reconsider core market and reliability processes that can potentially yield to transformative advances in power grid security, reliability, and efficiency. Current electric power market designs are strongly a function of computing capabilities and limitations that were available in the mid-to-late 1990s, circa deregulation. This includes constructs such as: (1) a 2-tiered day-ahead/real-time market construct; and (2) linearized (“DC”) real power flow approximations in dispatch and pricing. At that time, state-of-the-art computational capabilities could at the limit address deterministic mixed-integer programming formulations of unit commitment (UC) and linear programming formulations of economic dispatch (ED) at limited fidelity and scale. Such constraints forced limited look-ahead time-horizons, crude approximations of AC power flow physics and operations, and artificial partitioning between day-ahead markets, hour(s)-ahead reliability processes, and real-time markets. Consequently, these limitations have resulted in limited security and reliability with increasing out-of-market payments, particularly as uncertainty associated with renewables and distributed energy resources grows.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Controlling the numerical Cerenkov instability in PIC simulations using a customized finite difference Maxwell solver and a local FFT based current correction

In this study we present a customized finite-difference-time-domain (FDTD) Maxwell solver for the particle-in-cell (PIC) algorithm. The solver is customized to effectively eliminate the numerical Cerenkov instability (NCI) which arises when a plasma (neutral or non-neutral) relativistically drifts on a grid when using the PIC algorithm. We control the EM dispersion curve in the direction of the plasma drift of a FDTD Maxwell solver by using a customized higher order finite difference operator for the spatial derivative along the direction of the drift (1ˆ direction). We show that this eliminates the main NCI modes with moderate |k 1 |, while keeps additional main NCI modes well outside the range of physical interest with higher |k 1 |. These main NCI modes can be easily filtered out along with first spatial aliasing NCI modes which are also at the edge of the fundamental Brillouin zone. The customized solver has the possible advantage of improved parallel scalability because it can be easily partitioned along 1ˆ which typically has many more cells than other directions for the problems of interest. We show that FFTs can be performed locally to current on each partition to filter out the main and first spatial aliasing NCI modes, and to correct the current so that it satisfies the continuity equation for the customized spatial derivative. This ensures that Gauss’ Law is satisfied. Lastly, we present simulation examples of one relativistically drifting plasma, of two colliding relativistically drifting plasmas, and of nonlinear laser wakefield acceleration (LWFA) in a Lorentz boosted frame that show no evidence of the NCI can be observed when using this customized Maxwell solver together with its NCI elimination scheme.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗