oldk1331 wrote:
>
> What do you think of moving gcdPolynomial into UPOLYC?
Well, there are issues of performance and correctness.
Current code is written in such way that computations
propagate from more complicated domains to simpler
ones. And it tries to choose most efficient
available implementation. It is easy to introduce
bugs (say infinite recursion) or performance regressions.
There is certainly room for improvement in currect code,
in particular in multivariate case over finite fields we
should use modular methods (current code uses subresultants).
However, any change should clearly demonstrate its
usefulness.
To be more specific: choice of implementation of
'gcdPolynomial' depends on properties of base
ring, so it makes sense that 'gcdPolynomial'
is exported from base ring and not from polynomial
rings. Thanks to this we can use domian inheritance
to choose implementation.
--
Waldek Hebisch
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/fricas-devel.
For more options, visit https://groups.google.com/d/optout.
