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 stalls in factorizing a polynomial which is factored in Sage very fast.
On Sunday, April 28, 2013 10:27:28 PM UTC+2, Katja Sophie Hotz 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 is Faster Algorithms for Polynomials over Algebraic Number > Fields<https://github.com/sympy/sympy/wiki/GSoC-2013-Application-Katja-Sophie-Hotz:-Faster-Algorithms-for-Polynomials-over-Algebraic-Number-Fields> > . As far as I can see these algorithms would be new to SymPy. > > I would be very grateful for any feedback. > > Thank you in advance, > Katja Sophie > -- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to sympy+unsubscr...@googlegroups.com. To post to this group, send email to sympy@googlegroups.com. Visit this group at http://groups.google.com/group/sympy?hl=en-US. For more options, visit https://groups.google.com/groups/opt_out.
