Explore the vast range of titles available.

This study proposes a computationally efficient algorithm that characterises the set of allowable real parametric uncertainties while ensuring the desired output specifications are satisfied for rational systems. Along with the scaled main loop theorem, the proposed approach reformulates this NP-hard problem by using the skewed structured singular value ν, whose upper and lower bounds can be efficiently computed by existing algorithms and software. A short discussion on the extension to a multi-agent system is also included. Two numerical examples of pharmaceutical crystallisation and nasal spray demonstrate the effectiveness of the proposed algorithm.