Details

Autor(en) / Beteiligte

• Tianran Chen
• Mehta, Dhagash

Titel

On the Network Topology Dependent Solution Count of the Algebraic Load Flow Equations

Ist Teil von

• IEEE transactions on power systems, 2018-03, Vol.33 (2), p.1451-1460

Ort / Verlag

IEEE

Erscheinungsjahr

2018

Link zum Volltext

• IEEE_Xplore

Quelle

IEEE/IET Electronic Library (IEL)

Beschreibungen/Notizen

• Active research activity in power systems areas has focused on developing computational methods to solve load flow equations where a key question is the maximum number of solutions. Although several upper bounds exist, recent studies have hinted that much sharper upper bounds that depend on the topology of underlying power networks may exist. This paper provides a significant refinement of these observations. We also develop a geometric construction called adjacency polytope that accurately captures the topology of a power network and is immensely useful in the computation of the solution bound. Finally, we highlight the significant implications of the development of such solution bounds in numerically solving load flow equations.