A computational geometry approach to simplicial Nyquist maps in robust stability

In this paper we use combinatorial and computational geometry techniques to make the simplicial approximation theorem a computational, rather than conceptual, tool to check robust stability for systems that are not in Kharitonov´s class. A simplicial program was developed with a O(n log n) time complexity, where n is the cardinality of the vertex set of points mapped to the complex plane, using the Nyquist map f.