Stability of bundles of dynamic systems and related problems (Q1580182)

In this article, problems that generalize the classical problems connected with asymptotic stability of dynamical systems are considered, and methods of their solution are presented. These methods permit one to estimate the combinatorial computational time complexity of the problems and their decision algorithms based on the results of Routh, Hurwitz, Liénard and Chipart, and also to estimate some results of Lyapunov, Chebyshev and Markov from the viewpoint of computational stability. The approach is based on the known work on the decidability of the theory of real-closed fields. For a number of considered problems whose solution is either ``yes'' or ``no,'' \ the author formulates necessary and sufficient conditions similar to the Hurwitz or Liénard-Chipart theorems for polynomials with numerical coefficients. These results naturally follow from the classical results.