Lehmer–Schur Algorithm

In mathematics, the Lehmer–Schur algorithm (named after Derrick Henry Lehmer and Issai Schur) is a root-finding algorithm for complex polynomials, extending the idea of enclosing roots like in the one-dimensional bisection method to the complex plane. It uses the Schur-Cohn test to test increasingly smaller disks for the presence or absence of roots.

Schur-Cohn algorithm

This algorithm allows one to find the distribution of the roots of a complex polynomial with respect to the unit circle in the complex plane. It is based on two auxiliary polynomials, introduced by Schur.

For a complex polynomial $p$ of degree $n$ its ''reciprocal adjoint polynomial'' $p^$ is defined by $p^(z) = z^\overline$ and its ''Schur Transform'' $Tp$ by

:$Tp =\overlinep-\overlinep^*,$
where a bar denotes complex conjugation.

So, if $p(z) = a_z^+\cdots+a_z +a_$ with $a_n\neq 0$, then
$p^(z) = \bar_z^+ \bar_z^+\cdots+\bar_$,
with leading zero-terms, if any, removed. The coefficients of $Tp$ can therefore be directly expressed in those of $p$ and, since one or more leading coefficients cancel, $Tp$ has lower degree than $p$. The roots of $p$, $p^$, and $Tp$ are related as follows.

;Lemma
Let $p$ be a complex polynomial and $\delta = (Tp)(0)$.
*The roots of $p^$, including their multiplicities, are the images under inversion in the unit circle of the non-zero roots of $p$.
* If $\delta \neq 0$, then $p,\,p^*$, and $Tp$ share roots on the unit circle, including their multiplicities.
* If $\delta>0$, then $p$ and $Tp$ have the same number of roots inside the unit circle.
* If $\delta<0$, then $p^*$ and $Tp$ have the same number of roots inside the unit circle.

;Proof
Along the unit circle $, z, = 1$ we have $1/\overline = z$ and $, z^n, = 1$ which, substituted into the formula $p^(z) = z^\overline$ yields the identity
$, p^*(z), = , p(z),$ for $, z, =1$.
Also $\delta \neq 0$ implies $, p(0), \neq , p^*(0),$. From this and the definitions above the first two statements follow.
The other two statements are a consequence of Rouché's theorem applied on the unit circle to the functions $\overlinep(z)/r(z)$ and $-\overlinep^*(z)/r(z)$ , where $r$ is a polynomial that has as its roots the roots of $p$ on the unit circle, with the same multiplicities. □

For a more accessible representation of the lemma,
let $n^-_p,n^0_p$, and $n^+_p$ denote the number of roots of $p$ inside, on, and outside the unit circle respectively and similarly for $Tp$.
Moreover let $d$ be the difference in degree of $p$ and $Tp$. Then the lemma implies that
$(n^-_p,\;n^0_p,\;n^+_p)=(n^-_,\;n^0_,\;n^+_+d)$ if $\delta>0$ and
$(n^-_p,\;n^0_p,\;n^+_p)=(n^+_+d,\;n^0_,\;n^-_)$ if $\delta<0$
(note the interchange of $^+$ and $^-$).

Now consider the sequence of polynomials $T^p$ $(k=0,1,\ldots)$, where $T^0 p=p$ and $T^p=T(T^p)$.
Application of the foregoing to each pair of consecutive members of this sequence gives the following result.

;Theorem chur-Cohn testLet $p$ be a complex polynomial with $Tp\neq0$ and let $K$ be the smallest number such that $T^p=0$. Moreover let $\delta_k=(T^p)(0)$ for $k=1,\ldots,K$ and $d_= \deg T^p$ for $k=0,\ldots,K$.
* All roots of $p$ lie inside the unit circle if and only if
$\delta_1<0$, $\delta_k>0$ for $k=2,\ldots,K$, and $d_=0$.
* All roots of $p$ lie outside the unit circle if and only if
$\delta_k>0$ for $k=1,\ldots,K$ and $d_=0$.
* If $d_=0$ and if $\delta_k < 0$ for $k=k_0,k_1 \ldots k_m$ (in increasing order) and $\delta_k > 0$ otherwise, then $p$ has no roots on the unit circle and the number of roots of $p$ inside the unit circle is
:$\sum_^m (-1)^i d_$.

More generally, the distribution of the roots of a polynomial $p$ with respect to an arbitrary circle in the complex plane, say one with centre $c$ and radius $\rho$, can be found by application of the Schur-Cohn test to the 'shifted and scaled' polynomial $q$ defined by $q(z)=p(c+\rho\,z)$.

Not every scaling factor is allowed, however, for the Schur-Cohn test can be applied to the polynomial $q$ only if none of the following equalities occur: $T^q(0)=0$ for some $k=1,\ldots K$ or $T^q=0$ while $d_K>0$. Now, the coefficients of the polynomials $T^q$ are polynomials in $\rho$ and the said equalities result in polynomial equations for $\rho$, which therefore hold for only finitely many values of $\rho$. So a suitable scaling factor can always be found, even arbitrarily close to $1$.

Lehmer's method

Lehmers method is as follows.

For a given complex polynomial $p$, with the Schur-Cohn test a circular disk can be found large enough to contain all roots of $p$. Next this disk can be covered with a set of overlapping smaller disks, one of them placed concentrically and the remaining ones evenly spread over the annulus yet to be covered. From this set, using the test again, disks containing no root of $p$ can be removed. With each of the remaining disks this procedure of covering and removal can be repeated and so any number of times, resulting in a set of arbitrarily small disks that together contain all roots of $p$.

The merits of the method are that it consists of repetition of a single procedure and that all roots are found simultaneously, whether they are real or complex, single, multiple or clustered. Also deflation, i.e. removal of roots already found, is not needed and every test starts with the full-precision, original polynomial. And, remarkably, this polynomial has never to be evaluated.

However, the smaller the disks become, the more the coefficients of the corresponding 'scaled' polynomials will differ in relative magnitude. This may cause overflow or underflow of computer computations, thus limiting the radii of the disks from below and thereby the precision of the computed roots.

.
To avoid extreme scaling, or just for the sake of efficiency, one may start with testing a number of concentric disks for the number of included roots and thus reduce the region where roots occur to a number of narrow , concentric annuli. Repeating this procedure with another centre and combining the results, the said region becomes the union of intersections of such annuli.

Finally, when a small disk is found that contains a single root, that root may be further approximated using other methods, e.g. Newton's method.

References

{{DEFAULTSORT:Lehmer-Schur Algorithm
Root-finding algorithms