Demonstrating Almost Linear Time Complexity of Bus Admittance Matrix-Based Distribution Network Power Flow: An Empirical Approach
The bus admittance matrix is central to many power system simulation algorithms, but the link between problem size and computation time (i.e., the time complexity) using modern sparse solvers is not fully understood. It has recently been suggested that some popular algorithms used in distribution system power flow analysis have cubic complexity, based on properties of dense matrix numerical algorithms; a tighter theoretical estimate of complexity using sparse solvers is not immediately forthcoming due to these solvers' problem-dependent behaviour. To address this, the time complexity of admittance matrix-based distribution power flow is considered empirically across a library of 75 networks, ranging in size from 50 to 300,000 nodes. Results across four admittance matrix-based methods suggest complexity coefficient values between 1.04 and 1.12, indicating complexity that is instead almost linear. The proposed empirical approach is suggested as a convenient and practical way of benchmarking the scalability of power flow algorithms.
Code (0)
등록된 구현이 없습니다.
Tasks
BenchmarkingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Near-Optimal Algorithms for Gaussians with Huber Contamination: Mean Estimation and Linear Regression
We study the fundamental problems of Gaussian mean estimation and linear regression with Gaussian covariates in the presence of Huber contamination. Our main contribution is the design of the first sample near-optimal an…
regressionAlmost Optimal Proper Learning and Testing Polynomials
We give the first almost optimal polynomial-time proper learning algorithm of Boolean sparse multivariate polynomial under the uniform distribution. For $s$-sparse polynomial over $n$ variables and $\epsilon=1/s^\beta$, …
Beyond Diagonal Reconfigurable Intelligent Surfaces in Wideband OFDM Communications: Circuit-Based Modeling and Optimization
This work investigates the modeling and optimization of beyond diagonal reconfigurable intelligent surface (BD-RIS), which generalizes conventional RIS with diagonal phase shift matrices and provides additional flexibili…
Inverse Power Flow Problem
This paper formulates an inverse power flow problem which is to infer a nodal admittance matrix (hence the network structure of a power system) from voltage and current phasors measured at a number of buses. We show that…
An adaptive admittance controller for collaborative drilling with a robot based on subtask classification via deep learning
In this paper, we propose a supervised learning approach based on an Artificial Neural Network (ANN) model for real-time classification of subtasks in a physical human-robot interaction (pHRI) task involving contact with…