Small-signal Stability Analysis for Large-scale Power Electronics-based Power Systems
Not Available
42 ENGINEERING↗
SEARCH · Search NASA
Results for “transmission line matrix methods”
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.
Synthesizing pseudo-Kossel lines from neutron transmission data. II. Validation with neutron diffraction data
A new method to recover the orientation matrix of a single crystal with a known unit cell by analyzing synthesized pseudo-Kossel lines from time-of-flight neutron transmission data has been outlined in a companion article [Dessieux et al. (2023). J. Appl. Cryst. 56, https://dx.doi.org/10.1107/S1600576723001346; referred to here as Article I]. In this work, validation of this new technique is presented by employing experimental neutron transmission and diffraction measurements performed on two copper single-crystal specimens. Time-of-flight spectra were recorded during rotation (ω) of the single crystals about a vertical axis perpendicular to the incident neutron beam. The λ–ω maps recorded in transmission are utilized to determine the crystal orientation with respect to the neutron beam, following the procedure presented in Article I. Further, to validate the indexing procedure, the crystal orientations are compared with those obtained via conventional methods using the diffraction data. The resulting pseudo-Kossel lines across the 2D detectors are also observed for the first time.
36 MATERIALS SCIENCE↗
Synthesizing pseudo-Kossel lines from neutron transmission data. I. An analytical approach for recovering single-crystal orientation
The energy-dispersive neutron spectra transmitted through single crystals are characterized by sharp Bragg dips at specific wavelengths, where Bragg's law is being fulfilled for certain crystallographic planes. This phenomenon allows for developing methods for crystal-orientation determination techniques similar to electron backscatter diffraction and X-ray diffraction microscopy. This work presents a new procedure to recover the orientation matrix for single crystals using transmission spectra recorded during rotation of a crystal about an axis perpendicular to a polychromatic neutron beam. The proposed method consists of an initial transformation of the as-collected wavelength–rotation maps to a wavevector $\textit{K}$ space, resulting in linear pseudo-Kossel lines that are suitable for analysis and indexing using image-processing procedures. Further, simulated neutron transmission spectra through a copper crystal with known orientations were used to set and prove the numerical approach. This technique may be expanded for cases where the neutron beam intersects multiple single-crystal grains with different orientations.
36 MATERIALS SCIENCE↗
A Stability Analysis Tool for Bulk Power Systems Using Black-Box Models of Inverter-Based Resources
This paper presents a small-signal stability analysis tool for large-scale power systems with high penetration of inverter-based resources (IBRs). Firstly, a network transfer function matrix (NTFM), which represents the information of the system topology, transmission lines, loads, IBRs locations, etc., is derived to model the entire power system network. Secondly, small-signal perturbation method is applied to obtain the sequence impedance/admittance models of the block-box IBRs considering the frequency cross-coupling effects. With the obtained NTFM as well as IBR models, a multi-input, multi-output (MIMO) feedback system is constructed, and the generalized Nyquist criterion (GNC)-based stability method is employed to analyze the stability of the entire power system. Furthermore, based on the developed stability analysis method, sensitivity analysis is conducted on an unstable case to identify which parameter has a high impact on the system stability. As a result, different test cases based on a modified IEEE 14- bus system as well as a reduced 240-bus WECC system are studied to verify the proposed stability analysis tool.
42 ENGINEERING↗
A General Method for Estimating Zonal Transmission Interface Limits from Nodal Network Data: Preprint
Capacity expansion models for the electric power system often employ zonal (rather than nodal) resolution, necessitating estimates of aggregate power transfer limits across the interfaces between model zones. Interface limits between planning areas are sometimes published, but they are not generalizable to arbitrary zone shapes. There is thus a need for a reproducible method for estimating interface transfer limits (ITLs) between user-defined zones directly from nodal transmission system data. Here, we present a simple method for estimating ITLs using a DC power flow approximation via the power transfer distribution factor (PTDF) matrix. Linear optimization is performed to identify the distribution of power flows that maximizes the total flow on interface-crossing lines, subject to individual line ratings, limits on bus injection/withdrawal, and the relationships among flows, injections, and withdrawals imposed by the PTDF matrix. We demonstrate the application of the method on a 134-zone ~65000-bus system, and we explore the influence of flow direction, contingency level, and zone size on the estimated ITLs. There is significant heterogeneity in the ratio of the ITL to the sum of interface-crossing line ratings, which highlights the importance of accounting for the physical constraints on power flows imposed by Kirchhoff's laws when estimating zonal ITLs.
17 WIND ENERGY↗
Improved Evaluation of Large Network Matrices for Linear Power Flow Within Optimization Problems: Preprint
This work discusses methods for evaluating the Power Transfer Distribution Factor (PTDF) and Line Outage Distribution Factor (LODF) matrices by employing sparse linear algebra for large-scale computing applications. These matrices are critical in many power systems applications, such as the Unit Commitment Problem (UC), pre- and post-contingency power flow analysis, and transmission expansion. These matrices are typically dense, which means they require a significant amount of time and memory to be computed for large networks. However, by analyzing the structure of the matrices and their computation method, it is possible to use reduced memory methods based on sparse matrix operations. This paper shows that sparse linear algebra algorithms are faster and require less memory and time than traditional dense approaches. Additionally, we explore the effect of matrix sparsification by eliminating trailing digits on power flow calculations.
ENERGY PLANNING, POLICY, AND ECONOMY↗
Improved Evaluation of Large Network Matrices for Linear Power Flow Within Optimization Problems
This work presents methods for evaluating the Power Transfer Distribution Factor (PTDF) and Line Outage Distribution Factor (LODF) matrices by employing sparse linear algebra for large-scale computing applications. These matrices play a critical role in many power system applications, such as the Unit Commitment Problem (UC), pre- and post-contingency power flow analysis, and transmission expansion. These matrices are typically dense, which means they require a significant amount of time and memory to be computed for large networks. However, by analyzing the structure of the matrices and their computation method, it is possible to use reduced memory methods based on sparse matrix operations. This paper shows that sparse linear algebra algorithms are faster and require less memory and time than traditional dense approaches. Additionally, we explore the effect of matrix sparsification by eliminating trailing digits on power flow calculations.
large scale↗
Alternating Direction Decomposition with Strong Bounding and Convexification (ADDSBC) for Solving Security Constrained AC Unit Commitment Problems
This project aims to develop efficient and robust computational methods for solving the security-constrained unit commitment and alternating current optimal power flow problem (SC-UC-ACOPF). The SC-UC-ACOPF problem is at the center of the short-term operation of the U.S. Power Grid. It is solved every week, every day, and every 10 minutes to plan for the optimal action of electricity generation and consumption by minimizing the generation cost and maintaining power system reliability against potential disruptions of equipment failures. In mathematical terms, SC-UC-ACOPF is a challenging large-scale mixed-integer nonlinear optimization model. This means that the decisions involve both discrete variables, e.g. the turning on and off of generators and switching of transmission lines and transformers, and continuous decisions, e.g. the amount of energy generated by each generator and the power flows in the power grid. The physics of the power flow is described by nonlinear equations involving real and reactive power and bus voltages. Another key feature is the large number of contingencies, i.e. the system needs to stay reliable in face of failure of any one equipment, such as transmission lines and generators. The U.S. power grids are extremely complicated and large scale with more than 5,000 generators, 50,000 buses, and 100,000 high-voltage transmission lines, making the SC-UC-ACOPF a very large-scale computation challenge. The research developed in this project aims to solve the SC-UC-ACOPF problems in the three timescales, i.e. weekly, daily, and every 10-min. The proposed computational methods are built on a principled algorithmic approach of decomposition and penalization. More specifically, the algorithm develops spatial and temporal decomposition by exploiting the strong temporal coupling and weak spatial coupling of the UC problem and the complementary feature, i.e. weak temporal coupling and strong spatial coupling of the ACOPF problem. The algorithm also leverages recent progresses in strong convex relaxation of ACOPF. A unique feature of the proposed approach is that it generates a valid, global upper bound on the optimal maximum profit. In this way, a global optimality gap is available to measure the quality of the solution. To further speed up computation, the research team has developed a plethora of effective heuristics to strengthen the iterative penalty-based decomposition framework. For instance, a heuristic is developed to construct inner approximations of the time coupling constraints within the time decoupled problems. Contingencies are pre-screened and low-rank matrix computation is exploited to find the almost unique solution to each contingency. A novel heuristic for line switching is proposed and tested with positive impacts on instances where line switching is beneficial. Taking a systematic approach and carefully handling every detail of the problem pays off. The TIM-GO’s performance throughout the trials and the final event was stellar. TIM-GO garnered the second highest total prize money and is ranked in the top three positions across all categories of comparison.
97 MATHEMATICS AND COMPUTING↗