Search NASA⌕ Search

SEARCH · Search NASA

Results for “network flow analysis”

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 127 records · Page 7

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↗

Lyapunov stability of smart inverters using linearized distflow approximation

Fast-acting smart inverters that utilize preset operating conditions to determine real and reactive power injection/consumption can create voltage instabilities (over-voltage, voltage oscillations and more) in an electrical distribution network if set-points are not properly configured. In this work, linear distribution power flow equations and droop-based Volt–Var and Volt–Watt control curves are used to analytically derive a stability criterion using Lyapunov analysis that includes the network operating condition. The methodology is generally applicable for control curves that can be represented as Lipschitz functions. The derived Lipschitz constants account for smart inverter hardware limitations for reactive power generation. A local policy is derived from the stability criterion that allows inverters to adapt their control curves by monitoring only local voltage, thus avoiding centralized control or information sharing with other inverters. The criterion is independent of the internal time-delays of smart inverters. Simulation results for inverters with and without the proposed stabilization technique demonstrate how smart inverters can mitigate voltage oscillations locally and mitigate real and reactive power flow disturbances at the substation under multiple scenarios. The study concludes with illustrations of how the control policy can dampen oscillations caused by solar intermittency and cyberattacks.

42 ENGINEERING↗

Data-driven modeling of coarse mesh turbulence for reactor transient analysis using convolutional recurrent neural networks

Advanced nuclear reactors often exhibit complex thermal-fluid phenomena during transients. To accurately capture such phenomena, a coarse-mesh three-dimensional (3-D) modeling capability is desired for modern nuclear-system code. In the coarse-mesh 3-D modeling of advanced-reactor transients that involve flow and heat transfer, accurately predicting the turbulent viscosity is a challenging task that requires an accurate and computationally efficient model to capture the unresolved fine-scale turbulence. In this work, we propose a data-driven coarse-mesh turbulence model based on local flow features for the transient analysis of thermal mixing and stratification in a sodium-cooled fast reactor. The model has a coarse mesh setup to ensure computational efficiency, while it is trained by fine-mesh computational fluid dynamics (CFD) data to ensure accuracy. A novel neural network architecture, combining a densely connected convolutional network and a long-short-term-memory network, is developed that can efficiently learn from the spatial temporal CFD transient simulation results. The neural network model was trained and optimized on a loss-of flow transient and demonstrated high accuracy in predicting the turbulent viscosity field during the whole transient. The trained model's generalization capability was also investigated on two other transients with different inlet conditions. The study demonstrates the potential of applying the proposed data-driven approach to support the coarse-mesh multi-dimensional modeling of advanced reactors.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Uniform redundancy allocation maximizes the robustness of flow networks against cascading failures

We study the robustness of flow networks against cascading failures under a partial load redistribution model. In particular, we consider a flow network of N lines with initial loads L 1 ,...,L N and free spaces (i.e., redundant space) S 1 ,...,S N that are independent and identically distributed with joint distribution P LS (x,y) = P[L ≤ x, S ≤ y]. The capacity C i is the maximum load allowed on line i and is given by C i = L i + S i . Furthermore, when a line fails due to overloading, it is removed from the system and (1 – ε) fraction of the load it was carrying is redistributed equally among all remaining lines in the system. The rest (i.e., ε fraction) of the load is assumed to be lost or absorbed, e.g., due to advanced circuitry disconnecting overloaded power lines or an interconnected network or material absorbing a fraction of the flow from overloaded lines. We analyze the robustness of this flow network against random attacks that remove a p fraction of the lines. Our contributions include (i) deriving the final fraction of alive lines n ∞ (p,ε) for all p,εϵ(0,1) and confirming the results via extensive simulations; (ii) showing that partial redistribution might lead to (depending on the parameter 0 < ε ≤ 1) the order of transition at the critical attack size p* changing from first to second-order; and (iii) proving analytically that flow networks achieve maximum robustness [quantified by the area ∫$^{1}_{0}$ n ∞ (p,ε)dp] when all lines have the same free space regardless of their initial load. The optimality of equal free-space allocation is also confirmed on real-world data from the UK National Power Grid.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Benefits of Sparse Tableau Over Nodal Admittance Formulation for Power-Flow Studies

Assembly of power-flow equations has traditionally begun from a nodal analysis formulation of the underlying transmission circuit's behavior. Most power-flow formulations encapsulate network constraints in the bus admittance matrix, Y bus . From a circuit perspective, this admittance representation restricts the network elements to be voltage controlled; resulting drawbacks treating zero-impedance branches in such applications as state estimation have long been recognized. This paper explores the advantages of the alternatives to Y bus -based formulations in power flow. It proposes a sparse tableau formulation (STF), and it demonstrates its computational efficiency, robustness, and generality in detailed comparison to traditional Y bus -based solution algorithms. In the examples of power networks ranging from 1888 to 82 000 buses, computational case studies indicate that STF provides comparable computational speed, while allowing simple treatment of zero-impedance branches and more reliably converging to solutions in many cases for which Y bus -based Newton algorithms diverge.

42 ENGINEERING↗

Analysis of Electricity Price Differentials for the Utah Office of Energy Development

Operation Gigawatt is a vision for Utah to meet its growing energy needs with a focus on doubling energy generation. One of the greatest challenges to meet this goal will be the transmission and distribution system. Utah seeks analysis to inform discussions on new generation, the likely network congestion based on new power flows, and modeling of the state's energy infrastructure. To support this need, LBNL developed a baseline understanding of recent historical congestion in the existing transmission system based on electricity market prices. The resulting products visualize and provide metrics on congestion within Utah and between Utah and its neighbors during 2015-2023.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Finding Hidden Patterns in High Resolution Wind Flow Model Simulations

Wind flow data is critical in terms of investment decisions and policy making. High resolution data from wind flow model simulations serve as a supplement to the limited resource of original wind flow data collection. Given the large size of data, finding hidden patterns in wind flow model simulations are critical for reducing the dimensionality of the analysis. In this work, we first perform dimension reduction with two autoencoder models: the CNN-based autoencoder (CNN-AE) [1], and hierarchical autoencoder (HIER-AE) [2], and compare their performance with the Principal Component Analysis (PCA). We then investigate the super-resolution of the wind flow data. By training a Generative Adversarial Network (GAN) with 300 epochs, we obtained a trained model with 2× resolution enhancement. We compare the results of GAN with Convolutional Neural Network (CNN), and GAN results show finer structure as expected in the data field images. Also, the kinetic energy spectra comparisons show that GAN outperforms CNN in terms of reproducing the physical properties for high wavenumbers and is critical for analysis where high-wavenumber kinetics play an important role.

97 MATHEMATICS AND COMPUTING↗

Simulation of solute transport through heterogeneous networks: analysis using the method of moments and the statistics of local transport characteristics

We used a time domain random walk approach to simulate passive solute transport in networks. In individual pores, solute transport was modeled as a combination of Poiseuille flow and Taylor dispersion. The solute plume data were interpreted via the method of moments. Analysis of the first and second moments showed that the longitudinal dispersivity increased with increasing coefficient of variation of the pore radii CV and decreasing pore coordination number Z. The third moment was negative and its magnitude grew linearly with time, meaning that the simulated dispersion was intrinsically non-Fickian. The statistics of the Eulerian mean fluid velocities $\hat{u}_i$, the Taylor dispersion coefficients $\hat{D}_i$ and the transit times $\hat{t}_i$ were very complex and strongly affected by CV and Z. In particular, the probability of occurrence of negative velocities grew with increasing CV and decreasing Z. Hence, backward and forward transit times had to be distinguished. The high-τ branch of the transit-times probability curves had a power law form associated to non-Fickian behavior. However, the exponent was insensitive to pore connectivity, although variations of Z affected the third moment growth. Thus, we conclude that both the low- and high-τ branches played a role in generating the observed non-Fickian behavior.

Li, Min↗

File servers, networking, and supercomputers

One of the major tasks of a supercomputer center is managing the massive amount of data generated by application codes. A data flow analysis of the San Diego Supercomputer Center is presented that illustrates the hierarchical data buffering/caching capacity requirements and the associated I/O throughput requirements needed to sustain file service and archival storage. Usage paradigms are examined for both tightly-coupled and loosely-coupled file servers linked to the supercomputer by high-speed networks.

Moore, Reagan W.↗

File servers, networking, and supercomputers

One of the major tasks of a supercomputer center is managing the massive amount of data generated by application codes. A data flow analysis of the San Diego Supercomputer Center is presented that illustrates the hierarchical data buffering/caching capacity requirements and the associated I/O throughput requirements needed to sustain file service and archival storage. Usage paradigms are examined for both tightly-coupled and loosely-coupled file servers linked to the supercomputer by high-speed networks.

Moore, Reagan W.↗

Analyzing Impact of Distributed PV Generation on Integrated Transmission & Distribution System Voltage Stability—A Graph Trace Analysis Based Approach

The use of a Graph Trace Analysis (GTA)-based power flow for analyzing the voltage stability of integrated Transmission and Distribution (T&D) networks is discussed in the context of distributed Photovoltaic (PV) generation. The voltage stability of lines and the load carrying capability of buses is analyzed at various PV penetration levels. It is shown that as the PV generation levels increase, an increase in the steady state voltage stability of the system is observed. Moreover, within certain regions of stability margin changes, changes in voltage stability margins of transmission lines are shown to be linearly related to changes in the loading of the lines. Two case studies are presented, where one case study involves a model with eight voltage levels and 784,000 nodes. In one case study, a voltage-stability heat map is used to demonstrate the identification of weak lines and buses.

14 SOLAR ENERGY↗

Quantifying Dam-Induced Fluctuations in Streamflow Frequencies Across the Colorado River Basin

Periodic fluctuations in natural streamflow are a major driver of river ecosystem dynamics and water resource management. However, most U.S. rivers are impacted both by long-term hydroclimatic trends and dams that alter flow variability. Despite these impacts, it remains largely unexplored how dams affect the dominant frequencies of natural streamflow over a highly regulated river network. We investigated the entire Colorado River Basin (CRB) to understand how the annual (10–14 months) and multi-annual (24–60 months) frequencies in natural flow regimes have been progressively altered by dams. Given the significant alteration over the CRB, we captured changes in streamflow frequencies between naturalized and observed monthly flows via wavelet analysis. Based on the similarity of changes in streamflow frequencies (annual and multi-annual) over the last 30 years, sections of the riverine network were classified into four groups. The annual frequency was relatively well preserved downstream of Hoover Dam, while showing a systematic trend of alteration downstream of Glen Canyon Dam until Hoover Dam. Meanwhile, the multi-annual frequency component was highly altered for the entire Lower Colorado main stem (i.e., downstream of Glen Canyon). We also identified dams with significant impacts on streamflow frequency by comparing wavelet coherence estimates. This study advances the notion that dams fundamentally alter river flow regimes across multiple frequencies and with varying amplitudes over time and space, with alteration propagating – or being dampened – by both hydroclimatic fluctuations and water resource management.

54 ENVIRONMENTAL SCIENCES↗

Transient thermal analysis of fluid systems

Computer program performs transient thermal analysis of any 2-node to 200-node-thermal network, which transports heat by fluid flow convection. Program can be modified to add conduction along tubes and radiation.

Chandler, G. D.↗

Scientometric methods for identifying emerging technologies

Provided is a method of generating a scientometric model that tracks the emergence of an identified technology from initial discovery (via original scientific and conference literature), through critical discoveries (via original scientific, conference literature and patents), transitioning through Technology Readiness Levels (TRLs) and ultimately on to commercial application. During the period of innovation and technology transfer, the impact of scholarly works, patents and on-line web news sources are identified. As trends develop, currency of citations, collaboration indicators, and on-line news patterns are identified. The combinations of four distinct and separate searchable on-line networked sources (i.e., scholarly publications and citation, worldwide patents, news archives, and on-line mapping networks) are assembled to become one collective network (a dataset for analysis of relations). This established network becomes the basis from which to quickly analyze the temporal flow of activity (searchable events) for the example subject domain.

42 ENGINEERING↗