A stable polynomial is a real polynomial for which all its roots
lie in the left half-plane. The term "stable"
is used to describe such a polynomial because, in the theory of linear servomechanisms,
a system exhibits unforced time-dependent motion of the form
, where
is the root of a certain real
polynomial
. A system is therefore mechanically
stable iff
is a stable polynomial.
The polynomial is stable iff
, and the polynomial
is stable iff
both
and
are greater than zero. The Routh-Hurwitz theorem
can be used to determine if a polynomial is stable.
Given two real polynomials and
, if
and
are stable, then so is their product
, and vice versa (Séroul 2000, p. 280).
It therefore follows that the coefficients of stable
real polynomials are either all positive
or all negative (although this is not a sufficient
condition, as shown with the counterexample
). Furthermore, the
values of a stable polynomial are never zero for
and have the same sign as its coefficients.
A stable polynomial with positive leading
coefficient is a Hurwitz polynomial.
Root location can also be tested by quantifier elimination. For a real polynomial , stability is equivalent to
|
(1)
|
Here
and
denote the real part and imaginary
part, respectively. If the coefficients depend
polynomially on real parameters,
eliminating
and
gives a condition solely on those parameters (Hong
et al. 1997, Trott 2006).
It is possible to decide if a polynomial is stable without first knowing its roots using the following theorem
due to Strelitz (1977). Let be a real
polynomial with roots
, ...,
, and construct
as the monic
polynomial with real coefficients
of polynomial degree
having roots
for
. Then
is stable iff all coefficients
of
and
are positive (Séroul 2000, p. 281).
For example, given the cubic polynomial , the sum-of-roots polynomial
is given by
|
(2)
|
Resolving the inequalities given by requiring that each coefficient of and
be greater than zero then gives the conditions for
to be stable as
,
,
.
Similarly, for the polynomial of polynomial
degree 4, the sum-of-roots polynomial is
|
(3)
|
so the condition for
to be stable can be resolved to
,
,
,
.
For , the sum-of-roots polynomial
is
|
(4)
|
The following Wolfram Language code computes the sum-of-roots polynomial and inequalities obtained from
the coefficients:
RootSumPolynomial[r_List, x_]:=Module[
{n = Length[r], i, j},
RootReduce@Collect[Expand[
Times@@((x - #)&/@Flatten[
Table[r[[i]] + r[[j]], {i, n},
{j, i+1, n}]])
], x]
]
RootSumPolynomial[p_?PolynomialQ, x_]:=
RootSumPolynomial[RootList[p, x], x]
RootList[p_?PolynomialQ, x_]:=
x /. {ToRules[Roots[p==0, x,
Cubics -> False, Quartics -> False
]]}
RootSumInequalities[p_?PolynomialQ, x_]:=
And @@ (# > 0& /@
Flatten[CoefficientList[#, x]& /@
{RootSumPolynomial[p, x], p}])
while the following reduces the inequalities to a minimal set in the cubic case:
Resolve[Exists[x, Element[(a | b | c | x), Reals],
RootSumInequalities[x^3 + a x^2 + b x + c, x]
], {a, b, c}]