Hi, thank you for comments, I've looked closer on SymPy's capabilities and choose concrete algorithms to be implemented during GSoC. In brief, they are: - EEZ-GCD algorithm; - coefficient prediction sub-algorithm of EEZ for iterations 2..n; - polynomial multiplication and division based on heaps (Monagan's approach); - efficient multivariate factorization over finite fields.
First there algorithms are hoped to significantly speed up calculations for sparse multivariate polynomials. Last algorithm just extends support of factorization over finite fields to multivariate case. It's not very easy to estimate time that needs to implement these algorithms now. But if it is possible to done it fast enough then I will work after that on non-commutative polynomials support. I've updated my application page (but it's still not finished yet): https://github.com/sympy/sympy/wiki/GSoC-2011-Application-Pavel-Fedotov:-Multivariate-polynomials-and-factorization On 6 апр, 11:46, Mateusz Paprocki <matt...@gmail.com> wrote: > Hi, > > On 5 April 2011 15:53, Effect <fedot...@gmail.com> wrote: > > > Hello, > > > I've created a page on a wiki with my application for GSoC'2011: > > >https://github.com/sympy/sympy/wiki/GSoC-2011-Application-Pavel-Fedot... > > > I continue working with my proposal now. > > So I open to your questions and ready to provide more information. > > Support for polynomials was significantly improved over the past year. Most > notably Wang's multivariate factorization algorithm was implemented, so > statement that "Currently multivariate factorization algorithm is based on > Kronecker's method" is incorrect and obsolete. I strongly suggest you > familiarize your self with SymPy's capabilities and choose algorithms and > data structures that weren't implemented yet, and especially those which > really make sense. For example: as SymPy already has Wang's algorithm for > multivariate factorization, then it should be straightforward to implement > EEZ-GCD reusing parts of the existing implementation (it would be also nice > to study and implement coefficient prediction sub-algorithm of EEZ for > iterations 2..n (supposed to give huge speed ups for large sparse > polynomials)). If you would like to implement a different algorithm, e.g. > SP-MOD, then you will have to start basically from scratch (although I would > like to have implementation of this algorithm in SymPy). You will have to > also provide a more detailed schedule of what you want to do and when. > > > > > Pavel Fedotov. > > > -- > > You received this message because you are subscribed to the Google Groups > > "sympy" group. > > To post to this group, send email to sympy@googlegroups.com. > > To unsubscribe from this group, send email to > > sympy+unsubscr...@googlegroups.com. > > For more options, visit this group at > >http://groups.google.com/group/sympy?hl=en. > > Mateusz -- You received this message because you are subscribed to the Google Groups "sympy" group. To post to this group, send email to sympy@googlegroups.com. To unsubscribe from this group, send email to sympy+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sympy?hl=en.
