Polytope norms and related algorithms for the computation of the joint spectral radius | IEEE Conference Publication | IEEE Xplore
Scheduled Maintenance: On Tuesday, 25 February, IEEE Xplore will undergo scheduled maintenance from 1:00-5:00 PM ET (1800-2200 UTC). During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

Polytope norms and related algorithms for the computation of the joint spectral radius


Abstract:

We address the problem of the computation of the spectral radius of a family of matrices. We briefly describe the extension of the concept of polytope to the complex spac...Show More

Abstract:

We address the problem of the computation of the spectral radius of a family of matrices. We briefly describe the extension of the concept of polytope to the complex space and outline the main geometric properties of such an object. Then we consider the norms determined by the complex polytopes and illustrate a possible algorithm for the approximation of the joint spectral radius of a family of matrices which is based on these complex polytope norms. As an example for our technique we consider the set of two matrices recently analyzed by Blondel, Nesterov and Theys to disprove the finiteness conjecture.
Date of Conference: 15-15 December 2005
Date Added to IEEE Xplore: 30 January 2006
Print ISBN:0-7803-9567-0
Print ISSN: 0191-2216
Conference Location: Seville, Spain

References

References is not available for this document.