On 10/20/20 9:41 PM, Waldek Hebisch wrote: > More attractive would be to delegate say polynomial multiplication to > external library. But this is tricky performancewise. FriCAS > performs a lot of operations on relativly small polynomials. For > such polynomials cost of external call and (usually) data convertion > is significant.
I don't think that this is an argument against NTL. FriCAS allows several representations of polynomials. That is its strength. So we could have NTLPolynomial, say, and a user would choose that if he thinks that this would better fit his needs. Just like you proposed to use U32VectorPolynomialOperations. > For small degrees FriCAS was faster. I am pretty sure that low level > C libraries used by Sage were faster than FriCAS routines. But Sage > overhead apparently was enough to change which routines where faster > when used from higher level code. It is quite likely that calls from > FriCAS to C would cause similar overhead. Might well be, but in my case, FriCAS would not need to do lots of conversions. I need a projection from (my) AlgebraicNumber into the finite field and checking that it is a root of the (projected) polynomial in question. I cannot believe that this would be the bottleneck. Note that (multivariate) polynomial representations of elements of AlgebraicNumber is an implementation detail. It should not interest the end user how it is done. So I guess being able to call NTL would be a nice feature. Ralf -- 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 view this discussion on the web visit https://groups.google.com/d/msgid/fricas-devel/163a0c86-1823-dbb7-49b0-73e5f31d224b%40hemmecke.org.
