[Numpy-tickets] [NumPy] #506: fft is unusable of moderately large arrays with a size which is a prime number

[NumPy]

#506: fft is unusable of moderately large arrays with a size which is a prime
number
-----------------------+----------------------------------------------------
 Reporter:  cdavid     |        Owner:  somebody     
     Type:  defect     |       Status:  new          
 Priority:  normal     |    Milestone:  1.0.3 Release
Component:  numpy.fft  |      Version:  devel        
 Severity:  major      |   Resolution:               
 Keywords:             |  
-----------------------+----------------------------------------------------
Comment (by charris):

 As far as I know, there is no fast algorithm for the prime numbers other
 than fast convolution, i.e.,
 http://en.wikipedia.org/wiki/Bluestein's_FFT_algorithm. As Bluestein's
 algorithm also works for the chirp-z transform we might prefer to
 implement the latter, or maybe put it in scipy.

-- 
Ticket URL: <http://projects.scipy.org/scipy/numpy/ticket/506#comment:3>
NumPy <http://projects.scipy.org/scipy/numpy>
The fundamental package needed for scientific computing with Python.