DocumentCode
3162687
Title
Joint spectral radius of rank one matrices and the maximum cycle mean problem
Author
Ahmadi, Amir Ali ; Parrilo, Pablo A.
Author_Institution
Krannert Sch. of Manage., Purdue Univ., West Lafayette, IN, USA
fYear
2012
fDate
10-13 Dec. 2012
Firstpage
731
Lastpage
733
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.
Keywords
directed graphs; matrix algebra; directed graph; exact computation; joint spectral radius; maximum cycle mean problem; rank one matrices; Approximation methods; Eigenvalues and eigenfunctions; Heuristic algorithms; Joints; Linear systems; Lyapunov methods; Switches;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control (CDC), 2012 IEEE 51st Annual Conference on
Conference_Location
Maui, HI
ISSN
0743-1546
Print_ISBN
978-1-4673-2065-8
Electronic_ISBN
0743-1546
Type
conf
DOI
10.1109/CDC.2012.6425992
Filename
6425992
Link To Document