Chaos Synchronization via Linear Matrix Inequalities: A Comparative Analysis

In this paper, three chaos synchronization approaches using Linear Matrix Inequality (LMI) tools are evaluated and compared. The comparative analysis is supported by four examples of Piecewise affine (PWA) chaotic systems: The Chua’s original circuit, the Chua’s modified system, the Lur’e like circuit and the five-scroll attractor system. To evaluate the performances of each synchronization approach, we examine first, the practical implementation of the LMIs. We analyze then, by simulation results, the feasibility of each approach for each PWA chaotic system. The elapsed time for solving the predefined LMIs and the influence of their tuning parameters’ domain belonging on the feasibility and the performances of each approach are finally the considered comparative criteria.