It depends on what the base ring is. In general in Sage you can use two
question marks to look at the source code. For example:
sage: R.<x> = ZZ[]
sage: f = x^2 - 1
sage: f.gcd??
...
cdef Polynomial_integer_dense_flint _right =
<Polynomial_integer_dense_flint> right
if self.is_zero() or _right.is_one():
return right
elif self.is_one() or _right.is_zero():
return self
cdef Polynomial_integer_dense_flint x = self._new()
sig_on()
fmpz_poly_gcd(x.__poly, self.__poly,
(<Polynomial_integer_dense_flint>right).__poly)
sig_off()
return x
So in this case Sage is delegating the work to FLINT
<https://flintlib.org/doc/fmpz_poly.html>, so you''ll need to look at their
documentation/source code to see what the algorithm used is.
David
On Friday, March 24, 2023 at 4:36:35 PM UTC-4 jaysha...@gmail.com wrote:
> I want to know that for sparse and dense polynomials which gcd algorithms
> does sagemath uses ?
--
You received this message because you are subscribed to the Google Groups
"sage-gsoc" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-gsoc+unsubscr...@googlegroups.com.
To view this discussion on the web visit
https://groups.google.com/d/msgid/sage-gsoc/e909390a-7038-4353-9ac2-88582816c7fdn%40googlegroups.com.
