Integer type:  int32  int64  nag_int  show int32  show int32  show int64  show int64  show nag_int  show nag_int

Chapter Contents
Chapter Introduction
NAG Toolbox

# NAG Toolbox Chapter IntroductionC02 — zeros of polynomials

## Scope of the Chapter

This chapter is concerned with computing the zeros of a polynomial with real or complex coefficients.

## Background to the Problems

Let $f\left(z\right)$ be a polynomial of degree $n$ with complex coefficients ${a}_{i}$:
 $fz≡a0zn+a1zn-1+a2zn-2+⋯+an-1z+an, a0≠0.$
A complex number ${z}_{1}$ is called a zero of $f\left(z\right)$ (or equivalently a root of the equation $f\left(z\right)=0$), if
 $fz1=0.$
If ${z}_{1}$ is a zero, then $f\left(z\right)$ can be divided by a factor $\left(z-{z}_{1}\right)$:
 $fz=z-z1f1z$ (1)
where ${f}_{1}\left(z\right)$ is a polynomial of degree $n-1$. By the Fundamental Theorem of Algebra, a polynomial $f\left(z\right)$ always has a zero, and so the process of dividing out factors $\left(z-{z}_{i}\right)$ can be continued until we have a complete factorization of $f\left(z\right)$:
 $fz≡a0z-z1z-z2…z-zn.$
Here the complex numbers ${z}_{1},{z}_{2},\dots ,{z}_{n}$ are the zeros of $f\left(z\right)$; they may not all be distinct, so it is sometimes more convenient to write
 $fz≡a0z-z1m1z-z2m2…z-zkmk, k≤n,$
with distinct zeros ${z}_{1},{z}_{2},\dots ,{z}_{k}$ and multiplicities ${m}_{i}\ge 1$. If ${m}_{i}=1$, ${z}_{i}$ is called a simple or isolated zero; if ${m}_{i}>1$, ${z}_{i}$ is called a multiple or repeated zero; a multiple zero is also a zero of the derivative of $f\left(z\right)$.
If the coefficients of $f\left(z\right)$ are all real, then the zeros of $f\left(z\right)$ are either real or else occur as pairs of conjugate complex numbers $x+iy$ and $x-iy$. A pair of complex conjugate zeros are the zeros of a quadratic factor of $f\left(z\right)$, $\left({z}^{2}+rz+s\right)$, with real coefficients $r$ and $s$.
Mathematicians are accustomed to thinking of polynomials as pleasantly simple functions to work with. However, the problem of numerically computing the zeros of an arbitrary polynomial is far from simple. A great variety of algorithms have been proposed, of which a number have been widely used in practice; for a fairly comprehensive survey, see Householder (1970). All general algorithms are iterative. Most converge to one zero at a time; the corresponding factor can then be divided out as in equation (1) above – this process is called deflation or, loosely, dividing out the zero – and the algorithm can be applied again to the polynomial ${f}_{1}\left(z\right)$. A pair of complex conjugate zeros can be divided out together – this corresponds to dividing $f\left(z\right)$ by a quadratic factor.
Whatever the theoretical basis of the algorithm, a number of practical problems arise; for a thorough discussion of some of them see Peters and Wilkinson (1971) and Chapter 2 of Wilkinson (1963). The most elementary point is that, even if ${z}_{1}$ is mathematically an exact zero of $f\left(z\right)$, because of the fundamental limitations of computer arithmetic the computed value of $f\left({z}_{1}\right)$ will not necessarily be exactly $0.0$. In practice there is usually a small region of values of $z$ about the exact zero at which the computed value of $f\left(z\right)$ becomes swamped by rounding errors. Moreover, in many algorithms this inaccuracy in the computed value of $f\left(z\right)$ results in a similar inaccuracy in the computed step from one iterate to the next. This limits the precision with which any zero can be computed. Deflation is another potential cause of trouble, since, in the notation of equation (1), the computed coefficients of ${f}_{1}\left(z\right)$ will not be completely accurate, especially if ${z}_{1}$ is not an exact zero of $f\left(z\right)$; so the zeros of the computed ${f}_{1}\left(z\right)$ will deviate from the zeros of $f\left(z\right)$.
A zero is called ill-conditioned if it is sensitive to small changes in the coefficients of the polynomial. An ill-conditioned zero is likewise sensitive to the computational inaccuracies just mentioned. Conversely a zero is called well-conditioned if it is comparatively insensitive to such perturbations. Roughly speaking a zero which is well separated from other zeros is well-conditioned, while zeros which are close together are ill-conditioned, but in talking about ‘closeness’ the decisive factor is not the absolute distance between neighbouring zeros but their ratio: if the ratio is close to one the zeros are ill-conditioned. In particular, multiple zeros are ill-conditioned. A multiple zero is usually split into a cluster of zeros by perturbations in the polynomial or computational inaccuracies.

## Recommendations on Choice and Use of Available Functions

 All zeros of cubic,
 complex coefficients nag_zeros_cubic_complex (c02am)
 real coefficients nag_zeros_cubic_real (c02ak)
 All zeros of polynomial,
 complex coefficients,
 modified Laguerre's method nag_zeros_poly_complex (c02af)
 real coefficients,
 modified Laguerre's method nag_zeros_poly_real (c02ag)
 All zeros of quartic,
 complex coefficients nag_zeros_quartic_complex (c02an)
 real coefficients nag_zeros_quartic_real (c02al)

## References

Householder A S (1970) The Numerical Treatment of a Single Nonlinear Equation McGraw–Hill
Peters G and Wilkinson J H (1971) Practical problems arising in the solution of polynomial equations J. Inst. Maths. Applics. 8 16–35
Thompson K W (1991) Error analysis for polynomial solvers Fortran Journal (Volume 3) 3 10–13
Wilkinson J H (1963) Rounding Errors in Algebraic Processes HMSO