New structure theorem for subresultants
The authors introduce the concept of G-remainder of two polynomials \(A\) and \(B\), which may be characterized by \[ a \text{ GRem}(A,B)= b \text{ Rem}(A,B), \] where \(a\) and \(b\) are the leading coefficients of \(A\) and \(B\), respectively. Based on this notion, they study the gap structure of the subresultants and derive an algorithm to compute them. Their algorithm improves on the classical subresultant algorithm in relation to the size of intermediate computation. The paper also reports on computer experiments, comparing the new method with existing ones.
scientific article; zbMATH DE number 1471051
scientific article