Dear all,
I am new to Sage development and I'd like some help or advice for the
following task:
There is right now no specific algorithm for computing roots of Sparse
Polynomials in Sage. Such algorithms exist, at least for polynomials
over Z [CuKoiSma99], Q or any finite extension of Q [Len
Salut Bruno,
Welcome!
> Now comes my question, which is basically: How to introduce this new
> code into Sage?
Did you already opened a ticket on trac for that?
> More specifically, the "roots()" function is defined in
> rings/polynomial/polynomial_element.pyx where a selection of algorithm
> i
Hello Bruno,
* Bruno Grenet [2014-06-12 13:47:59 +0200]:
> Now comes my question, which is basically: How to introduce this new code
> into Sage?
> [...]
> What I'd like to do is to branch a new algorithm there. So my more specific
> question: Where should the new algorithm go? A solution may be
