中文摘要：

估计一个多项式系统的孤立的根的数字是在代数学的几何学而且为解决多项式系统的 homotopy 方法的重要 subproblem 的一个基本学习主题不仅。为混合三角法的多项式系统，哪个比多项式系统并且相当经常更一般发生在许多应用程序，古典 B 潯 ? 慦瑩吗？

英文摘要：

Estimating the number of isolated roots of a polynomial system is not only a fundamental study theme in algebraic geometry but also an important subproblem of homotopy methods for solving polynomial systems. For the mixed trigonometric polynomial systems, which are more general than polynomial systems and rather frequently occur in many applications, the classical B6zout number and the multihomogeneous Bezout number are the best known upper bounds on the number of isolated roots. However, for the deficient mixed trigonometric polynomial systems, these two upper bounds are far greater than the actual number of isolated roots. The BKK bound is known as the most accurate upper bound on the number of isolated roots of a polynomial system. However, the extension of the definition of the BKK bound allowing it to treat mixed trigonometric polynomial systems is very difficult due to the existence of sine and cosine functions. In this paper, two new upper bounds on the number of isolated roots of a mixed trigonometric polynomial system are defined and the corresponding efficient algorithms for calculating them are presented. Numerical tests are also given to show the accuracy of these two definitions, and numerically prove they can provide tighter upper bounds on the number of isolated roots of a mixed trigonometric polynomial system than the existing upper bounds, and also the authors compare the computational time for calculating these two upper bounds.