Indexed by:期刊论文

First Author:Jiao Libin

Correspondence Author:Dong, B (reprint author), Dalian Univ Technol, Sch Math Sci, Dalian 116024, Peoples R China.

Co-author:Dong Bo,Yu Bo

Date of Publication:2017-08-01

Journal:JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY

Included Journals:SCIE、EI、Scopus

Volume:30

Issue:4

Page Number:967-982

ISSN No.:1009-6124

Key Words:BKK bound; homotopy continuation method; mixed trigonometric polynomial system; mixed volume; polynomial system; upper bound

Abstract: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 Bezout 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.