We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

A test for root-clustering transformability

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Gutman, S. ; University of California, Berkeley, CA, USA

Consider the problem of root clustering: given a square matrix A with spectrum \sigma (A) , for what region S in the complex plane is it possible to state a criterion (necessary and sufficient conditions) so that \sigma (A) \in S ? Recently it has been shown that one subclass Ω of S satisfies a certain transformability condition. In this note we test transformability via polynomial global nonnegativity.

Published in:

Automatic Control, IEEE Transactions on  (Volume:27 ,  Issue: 4 )