The Joint Spectral Radius of a set of matrices characterizes the maximal asymptotic rate of growth of a product of matrices taken in this set, when the
length of the product increases.
It is known to be very hard to compute. In recent years, many different methods have been proposed to approximate it.
These methods have different advantages, depending on the application considered, the type of matrices considered, the desired accuracy or running time, etc.
The goal of this toolbox is to provide the practioner with the best available methods, and propose an easy tool for the researcher to compare the different methods.
This is version 1.2. Please report any bug, comment or suggestion to firstname.lastname@example.org
Fixed the 1D bug
Fixed a bug: now treats as a special case the one-by-one matrices.
We fixed some bugs related to sets of matrices with a spectral radius equal to zero.
Technical update for some minor modifications
Set version to 1.1
Addition: Method jsr_pathcomplete.m and some useful subroutines
Change : Some functions use the interface solve_semi_definite_program instead of calling directly SeDuMi
Fix : memory bug in jsr_lift_semidefinite.m
Bug fixed, see changelog.txt.
Replaced two methods under GNU license by genuine ones (vec.m and mat.m).
We have fixed a few minor bugs, updated methods according to the recent literature (in particular jsr.m),
improved usability, and added a benchmark. See ChangeLog.txt for an exhaustive list.
two overflow bugs fixed (in jsr_prod_Gripenberg and jsr_prod_pruning_Algorithm)
readme updated: please use sedumi version 1.3
contact address updated
email contact address: email@example.com
Inspired: The CSSystem toolbox