Mark Dickinson, 31.01.2010 11:07:
> On Jan 31, 10:02 am, Mark Dickinson wrote:
>> Python is refusing to multiply the string x[a] by the complex number W
>> [n % N].
>
> Whoops, that should have been "x[b]", not "x[a]". Why is it that a
> post-submission proofread turns up errors so much more oft
On Jan 31, 10:02 am, Mark Dickinson wrote:
> Python is refusing to multiply the string x[a] by the complex number W
> [n % N].
Whoops, that should have been "x[b]", not "x[a]". Why is it that a
post-submission proofread turns up errors so much more often than a
pre-submission proofread?
--
Mark
On Jan 30, 8:20 pm, uche wrote:
> Another issue:
> x[a], x[b] = x[(a)] + W[(n % N)] * x[(b)], x[(a)] - W[(n % N)] * x
> [(b)]
> TypeError: can't multiply sequence by non-int of type 'complex'
With your original code, the elements of array2 are strings, and here
Python is refusing to multiply
On Jan 30, 2:30 pm, uche wrote:
> On Jan 30, 2:21 pm, Stefan Behnel wrote:
>
>
>
>
>
> > Stefan Behnel, 30.01.2010 19:52:
>
> > > uche, 30.01.2010 19:33:
> > >> I have the following FFT python code
>
> > > You didn't seriously implement an FFT in plain Python code, did you?
>
> > Sorry, no, you d
On Jan 30, 2:21 pm, Stefan Behnel wrote:
> Stefan Behnel, 30.01.2010 19:52:
>
> > uche, 30.01.2010 19:33:
> >> I have the following FFT python code
>
> > You didn't seriously implement an FFT in plain Python code, did you?
>
> Sorry, no, you didn't. Should have read your post a little closer.
>
>
uche, 30.01.2010 20:18:
> I got another problem after changing / to // . Yes, I am using 3.1.
>
> W.append(exp(sign * 2j * pi * i // N))
> TypeError: can't take floor of complex number.
Don't change it everywhere, just where it deals with integers. In the
above, "/" is perfectly right.
Stefa
Stefan Behnel, 30.01.2010 19:52:
> uche, 30.01.2010 19:33:
>> I have the following FFT python code
>
> You didn't seriously implement an FFT in plain Python code, did you?
Sorry, no, you didn't. Should have read your post a little closer.
> FFTs
> are amongst the first thing that come to my min
On Jan 30, 2:08 pm, MRAB wrote:
> uche wrote:
> > Hi,
> > I have the following FFT python code and it doesn't seem to compile
> > correctly. To run it, please create a file called output.csv with
> > 1,2,3,4,5,6,7,8. simply run the main function. I get an error such as
> > the following:
>
> >
uche wrote:
Hi,
I have the following FFT python code and it doesn't seem to compile
correctly. To run it, please create a file called output.csv with
1,2,3,4,5,6,7,8. simply run the main function. I get an error such as
the following:
x[a], x[b] = x[(a)] + W[(n % N)] * x[(b)], x[(a)] - W[(n
uche, 30.01.2010 19:33:
> I have the following FFT python code
You didn't seriously implement an FFT in plain Python code, did you? FFTs
are amongst the first thing that come to my mind when I try to imagine what
I'd use NumPy for. (and I *never* used it!)
Stefan
--
http://mail.python.org/mailma
Hi,
I have the following FFT python code and it doesn't seem to compile
correctly. To run it, please create a file called output.csv with
1,2,3,4,5,6,7,8. simply run the main function. I get an error such as
the following:
x[a], x[b] = x[(a)] + W[(n % N)] * x[(b)], x[(a)] - W[(n % N)] * x
[(b)
11 matches
Mail list logo