Computational complexity of robust schur stability analysis by the generalized stability feeler

The paper gives the computational complexity of the robust Schur stability analysis by the generalized stability feeler. Computational complexity of robust stability analysis is considered as an important characteristic to evaluate robust stability analysis methods. We derive the computational complexity from the algorithm of the generalized stability feeler. The result shows that the robust Schur stability can be checked in polynomial time.