Abstract
A special homotopy continuation method, as a combination of the polyhedral homotopy and the linear product homotopy, is proposed for computing all the isolated solutions to a special class of polynomial systems. The root number bound of this method is between the total degree bound and the mixed volume bound and can be easily computed. The new algorithm has been implemented as a program called LPH using C++. Our experiments show its efficiency compared to the polyhedral or other homotopies on such systems. As an application, the algorithm can be used to find witness points on each connected component of a real variety.
Cite
CITATION STYLE
Wang, Y., Wu, W., & Xia, B. (2017). A Special Homotopy Continuation Method for a Class of Polynomial Systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10490 LNCS, pp. 362–376). Springer Verlag. https://doi.org/10.1007/978-3-319-66320-3_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
