期刊
ACM COMMUNICATIONS IN COMPUTER ALGEBRA
卷 54, 期 3, 页码 100-104出版社
ASSOC COMPUTING MACHINERY
DOI: 10.1145/3457341.3457346
关键词
-
We propose solving the power flow equations using monodromy. We prove the variety under consideration decomposes into trivial and nontrivial subvarieties and that the nontrivial subvariety is irreducible. We also show various symmetries in the solutions. We finish by giving numerical results comparing monodromy against polyhedral and total degree homotopy methods and giving an example of a network where we can find all solutions to the power flow equation using monodromy where other homotopy techniques fail. This work gives hope that finding all solutions to the power flow equations for networks of realistic size is possible.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据