QR-algebraic method for approximating zeros of system of polynomials

We present a new method for computing zeros of polynomial systems using the algebraic solver and the QR-method. It is based on the theory of algebraic solvers. The unstable calculation of the determinant of the large matrix is replaced by a stable technique using the QR-method. Algorithms and numerical results are presented.