Résolution des systèmes polynomiaux: un solveur basé sur les matrices de Bezout
arXiv:1609.09792
Abstract
We propose a method to compute the numerical solutions of a polynomial system in complete intersection. This algorithm makes use of Bezout matrices and need only linear algebra computations. All the calculations can be done in floating point arithmetic. A complete implementation of the algorithm is provided.
13 pages, in French, 3 figures, 1 table; comments are welcome