Abstract
We consider the general problem of root-clustering of a matrix in the complex plane: Let A \in C^{n \times n} and S \subset C . Find the largest class of S and an algebraic criterion which is necessary and sufficient for \lambda_{i}[A] \in S, i=1,2,..., n . We introduce two types of regions which constitute the largest class of S known to date. The criterion is presented both for open regions and closed ones. The results are used to define a design methodology for control systems. Moreover, all classical results are shown to be special cases of the present theory.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
