These are chat archives for symengine/symengine

14th
Mar 2015
Sumith Kulal
@Sumith1896
Mar 14 2015 05:42
Also, the above expand(Mul(Polynomial, Polynomial)) would require FFT right?
Shivam Vats
@shivamvats
Mar 14 2015 05:59
We'll use Kronecker's substitution trick to pack the polynomial exponents into integers. Then, polynomial multiplication becomes integer multiplication , for which we can use a highly optimized library like GMP (which uses FFT internally). This way we don't need to worry about perfecting FFT (which isn't a trivial job anyway).
Sumith Kulal
@Sumith1896
Mar 14 2015 06:02
Cool, Thanks
But having our own small integer will mean we have to perfect integer multiplication.
Something like Schonhage-Strassen integer multiplication algorithm
Shivam Vats
@shivamvats
Mar 14 2015 06:18
We could. But, I am not sure if it would matter much for small integers. Usually, such algorithms have a cut-off size, till which, they are worse than normal multiplication.
Sumith Kulal
@Sumith1896
Mar 14 2015 06:19
Okay, we can decide on this later. @certik will have a say!
Shivam Vats
@shivamvats
Mar 14 2015 06:28
Certainly.