Re: DFT with gp

[Alessandro Languasco <languasc@math.unipd.it>]

Thanks Karim for the assistance and Dirk for the advice; I’ll have a look at it.
Bests
Alessandro 

> On 29 Aug 2018, at 20:31, Dirk Laurie <dirk.laurie@gmail.com> wrote:
> 
> There are some things GP is ideal for and some things better done in
> other langauges.
> 
> You can have the best of both worlds in SAGE. Do your GP computations
> in one box, export the results to an Octave box when you need to do
> matrix-oriented number crunching. www.sagemath.org
> 
> Op Wo., 29 Aug. 2018 om 19:27 het Karim Belabas
> <Karim.Belabas@math.u-bordeaux.fr> geskryf:
>> 
>> * Alessandro Languasco [2018-08-29 18:27]:
>>> That’s great, thanks. But it works only when N is a power of two and unfortunately in my case N=q-1, q odd prime.
>>> Is there in pari a more general version of  FFT which works for a general natural number N \ge 2 ?
>> 
>> No. :-(
>> 
>> Cheers,
>> 
>>    K.B.
>> --
>> Karim Belabas, IMB (UMR 5251)  Tel: (+33) (0)5 40 00 26 17
>> Universite de Bordeaux         Fax: (+33) (0)5 40 00 21 23
>> 351, cours de la Liberation    http://www.math.u-bordeaux.fr/~kbelabas/
>> F-33405 Talence (France)       http://pari.math.u-bordeaux.fr/  [PARI/GP]
>> `
>> 
>