Abstract
In this paper the problem of the computation of the joint spectral radius of a finite set of matrices is considered. We present an algorithm which, under some suitable assumptions, is able to check if a certain product in the multiplicative semigroup is spectrum maximizing. The algorithm proceeds by attempting to construct a suitable extremal norm for the family, namely a complex polytope norm. As examples for testing our technique, we first consider the set of two 2-dimensional matrices recently analyzed by Blondel, Nesterov and Theys to disprove the finiteness conjecture, and then a set of 3-dimensional matrices arising in the zero-stability analysis of the 4-step BDF formula for ordinary differential equations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
