J. Lindberg, Alisha Zachariah, N. Boston, B. Lesieutre
{"title":"The Geometry of Real Solutions to the Power Flow Equations","authors":"J. Lindberg, Alisha Zachariah, N. Boston, B. Lesieutre","doi":"10.1109/ALLERTON.2018.8635895","DOIUrl":null,"url":null,"abstract":"Analyses of power engineering networks rely on an understanding of the power flow equations, a system of quadratic equations relating power injections and voltages at each node. Finding the number of nontrivial, real solutions to these equations is an active area of study. In this paper we propose that in general for a fixed topology, a single, univariate polynomial whose coefficients are polynomials in the network susceptances suffices for determining the number of nontrivial, real solutions to the power flow equations. We then exploit this polynomial to gain geometric insight to the solution regions for a fixed network where a solution region is the region in the space of susceptances wherein the number of real solutions to the system is some fixed constant. This type of analysis allows easier insight to robustness analysis for varying susceptances. We observe that some solution regions resemble thickened hyperplanes and therefore appear as stripes in our figures.","PeriodicalId":299280,"journal":{"name":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2018.8635895","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
Analyses of power engineering networks rely on an understanding of the power flow equations, a system of quadratic equations relating power injections and voltages at each node. Finding the number of nontrivial, real solutions to these equations is an active area of study. In this paper we propose that in general for a fixed topology, a single, univariate polynomial whose coefficients are polynomials in the network susceptances suffices for determining the number of nontrivial, real solutions to the power flow equations. We then exploit this polynomial to gain geometric insight to the solution regions for a fixed network where a solution region is the region in the space of susceptances wherein the number of real solutions to the system is some fixed constant. This type of analysis allows easier insight to robustness analysis for varying susceptances. We observe that some solution regions resemble thickened hyperplanes and therefore appear as stripes in our figures.