Toward Topologically Based Upper Bounds on the Number of Power Flow Solutions

TL;DR

This paper investigates how the topology of power networks influences the maximum number of solutions to power flow equations, using empirical methods to derive bounds based on network structure.

Contribution

It introduces a topology-based approach to upper bounds on power flow solutions, utilizing numerical polynomial homotopy continuation to empirically relate network structure to solution count.

Findings

Empirically derived expressions for maximum solutions in certain network classes

Use of polynomial homotopy continuation guarantees finding all solutions

Network topology, characterized by maximal cliques, influences solution bounds

Abstract

The power flow equations, which relate power injections and voltage phasors, are at the heart of many electric power system computations. While Newton-based methods typically find the "high-voltage" solution to the power flow equations, which is of primary interest, there are potentially many "low-voltage" solutions that are useful for certain analyses. This paper addresses the number of solutions to the power flow equations. There exist upper bounds on the number of power flow solutions; however, there is only limited work regarding bounds that are functions of network topology. This paper empirically explores the relationship between the network topology, as characterized by the maximal cliques, and the number of power flow solutions. To facilitate this analysis, we use a numerical polynomial homotopy continuation approach that is guaranteed to find all complex solutions to the power flow equations. The number of solutions obtained from this approach upper bounds the number of real solutions. Testing with many small networks informs the development of upper bounds that are functions of the network topology. Initial results include empirically derived expressions for the maximum number of solutions for certain classes of network topologies.