On perturbations of roots of polynomials (Q914879): Difference between revisions

In the study of the ``Geometry of polynomials'' [\textit{M. Marden} (1966; Zbl 0162.371)], the location of the zeros of combinations of polynomials is described. The theorems identify the region containing all the roots of the given polynomials. The behavior of the individual roots is not described and those results differ markedly from the main theorem in this paper which is closely related to Rouché's theorem. It states: Let P(z) be a polynomial of degree n with leading coefficient 1, r(z) some polynomial of degree \(\leq (n-1)\) and let \[ P(z)=(z-q_ 1)...(z-q_ n),\quad P(z)+r(z)=(z-\tilde q_ 1)...(z-\tilde q_ n). \] If the roots \(\tilde q_ 1,...,q_ n\) of \(P(z)+r(z)\) can be indexed so that \[ | q_ i-\tilde q_ i| \leq \rho,\quad i=1,...,n, \] then for any nonempty subset \(\gamma =\{q_{i_ 1},...,q_{i_ m}\}\) of the zeros of P(z) the following estimate holds \[ | r[\gamma]| \leq P_{\gamma}(\rho,| q_ i-q_ j|), \] where r[\(\gamma\) ] is the (m-1)th divided difference of r(z), calculated at the points \(q_{i_ 1},...,q_{i_ m}\). If \(m=1\), then r[\(\gamma\) ] is the value of r(z) at the point \(q_{i_ 1}.\) The disadvantage of the theorem is the number of inequalities contained is \((2^ n-1).\) The author demonstrates in his proof that it is necessary only to check at most \(n^ 2\) of the inequalities. The other disadvantage noted is that the magnitude of the perturbation of each root is not given separately. Applications are considered where the perturbations r(z) are linear with respect to P(z). For example, \(r(z)=AP(z)\) where A is a differential operator of order n having constant coefficients that satisfy certain inequalities.