On 5/6/24 13:35, Grégory Vanuxem wrote:
Hello Qian,
Le sam. 4 mai 2024 à 09:58, Qian Yun <oldk1...@gmail.com> a écrit :
On 5/4/24 15:30, Grégory Vanuxem wrote:
As a matter of fact, use of FLINT in FriCAS:
My experience with FLINT is that is uses dense representation
for univariate polynomial.
That representation makes it fast for multiplication (when polynomials
are dense).
But I think very spare polynomial will choke it, for example
(x^10000000+1)^n (for n is some small integer).
Wow, very specific here. In the real world, is it of use?
Cryptography? Theoretical mathematics?
Well, is your example ((2*x+2*x^5+13*x^9)^5)^750 useful in real world?
;-)
I think it's better to implement both and let user to choose dense
or sparse representation, or make an abstract interface that the
algorithm itself determines whether to use dense or sparse
representation.
I looked at SAGE and they also use FLINT for generic cases like the
one I mentioned.
I will likely take a look at PARI/GP, NTL and Singular, just to inform
me, I don't really know some libraries/softwares that handle
specifically well sparse representations of polynomials, For now I
will have a look at SAGE with the keyword :sparse when instantiating a
polynomial ring. Thanks for this example.
- Greg
FLINT uses sparse representation for multivariate polynomial.
- Qian
--
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 fricas-devel+unsubscr...@googlegroups.com.
To view this discussion on the web visit
https://groups.google.com/d/msgid/fricas-devel/9f14d3a1-325d-4805-8bf7-42a81a5a03ff%40gmail.com.
