Theorem (Graeffe's
Method). Given
the polynomial
of degree n with real distinct
roots
. Define
the sequence
as
follows:
![]()
is a polynomial of degree n with
roots
for
. Furthermore,
the roots of
are approximated by
for
.
Where the appropriate sign can be determined by
evaluating
.
Proof.
Using the root squaring theorem, the first
iteration produces
which is a polynomial of degree n
with roots
.
The second iteration produces
which is a polynomial of degree n
with roots
.
The third iteration produces
which is a polynomial of degree n
with roots
.
Assume that we have
then
the k-th iteration produces
which is a polynomial of degree n
with roots
.
Therefore, by mathematical
induction the process can be carried out indefinitely, but
for practical purposes we use a finite number of terms of the
sequence
.
References
(c) John H. Mathews 2005