Determination of the number of roots of a polynomial lying in a given algebraic domain (Q2365716)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 222617
Language Label Description Also known as
default for all languages
No label defined
    English
    Determination of the number of roots of a polynomial lying in a given algebraic domain
    scientific article; zbMATH DE number 222617

      Statements

      Determination of the number of roots of a polynomial lying in a given algebraic domain (English)
      0 references
      0 references
      0 references
      29 June 1993
      0 references
      The authors consider the problem of finding the number of roots of a given polynomial \(f\), where \(f\) is a polynomial with complex coefficients in the variable \(z = x + iy\), satisfying a given system of algebraic inequalities \(g_ 1(x,y),\dots,g_ n(x,y) > 0\). This problem arises for example in the stability theory of differential equations or control theory. In 1853-56 Ch. Hermite developed a constructive and purely algebraic method for solving the problem in the case \(n=1\) for the real roots of \(f\) and several classes of \(g_ 1\). First the authors recall Hermite's solution. In the case \(n=1\) they reduce the problem for the nonreal roots of \(f\) to a system of real algebraic equations and by use of elimination theory to Hermite's problem. Then with help of a result due to \textit{A. Markov} [Rec. Math. Moscou, N.S. 7, 3-6 (1940; Zbl 0026.05201)] one obtains a solution of the general problem.
      0 references
      elimination theory
      0 references
      Hermite approach
      0 references
      complex polynomials
      0 references
      number of roots
      0 references
      0 references

      Identifiers