Counting Solutions of a Polynomial System Locally and Exactly

12/15/2017
by   Ruben Becker, et al.
0

We propose a symbolic-numeric algorithm to count the number of solutions of a polynomial system within a local region. More specifically, given a zero-dimensional system f_1=...=f_n=0, with f_i∈C[x_1,...,x_n], and a polydisc Δ⊂C^n, our method aims to certify the existence of k solutions (counted with multiplicity) within the polydisc. In case of success, it yields the correct result under guarantee. Otherwise, no information is given. However, we show that our algorithm always succeeds if Δ is sufficiently small and well-isolating for a k-fold solution z of the system. Our analysis of the algorithm further yields a bound on the size of the polydisc for which our algorithm succeeds under guarantee. This bound depends on local parameters such as the size and multiplicity of z as well as the distances between z and all other solutions. Efficiency of our method stems from the fact that we reduce the problem of counting the roots in Δ of the original system to the problem of solving a truncated system of degree k. In particular, if the multiplicity k of z is small compared to the total degrees of the polynomials f_i, our method considerably improves upon known complete and certified methods. For the special case of a bivariate system, we report on an implementation of our algorithm, and show experimentally that our algorithm leads to a significant improvement, when integrated as inclusion predicate into an elimination method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/26/2018

Local solution clustering for a triangular system of polynomials

This report is about finding clusters of complex solutions of triangular...
research
06/26/2018

Clustering Complex Zeros of Triangular System of Polynomials

This report is about finding clusters of complex solutions of triangular...
research
04/25/2017

A Special Homotopy Continuation Method For A Class of Polynomial Systems

A special homotopy continuation method, as a combination of the polyhedr...
research
04/29/2016

On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection

Given a zero-dimensional polynomial system consisting of n integer polyn...
research
07/16/2018

Fast Witness Counting

We study the witness-counting problem: given a set of vectors V in the d...
research
06/04/2019

A deterministic algorithm for counting colorings with 2Δ colors

We give a polynomial time deterministic approximation algorithm (an FPTA...
research
08/15/2019

Probabilistic Saturations and Alt's Problem

Alt's problem, formulated in 1923, is to count the number of four-bar li...

Please sign up or login with your details

Forgot password? Click here to reset