| Abstract | In this paper, we present a new method for solving square polynomial systems with no zero at infinity. We analyze its complexity, which indicates substantial improvements, compared with the previously known methods for solving such systems. We describe a framework for symbolic and numeric computations, developed in C , in which we have implemented this algorithm. We mention the techniques that are involved in order to build efficient codes and compare with existing softwares. We end by some applications of this method, considering in particular an autocalibration problem in Computer Vision and an identification problem in Signal Processing, and report on the results of our first implementation. |
