Root clustering for rational convex regions (Q1062112)

The root clustering problem is to find necessary and sufficient conditions for the spectrum of a given real matrix A to lie in some algebraic region. This paper is focused on root clustering (exclusion) with respect to rational convex regions. For root clustering the region is constructed as an intersection of infinite number of half planes, and for root exclusion by the exterior of infinite number of circles. The root clustering (exclusion) test involves the positivity of a set of polynomials with respect to the region's parameter. This is done by using the Sturm procedure.