Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

The problem is that for these kind of inexact rings the methods are not implemented.

For the resultant, you can compute the resultant with


But I cannot promise performance nor numeric stability.

The gcd is more tricky. For instance, if you take univariate polynomials over an inexact rings and perform Euclides method, you will end with a gcd 1 due to numerical errors. You are asking for an approximate gcd which is not easy to compute.