Division-free Computation of Subresultants Using Bezout Matrices

We present an algorithm to compute the subresultant sequence of two polynomials that completely avoids division in the ground domain, generalizing an algorithm \revised{given by} Abdeljaoued et al.\ (see Abdeljaoed et al.: Minors of Bezout Matrices\ldots, Int.\ J.\ of Comp.\ Math.\ 81, 2004). We evaluate determinants of slightly manipulated Bezout matrices using the algorithm of Berkowitz. Although the algorithm gives worse complexity bounds than pseudo-division approaches, our experiments show that our approach is superior for input polynomials with moderate degrees if the ground domain contains indeterminates