R\'esolution des syst\`emes polynomiaux: un solveur bas\'e sur les matrices de Bezout

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.