A Special Homotopy Continuation Method For A Class of Polynomial Systems

04/25/2017
by   Yu Wang, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/11/2017

Root Separation for Trinomials

We give a separation bound for the complex roots of a trinomial f ∈Z[X]....
research
02/28/2018

Solving determinantal systems using homotopy techniques

Let be a field of characteristic zero and be an algebraic closure of ....
research
11/09/2022

Certified Numerical Real Root Isolation of Zero-dimensional Multivariate Real Nonlinear Systems

Using the local geometrical properties of a given zero-dimensional squar...
research
04/20/2018

A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems

We present a combination of the Mixed-Echelon-Hermite transformation and...
research
12/15/2017

Counting Solutions of a Polynomial System Locally and Exactly

We propose a symbolic-numeric algorithm to count the number of solutions...
research
11/09/2017

Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems

How many operations do we need on the average to compute an approximate ...
research
07/06/2020

A Family of Denominator Bounds for First Order Linear Recurrence Systems

For linear recurrence systems, the problem of finding rational solutions...

Please sign up or login with your details

Forgot password? Click here to reset