Actually the problem is in summation, not in evalf.
In [3]: %timeit(gamma(1000))
100000 loops, best of 3: 11.3 us per loop
In [4]: %timeit(gamma(x).subs({x:1000}))
10000 loops, best of 3: 57.1 us per loop
On 9 November 2011 16:51, [email protected] <
[email protected]> wrote:
> few minutes after sending the mail I got this
>
> /home/stefan/Workspace/sympy/sympy/core/operations.pyc in
> _eval_template_is_attr(self, is_attr)
> 214 r = True
> --> 215 for t in self.args:
> 216 a = getattr(t, is_attr)
> 217 if a is None: return
>
> RuntimeError: maximum recursion depth exceeded
>
>
>
> On 9 November 2011 16:46, [email protected] <
> [email protected]> wrote:
>
>> In [21]: s = summation(k**(-2.1), (k, 1, oo))
>> In [23]: %timeit s.evalf()
>> 1 loops, best of 3: 196 ms per loop
>>
>> In [24]: s = summation(k**(-x), (k, 1, oo))
>> In [26]: %timeit s.evalf(subs={x : 2.1})
>> still calculating
>>
>> This seems like a bug?
>>
>
>
--
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.
