SparseJSR: A fast algorithm to compute joint spectral radius via sparse SOS decompositions
This paper focuses on the computation of the joint spectral radius (JSR), when the involved matrices are sparse. We provide a sparse variant of the procedure proposed by Parrilo and Jadbabaie to compute upper bounds of the JSR by means of sum-of-squares (SOS) programming. Our resulting iterative algorithm, called SparseJSR, is based on the term sparsity SOS (TSSOS) framework developed by Wang, Mag