Abstract
We show that the problem of exact computation of the joint spectral radius of a finite set of rank one matrices can be reformulated as the problem of computing the maximum cycle mean in a directed graph and hence be solved efficiently.
| Original language | English (US) |
|---|---|
| Article number | 6425992 |
| Pages (from-to) | 731-733 |
| Number of pages | 3 |
| Journal | Proceedings of the IEEE Conference on Decision and Control |
| DOIs | |
| State | Published - 2012 |
| Externally published | Yes |
| Event | 51st IEEE Conference on Decision and Control, CDC 2012 - Maui, HI, United States Duration: Dec 10 2012 → Dec 13 2012 |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Modeling and Simulation
- Control and Optimization