The paper you mention works for functions containing only bounded functions like:- (sin(x**2) - sin(x))/(3 + cos(E*x**2))
And I think that's what we need. Heuristics handle cases like sin(x)/x but not when all are bounded. This can be a useful addition. I've partly understood the algorithm and I plan to add it to my proposal. Can you give some suggestions regarding my proposal? I plan to do formal power series, asymptotic series and hopefully limits. Here is the link:- https://github.com/sympy/sympy/wiki/GSoC-2014-Application-Avichal-Dayal-Series-Expansion -- 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 [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/6dc1cf30-cea7-4a14-bc3a-d3257dc5fd93%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
