Fast parallel-frequency-sweeping algorithms for robust D-stability margin

This paper considers the robust D-stability margin problem under polynomic structured real parametric uncertainty. Based on the work of de Gaston and Safonov (1988), we have developed techniques such as, a parallel-frequency-sweeping strategy, different domain-splitting schemes, which significantly reduce the computational complexity and guarantee the convergence.