Abstract
The notion of spectral radius of a set of matrices is a natural extension of spectral radius of a single matrix. The finiteness conjecture (FC) claims that among the infinite products made from the elements of a given finite set of matrices, there is a certain periodic product, made from the repetition of the optimal product, whose rate of growth is maximal. FC has been disproved. In this paper it is conjectured that FC is almost always true, and an algorithm is presented to verify the optimality of a given product. The algorithm uses optimal norms, as a special subset of extremal norms. Several conjectures related to optimal norms and non-decomposable sets of matrices are presented. The algorithm has successfully calculated the spectral radius of several parametric families of pairs of matrices associated with compactly supported multi-resolution analyses and wavelets. The results of related numerical experiments are presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.