I ran Shedonison program, and generated \( \\[15pt]
{^{i.x}2} \) for -i.100<x<i.100.
Then I graphed the imaginary vs real part:
There is no loop. The function converges very fast to the upper and lower point, where it do spirals too small to be seen.
![[Image: SF1Lcyo.jpg?1]](http://i.imgur.com/SF1Lcyo.jpg?1)
![[Image: rkqdIti.jpg?1]](http://i.imgur.com/rkqdIti.jpg?1)
Any idea ?
There is no problem if I run sexp(I.100)
(actually, I don't know the radius of convergence of the polynomial)
{^{i.x}2} \) for -i.100<x<i.100.
Then I graphed the imaginary vs real part:
There is no loop. The function converges very fast to the upper and lower point, where it do spirals too small to be seen.
(04/20/2015, 07:53 AM)Gottfried Wrote: What do you need most?Well I can't run Sheldonison code for real values. I get this error:
Any idea ?
There is no problem if I run sexp(I.100)
(actually, I don't know the radius of convergence of the polynomial)
I have the result, but I do not yet know how to get it.