Hi,
it seems like Kauer's algorithm can in particular deal with nested sums
and products - something which gruntz cannot do at all. So I think this
would be a useful thing to implement.
Since publications on this algorithm seem scarce, this project would
likely be quite hard. You would have to make sure you understand the
algorithm (and convince us of that!). But it does sound like an
interesting proposal.
Tom
On 27.03.2012 18:29, Saurabh Jha wrote:
Hi,
I saw that the calculation of limits of series is currently done using
Gruntz algorithm. Can the implementation of the Kauers algorithm
described in paper "Computing Limits of Sequences" be a good project
for the summer of code 2012?
Regards,
-Saurabh Jha
--
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.
