Invariant polytopes of sets of matrices with application to regularity of wavelets and subdivisions

We generalize the recent invariant polytope algorithm for computing the joint spectral radius and extend it to a wider class of matrix sets. This, in particular, makes the algorithm applicable to sets of matrices that have finitely many spectrum maximizing products. A criterion of convergence of the algorithm is proved. As an application we solve two challenging computational open problems. First we find the regularity of the Butterfly subdivision scheme for various parameters Ω. In the "most regular" case Ω = 1/16, we prove that the limit function has Hölder exponent 2 and its derivative is "almost Lipschitz" with logarithmic factor 2. Second we compute the Hölder exponent of Daubechies wavelets of high order.