Anonymous user
Fast Fourier transform: Difference between revisions
→{{header|Liberty BASIC}}
No edit summary |
|||
Line 902:
7 1.0 2.41421356
=={{header|Maple}}==
Maple has a built-in package DiscreteTransforms, and FourierTransform and InverseFourierTransform are in the commands available from that package. The FourierTransform command offers an FFT method by default.
<lang Maple>
with( DiscreteTransforms ):
FourierTransform( <1,1,1,1,0,0,0,0>, normalization=none );
</lang>
<pre>
[ 4. + 0. I ]
[ ]
[1. - 2.41421356237309 I ]
[ ]
[ 0. + 0. I ]
[ ]
[1. - 0.414213562373095 I]
[ ]
[ 0. + 0. I ]
[ ]
[1. + 0.414213562373095 I]
[ ]
[ 0. + 0. I ]
[ ]
[1. + 2.41421356237309 I ]
</pre>
Optionally, the FFT may be performed inplace on a Vector of hardware double-precision complex floats.
<lang Maple>
v := Vector( [1,1,1,1,0,0,0,0], datatype=complex[8] ):
FourierTransform( v, normalization=none, inplace ):
v;
</lang>
<pre>
[ 4. + 0. I ]
[ ]
[1. - 2.41421356237309 I ]
[ ]
[ 0. + 0. I ]
[ ]
[1. - 0.414213562373095 I]
[ ]
[ 0. + 0. I ]
[ ]
[1. + 0.414213562373095 I]
[ ]
[ 0. + 0. I ]
[ ]
[1. + 2.41421356237309 I ]
</pre>
<lang Maple>
InverseFourierTransform( v, normalization=full, inplace ):
v;
</lang>
<pre>
[ 1. + 0. I ]
[ ]
[ 1. + 0. I ]
[ ]
[ 1. + 0. I ]
[ ]
[ 1. + 0. I ]
[ ]
[ 0. + 0. I ]
[ ]
[ 0. + 0. I ]
[ ]
[ -17 ]
[5.55111512312578 10 + 0. I]
[ ]
[ 0. + 0. I ]
</pre>
=={{header|Mathematica}}==
| |||