Name
Title | ||
|---|---|---|
A Network Topology Dependent Upper Bound on the Number of Equilibria of the Kuramoto Model. |
Abstract | ||
|---|---|---|
We begin with formulating the stationary equations of the Kuramoto model as a system of polynomial equations in a novel way. Then, based on an algebraic geometric root count, we give a prescription of computing an upper bound on the number of equilibria of the Kuramoto model for the most general case, i.e., defined on an arbitrary graph and having generic values of natural frequencies and inhomogeneous couplings. We demonstrate with computational experiments utilizing the numerical polynomial homotopy continuation method that our bound is tight for the number of complex equilibria for the Kuramoto model in the most general case. We then discuss the implications or our results in relation to finding all the real equilibria of the Kuramoto model. |
Year | Venue | Field |
|---|---|---|
2016 | arXiv: Optimization and Control | Graph,Discrete mathematics,Algebraic geometric,Mathematical optimization,Coupling,Polynomial,Upper and lower bounds,System of polynomial equations,Network topology,Kuramoto model,Mathematics |
DocType | Volume | Citations |
Journal | abs/1603.05905 | 2 |
PageRank | References | Authors |
0.39 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tianran Chen | 1 | 9 | 4.17 |
| Dhagash Mehta | 2 | 15 | 8.26 |
| Matthew E. Niemerg | 3 | 6 | 2.53 |