Search NASA⌕ Search

SEARCH · Search NASA

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Spectral Clustering-Based Partitioning of Large-Scale Power Electronics-Based Power Systems for Small-Signal Stability Analysis

The nodal admittance matrix (NAM)-based approach is well-suited for small-signal stability analysis of large-scale power electronics-based power systems (PEPSs), as it preserves the system structure through its admittance matrix. Previous studies have explored partitioning such systems into subareas and interconnections to reduce computational burden; however, they lacked a formal algorithmic procedure for determining feasible partitions. While several grid partitioning methods, such as those based on graph theory or machine learning, exist in the literature, they cannot be directly applied to NAM-based analysis due to differing objectives and constraints. Here, this paper addresses this gap by presenting a systematic, step-by-step procedure for applying a spectral partitioning algorithm that yields a division of the system into subareas suitable for NAM-based analysis. The computational complexity of the proposed method is also derived to demonstrate its efficiency and justify the practicality of the resulting subarea decomposition. The performance of the partitioning method is evaluated by applying the spectral clustering-derived subareas and interconnections to the NAM-based partitioning approach on a 140-bus system. Computational times for the full-system and partitioned NAM analyses are compared using MATLAB. Additionally, PSCAD simulations of the complete system and partitioned subareas are carried out to verify the effectiveness of the proposed method.

Nupur [Univ. of Tennessee, Knoxville, TN (United S↗
DOE OSTI2017

A lightweight network anomaly detection technique

While the network anomaly detection is essential in network operations and management, it becomes further challenging to perform the first line of detection against the exponentially increasing volume of network traffic. In this paper, we develop a technique for the first line of online anomaly detection with two important considerations: (i) availability of traffic attributes during the monitoring time, and (ii) computational scalability for streaming data. The presented learning technique is lightweight and highly scalable with the beauty of approximation based on the grid partitioning of the given dimensional space. With the public traffic traces of KDD Cup 1999 and NSL-KDD, we show that our technique yields 98.5% and 83% of detection accuracy, respectively, only with a couple of readily available traffic attributes that can be obtained without the help of post-processing. Finally, the results are at least comparable with the classical learning methods including decision tree and random forest, with approximately two orders of magnitude faster learning performance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A Modular and Transferable Reinforcement Learning Framework for the Fleet Rebalancing Problem

Mobility on demand (MoD) systems show great promise in realizing flexible and efficient urban transportation. However, significant technical challenges arise from operational decision making associated with MoD vehicle dispatch and fleet rebalancing. For this reason, operators tend to employ simplified algorithms that have been demonstrated to work well in a particular setting. To help bridge the gap between novel and existing methods, we propose a modular framework for fleet rebalancing based on model-free reinforcement learning (RL) that can leverage an existing dispatch method to minimize system cost. In particular, by treating dispatch as part of the environment dynamics, a centralized agent can learn to intermittently direct the dispatcher to reposition free vehicles and mitigate against fleet imbalance. We formulate RL state and action spaces as distributions over a grid partitioning of the operating area, making the framework scalable and avoiding the complexities associated with multiagent RL. Numerical experiments, using real-world trip and network data, demonstrate that RL reduces waiting time by 28% to 38% for the same-day evaluation, 17% to 44% for cross-day evaluation, and 22% to 25% for cross-season evaluation compared with no rebalancing scenarios. This approach has several distinct advantages over baseline methods including: improved system cost; high degree of adaptability to the selected dispatch method; and the ability to perform scale-invariant transfer learning between problem instances with similar vehicle and request distributions.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2014

Robust and efficient overset grid assembly for partitioned unstructured meshes

This paper presents a method to perform efficient and automated Overset Grid Assembly (OGA) on a system of overlapping unstructured meshes in a parallel computing environment where all meshes are partitioned into multiple mesh-blocks and processed on multiple cores. The main task of the overset grid assembler is to identify, in parallel, among all points in the overlapping mesh system, at which points the flow solution should be computed (field points), interpolated (receptor points), or ignored (hole points). Point containment search or donor search, an algorithm to efficiently determine the cell that contains a given point, is the core procedure necessary for accomplishing this task. Donor search is particularly challenging for partitioned unstructured meshes because of the complex irregular boundaries that are often created during partitioning. Another challenge arises because of the large variation in the type of mesh-block overlap and the resulting large load imbalance on multiple processors. Desirable traits for the grid assembly method are efficiency (requiring only a small fraction of the solver time), robustness (correct identification of all point types), and full automation (no user input required other than the mesh system). Additionally, the method should be scalable, which is an important challenge due to the inherent load imbalance. This paper describes a fully-automated grid assembly method, which can use two different donor search algorithms. One is based on the use of auxiliary grids and Exact Inverse Maps (EIM), and the other is based on the use of Alternating Digital Trees (ADT). The EIM method is demonstrated to be more efficient than the ADT method, while retaining robustness. An adaptive load re-balance algorithm is also designed and implemented, which considerably improves the scalability of the method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Overset-Grid Method with Smooth Orbital Partitioning for Molecular Scattering Calculations

To solve molecular photoionization and electron scattering problems, we use an overset-grid representation of electronic continuum functions, which has an extended central spherical grid that overlaps small spherical grids (subgrids) centered on each atom of a polyatomic molecule. Here, in this work, we present an improved algorithm that smoothly partitions the total wave function between the central grid and the atomic subgrids. The smooth partitioning allows one to use approximately one-fourth the number of partial waves on the central grid compared to our previous implementation with switching functions. The resulting numerical method for treating electron scattering and photoionization of polyatomic molecules combines the accuracy and flexibility of pure numerical grid representations with the rapid convergence of hybrid combinations of atom-centered basis-set expansions and grid methods. The overset-grid representation is implemented using the complex Kohn variational principle for scattering and photoionization amplitudes. The faster convergence with respect to the number of central grid partial waves is demonstrated and accuracy is verified by comparisons with the previous implementation and with far more computationally demanding single-center numerical expansions in electron-molecule scattering and photoionization calculations on the neon dimer (Ne 2 ) system, carbon tetrafluoride (CF 4 ) molecule, and the pyridine (C 5 H 5 N) molecule in the static-exchange approximation.

Molecules↗
DOE OSTI2019

The Partition Function of the Four-Vertex Model in a Special External Field

The exactly solvable four-vertex model on a square grid with the fixed boundary conditions in a presence of a special external field is considered. Namely, we study a system in a linear field acting on the central column of the grid. The partition function of the model is calculated by the quantum inverse scattering method. The answer is written in determinantal form.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Automated Multiscale Approach To Predict Self-Diffusion from a Potential Energy Field

For large-scale screening studies there is a need to estimate the diffusion of gas molecules in nanoporous materials more efficiently than (brute force) molecular dynamics. In particular for systems with low diffusion coefficients molecular dynamics can be prohibitively expensive. An alternative is to compute the hopping rates between adsorption sites using transition state theory. For large-scale screening this requires the automatic detection of the transition states between the adsorption sites along the different diffusion paths. Here an algorithm is presented that analyzes energy grids for the moving particles. It detects the energies at which diffusion paths are formed, together with their directions. This allows for easy identification of nondiffusive systems. For diffusive systems, it partitions the grid coordinates assigned to energy basins and transitions states, permitting a transition state theory based analysis of the diffusion. We test our method on CH 4 diffusion in zeolites, using a standard kinetic Monte Carlo simulation based on the output of our grid analysis. We find that it is accurate, fast, and rigorous without limitations to the geometries of the diffusion tunnels or transition states.

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

Adaptive mesh refinement for steady flows in Nek5000

Adaptive mesh refinement is performed in the framework of the spectral element method augmented by approaches to error estimation and control. The h-refinement technique is used for adapting the mesh, where selected grid elements are split by a quadtree (2D) or octree (3D) structure. Continuity between parent-child elements is enforced by high-order interpolation of the solution across the common faces. Parallel mesh partitioning and grid management respectively, are taken care of by the external libraries ParMETIS and p4est. Two methods are considered for estimating and controlling the error of the solution. The first error estimate is local and based on the spectral properties of the solution on each element. This method gives a local measure of the L-2-norm of the solution over the entire computational domain. The second error estimate uses the dual-weighted residuals method - it is based on and takes into account both the local properties of the solution and the global dependence of the error in the solution via an adjoint problem. The objective of this second approach is to optimize the computation of a given functional of physical interest. The simulations are performed by using the code Nek5000 and three steady-state test cases are studied: a two-dimensional lid-driven cavity at Re = 7, 500, a two-dimensional flow past a cylinder at Re = 40, and a three-dimensional lid-driven cavity at Re = 2,000 with a moving lid tilted by an angle of 30 degrees. Finally, the efficiency of both error estimators is compared in terms of refinement patterns and accuracy on the functional of interest. In the case of the adjoint error estimators, the trend on the error of the functional is shown to be correctly represented up to a multiplicative constant.

42 ENGINEERING↗
DOE OSTI2013

A 2nd Generation Parallel Advancing Front Grid Generator

A scalable, parallel advancing grid generation technique has been developed for complex geometries and meshes with large size variations. The key innovation compared to previous techniques is the use of a domain-defining grid that has the same fine surface triangulation as the final mesh desired, but a much coarser interior mesh. In this way, the domain to be gridded is uniquely defined, overcoming a shortcoming of previous approaches. This domain-defining grid is then partitioned according to the estimated number of elements to be generated, allowing for a balanced distribution of work among the processors. The domain defining grid is also used to redistribute the elements and points after grid generation, and during the subsequent mesh improvement. Timings show that the proposed approach is scalable and able to produce large grids of high quality in a modest amount of clocktime. With the proposed parallel grid generator, a major impediment to a completely scalable simulation pipeline (grid generation, solvers, post-processing) has been removed, opening the way for truly large-scale computations using unstructured, body-fitted grids.

Grid Generation↗
DOE OSTI2023

Creation of Synthetic Electric Grids (SPP/MISO) Supporting PERFORM (Final Report)

Over the course of the project, two “realistic but not real” synthetic transmission-level grid models over the SPP-MISO and ERCOT footprints were created to provide more realistic data and increase the reliability and resiliency of the grids under a variety of scenarios. The synthetic ERCOT transmission grid is compatible with the distribution grid developed in collaboration with NREL. All generators are based on the EIA 860 data and a column with EIA plant code and Gen ID is added to generators of both grids so that they can be easily mapped. The improvements are also made to electric grids including N-1 contingencies with some remedial actions, improving the transmission lines to avoid lines in lakes, including an HVDC line to the SPP-MISO case, providing several generator parameters and their temporal constraints that were not included in EIA 860 form, generators’ cost curves, load offer curves, adding phase shifters and tap changers with impedance correction tables, adding reactive power control and partitioning the grids into active and reactive reserve zones and determine different types of the required reserve for each zone. Hourly load time series at the bus level were generated to create scenarios for solving power flow in different loading conditions. Weather measurement information and the models of renewable generators are used to directly include the impact of weather on the grids. Based on a variety of load and weather conditions the grids are improved to accommodate different conditions. The ERCOT 7k-bus grids were also modeled for the year 2030 with predicted improvements in renewable resources. The renewable generation model was also improved with historic weather data included. The impact of electric vehicles on the ERCOT grid is also modeled.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

Real-Time Identifiability of Power Distribution Network Topologies With Limited Monitoring

Recovering the distribution grid topology in real time is essential to perform several distribution system operator (DSO) functions. DSOs often do not have any direct monitoring of switch statuses to track reconfiguration. At the same time, installing real-time meters at a large number of buses is challenging due to the cost of endowing every metered bus with a real-time communication channel. The goal of this letter is to develop a meter placement strategy allowing DSOs to deploy only few real-time meters. After casting the topology recovery task as an optimization problem, a meter placement strategy ensuring unique recovery of the true topology is devised. A graph-theoretical approach is pursued to partition the grid into connected portions called observable islands . The proposed strategy then simply requires installing a meter in the path between every pair of boundary nodes , i.e., ends of edges connecting two different islands. Under some ideal assumptions, this placement strategy ensures unique recovery of the topology. The approach is also validated through numerical simulations under realistic scenarios using a standard IEEE benchmark feeder.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

A Fast and Scalable Genetic Algorithm-Based Approach for Planning of Microgrids in Distribution Networks

As a result of climate change, extreme weather events are occurring more frequently and with increasing impact. This trend poses a significant challenge for distribution utilities and system operators to ensure that there is uninterrupted power supply to critical loads in their networks; thus, the level of proactive preparation of the distribution system to be able to handle severe impacts of extreme weather events represents the system's resilience. One method that distribution system planners can use to prepare for future extreme events is to plan multiple microgrids which can use local generation as much as possible to supply critical loads. But partitioning an existing distribution system such that multiple feasible islands are planned and which are capable of supporting critical loads is still challenging for distribution systems - first, because of the size of the network graph partitioning problem and, second, because of the difficulty in properly formulating the desired attributes of such islands or microgrids. Therefore, this paper presents a genetic algorithm based approach that facilitates incorporating multiple objectives for grid partitioning by formulating two types of problems - node allocation and edge elimination - and it considers multiple topological and resilience-enhancing objectives. The performance of the proposed genetic algorithm-based approach is numerically evaluated on multiple test systems as well as on a real distribution feeder in Colorado, United States.

genetic algorithm↗
DOE OSTI2016

Field-gradient partitioning for fracture and frictional contact in the material point method: Field-gradient partitioning for fracture and frictional contact in the material point method [Fracture and frictional contact in material point method using damage-field gradients for velocity-field partitioning]

Contact and fracture in the material point method require grid-scale enrichment or partitioning of material into distinct velocity fields to allow for displacement or velocity discontinuities at a material interface. We present a new method which a kernel-based damage field is constructed from the particle data. The gradient of this field is used to dynamically repartition the material into contact pairs at each node. Our approach avoids the need to construct and evolve explicit cracks or contact surfaces and is therefore well suited to problems involving complex 3-D fracture with crack branching and coalescence. A straightforward extension of this approach permits frictional ‘self-contact’ between surfaces that are initially part of a single velocity field, enabling more accurate simulation of granular flow, porous compaction, fragmentation, and comminution of brittle materials. Finally, numerical simulations of self contact and dynamic crack propagation are presented to demonstrate the accuracy of the approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Fast and Scalable Genetic Algorithm-Based Approach for Planning of Microgrids in Distribution Networks: Preprint

As a result of climate change, extreme weather events are occurring more frequently and with increasing impact. This trend poses a significant challenge for distribution utilities and system operators to ensure that there is uninterrupted power supply to critical loads in their networks; thus, the level of proactive preparation of the distribution system to be able to handle severe impacts of extreme weather events represents the system's resilience. One method that distribution systems use to prepare for extreme events is to form multiple microgrids and thereby isolate themselves from the grid supply by using local generation as much as possible to supply critical loads. But partitioning an existing system into multiple feasible islands capable of supporting critical loads is still challenging for distribution systems - first, because of the size of the graph partitioning problem and, second, because of the difficulty in properly formulating the desired attributes of such islands or microgrids. Therefore, this paper presents a genetic algorithmbased approach that facilitates incorporating multiple objectives for grid partitioning by formulating two types of problems - node allocation and edge elimination - and it considers multiple topological and resilience-enhancing objectives. The performance of the proposed genetic algorithm-based approach is numerically evaluated on multiple test systems as well as on a real distribution feeder in Colorado, USA.

edge elimination↗
DOE OSTI2016

A multiscale restriction-smoothed basis method for high contrast porous media represented on unstructured grids

A wide variety of multiscale methods have been proposed in the literature to reduce runtime and provide better scaling for the solution of Poisson-type equations modeling flow in porous media. We present a new multiscale restricted-smoothed basis (MsRSB) method that is designed to be applicable to both rectilinear grids and unstructured grids. Like many other multiscale methods, MsRSB relies on a coarse partition of the underlying fine grid and a set of local prolongation operators (multiscale basis functions) that map unknowns associated with the fine grid cells to unknowns associated with blocks in the coarse partition. These mappings are constructed by restricted smoothing: Starting from a constant, a localized iterative scheme is applied directly to the fine-scale discretization to compute prolongation operators that are consistent with the local properties of the differential operators. The resulting method has three main advantages: First of all, both the coarse and the fine grid can have general polyhedral geometry and unstructured topology. This means that partitions and good prolongation operators can easily be constructed for complex models involving high media contrasts and unstructured cell connections introduced by faults, pinch-outs, erosion, local grid refinement, etc. In particular, the coarse partition can be adapted to geological or flow-field properties represented on cells or faces to improve accuracy. Secondly, the method is accurate and robust when compared to existing multiscale methods and does not need expensive recomputation of local basis functions to account for transient behavior: Dynamic mobility changes are incorporated by continuing to iterate a few extra steps on existing basis functions. This way, the cost of updating the prolongation operators becomes proportional to the amount of change in fluid mobility and one reduces the need for expensive, tolerance-based updates. Finally, since the MsRSB method is formulated on top of a cell-centered, conservative, finite-volume method, it is applicable to any flow model in which one can isolate a pressure equation. Herein, we only discuss single and two-phase incompressible models. Compressible flow, e.g., as modeled by the black-oil equations, is discussed in a separate paper.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Efficient Network Partitioning: Application for Decentralized State Estimation in Power Distribution Grids: Preprint

Increase in the proliferation of DERs requires real-time situational awareness for efficient grid operations. State estimation plays an important role for real time control and management of the power grid. As the sensing infrastructure grows, aggregating and handling high volumes of data at a centralized location is extremely difficult. To address this challenge, this paper first proposes a novel and efficient hierarchical spectral clustering-based network partition algorithm followed by a decentralized compressive sensing (DCS) based state estimation. The applicability of the proposed network partitioning algorithm is tested on IEEE-123 bus, IEEE-8500 node, and a 6204-node distribution network. The results shows that the proposed approach efficiently divides the network into multiple sub-networks with the minimum edge connections among the neighbors. Then, we perform DCS-based state estimation on the 6204-node distribution network after dividing the network into 18 optimal partitions. Simulation results show that DCS-based state estimation recovers the system states with high accuracy and low complexity.

ADMM↗