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
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
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
On 03/27/2012 03:16 PM, someone wrote:
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
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
