On Sun, Jan 20, 2013 at 1:49 PM, Jose Guzman wrote:
> Would anyone we so kind to provide a minimal example with Sage?
There are examples in fft.pyx and dft.py in the docstrings.
>
>
> On 20 January 2013 19:48, David Joyner wrote:
>>
>> On Sun, Jan 20, 2013 at 12:29 PM, Santanu Sarkar
>> wrot
Would anyone we so kind to provide a minimal example with Sage?
On 20 January 2013 19:48, David Joyner wrote:
> On Sun, Jan 20, 2013 at 12:29 PM, Santanu Sarkar
> wrote:
> > Dear all,
> > We know using Fast Fourier Transform we can evaluate a polynomial f(x)
> > of degree n at n points x_1, .
On Sun, Jan 20, 2013 at 12:29 PM, Santanu Sarkar
wrote:
> Dear all,
> We know using Fast Fourier Transform we can evaluate a polynomial f(x)
> of degree n at n points x_1, .., x_n in O(n) time. Is it implemented in
> Sage?
It is in the gsl module
http://hg.sagemath.org/sage-main/file/9519a7bb2f
