§1.11 Zeros of Polynomials
Contents
- §1.11(i) Division Algorithm
- §1.11(ii) Elementary Properties
- §1.11(iii) Polynomials of Degrees Two, Three, and Four
- §1.11(iv) Roots of Unity and of Other Constants
- §1.11(v) Stable Polynomials
§1.11(i) Division Algorithm
¶ Horner’s Scheme
Let
Then
where
,
§1.11(ii) Elementary Properties
A polynomial of degree
with real or complex coefficients has exactly
real or complex zeros counting multiplicity. Every monic (coefficient of
highest power is one) polynomial of odd degree with real coefficients has at
least one real zero with sign opposite to that of the constant term. A monic
polynomial of even degree with real coefficients has at least two zeros of
opposite signs when the constant term is negative.
¶ Descartes’ Rule of Signs
The number of positive zeros of a polynomial with real coefficients cannot
exceed the number of times the coefficients change sign, and the two numbers
have same parity. A similar relation holds for the changes in sign of the
coefficients of
, and hence for the number of negative zeros of
.
¶ Example
Both polynomials have one change of sign; hence for each polynomial there is one positive zero, one negative zero, and six complex zeros.
Next, let
. The zeros of
are reciprocals of the zeros
of
.
The discriminant of
is defined by
where
are the zeros of
. The elementary
symmetric functions
of the zeros are (with
)
§1.11(iii) Polynomials of Degrees Two, Three, and Four
¶ Quadratic Equations
The roots of
are
The sum and product of the roots are respectively
and
.
¶ Cubic Equations
Set
to reduce
to
, with
,
. The
discriminant of
is
Let
The roots of
are
with
Addition of
to each of these roots gives the roots of
.
¶ Quartic Equations
Set
to reduce
to
The discriminant of
is
For the roots
of
and the
roots
of the resolvent cubic equation
we have
The square roots are chosen so that
Add
to the roots of
to get those of
.
¶ Example
,
. Resolvent cubic
is
with roots
,
,
, and
,
,
. So
,
,
,
, and the roots of
are
,
.
§1.11(iv) Roots of Unity and of Other Constants
The roots of
are 1,
,
, and of
they are
.
§1.11(v) Stable Polynomials
with real coefficients, is called stable if the real parts of all the zeros are strictly negative.
¶ Hurwitz Criterion
Let
and
where the column vector
consists of the first
members of the
sequence
with
if
or
.
Then
, with
, is stable iff
;
,
;
,
.

