An interval approach to compute invariant sets

Thomas Le Mézo, Luc Jaulin and Benoît Zerr



This microsite presents the educational and easy-to-use solver named cycle associated to the paper
An interval approach to compute invariant sets, by Thomas Le Mézo, Luc Jaulin and Benoît Zerr, Submitted to IEEE - Transactions on Automatic Control.

Download Cycle SOLVER (for Ubuntu 16.04, without Qt5 - 834Ko).
Download Cycle SOLVER standalone (for Ubuntu 16.04, with Qt5 embedded - 98Mo).
Download Cycle SOLVER sources.

Video 1 provides a short presentation of the solver cycle.

Video 2 shows how cycle can be stop to compute a positive invariant set associated to a stable invariant set. Here, we have chosen the Van der Pol system.

Video 3 shows how cycle can be used to to detect all invariant sets associated to a non-linear system. This is illustrated here on the Van der Pol system, where we are able to detect 4 invariant sets: the cycle, the equilibrium point, the union of them and the limit cycle with its interior.

Video 4 shows how cycle can compare our method with a griding method.