I was unsure how the two algorithms compare, this is why I didn't include
the integer polynomial case in my proposal.
But it would be great to also work on this case.
--
You received this message because you are subscribed to the Google Groups
sympy group.
To unsubscribe from this group and
It would also be interesting to have a faster factorization algorithm for
integer polynomials. Currently the Zassenhaus method is used;
the van Hoeij algorithm is faster. A faster factorization algorithm would
be useful e.g. in computing the minimal polynomials;
there are cases in which minpoly
I just finished a first version of my GSoC application. As it turned out,
some of the stuff I wanted to do is already implemented, so I changed the
direction of my proposal a bit.
The new title is Faster Algorithms for Polynomials over Algebraic Number
Don't forget to submit this in Melange.
Aaron Meurer
On Sun, Apr 28, 2013 at 2:27 PM, Katja Sophie Hotz
katja.sophie.h...@student.tuwien.ac.at wrote:
I just finished a first version of my GSoC application. As it turned out,
some of the stuff I wanted to do is already implemented, so I changed
On Sun, Apr 28, 2013 at 4:27 PM, Katja Sophie Hotz
katja.sophie.h...@student.tuwien.ac.at wrote:
I just finished a first version of my GSoC application. As it turned out,
some of the stuff I wanted to do is already implemented, so I changed the
direction of my proposal a bit.
The new title
Algorithms like factor can handle algebraic numbers using the extension flag
In [182]: factor(x**2 + 1, extension=[I])
Out[182]: (x - ⅈ)⋅(x + ⅈ)
In general, algebraic numbers can be slow, because minpoly is slow
(this is being fixed at https://github.com/sympy/sympy/pull/2038). I
think multiple
As far as I know, the modular gcd algorithm and the factorization algorithm
from my proposal
can be extended to algebraic function fields, but I don't think there will
be enough time to go that far in one summer.
--
You received this message because you are subscribed to the Google Groups
