The Bezout–Dixon resultant method for solving systems of polynomial equations lends itself to various heuristic acceleration techniques, previously reported by the present author, which can be extraordinarily effective. In this paper we will discuss how well these techniques apply to the...

The Dixon resultant method solves a system of polynomial equations by computing its resultant. It constructs a square matrix whose determinant (det) is a multiple of the resultant (res). The naïve way to proceed is to compute det, factor it, and identify res. But often det is too large to...