> At the end of the Summer of Code, I thought that the polynomial > algorithms were so slow, because they carry (complicated) SymPy > objects as coefficients. That's why I played around with a more light- > weight univariate Polynomial class. First, with the finite fields > coefficients, I was quite satisfied, also with factorization. But when > I tried to lift the results to (Python) integer coefficients, it got > incredibly slow. I took the algorithms 'out of the book', so I'm sure > that improvement is possible. I think that this improvement would help > asymptotically, rather, and the algorithms already take very long with > small example polynomials. Initially I'd planned to do another > (multivariate) gcd and factorization as well, but I didn't try, > because the simpler univariate factorization was just disappointing. > > The book "Modern Computer Algebra" is a great reference for all of > this, you rarely need anything else for this.
I see. Thanks for the update. I think we can get some help from the SAGE guys, how to do this properly and which algorithm is the best. Ondrej --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "sympy" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sympy?hl=en -~----------~----~----~----~------~----~------~--~---
