I would be happy to be helpful, at least testing.
El martes, 22 de enero de 2019, 20:03:29 (UTC+1), Nils Bruin escribió:
>
> See:
>
> https://trac.sagemath.org/ticket/27091
>
> Balanced summing (which you are basically doing) already makes a bit of a
> difference. If that's indeed the issue then
See:
https://trac.sagemath.org/ticket/27091
Balanced summing (which you are basically doing) already makes a bit of a
difference. If that's indeed the issue then using a balanced summing
strategy already gives a better order on the algorithm.
--
You received this message because you are subsc
Thank you for such a detailed description. I think this is a good basis for
an enhancement ticket. I don't think there is a fundamental reason why
polynomial construction from a dictionary shouldn't do something efficient
itself already. As an example of the kind of code we can benchmark on:
sa
The answer is very helpful. I saw a way to solve the specific problem using
other techniques but I tried to see anyway how to recover the computation.
The key of the problem was a polynomial with more that 16 millions of
monomials. I made the following approaches:
1. Save the object in a sob
On Thursday, January 17, 2019 at 3:37:36 PM UTC-8, Enrique Artal wrote:
>
> I made some computations, I skip the details for now, but the result was a
> rational function with rational coefficients and 13 indeterminates. The
> computation took around three hours and used a lot of memory so I made
