FFT with no requirement 2^N -- CFD Online Discussion Forums

March 9, 2005, 10:38	FFT with no requirement 2^N	#1
Annie Guest Posts: n/a	Hello! I am using FFT to solve PDEs and I'm searching for a Fast Fourier Transform which doesn't require the number of grid points to be 2^N. Anybody may provide me such a code (Fortran) or information about it? thanks for answering.

Posting Rules
You may not post new threads You may not post replies You may not post attachments You may not edit your posts BB code is On Smilies are On [IMG] code is On HTML code is Off Trackbacks are Off Pingbacks are On Refbacks are On Forum Rules

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
FFT for Post Simulation Analysis	faisal_durr	CFX	12	March 13, 2012 03:35
FFT solver for Poisson equation	mranji1	Main CFD Forum	1	November 16, 2009 01:12
qurey regarding fft.	sunil	Main CFD Forum	0	June 26, 2008 02:11
PIV: fft cross-correlation with large searchwindow	Liang	Main CFD Forum	0	April 11, 2005 14:39
fft of unsteady solution	K S Chang	Main CFD Forum	6	January 15, 2004 06:42

All times are GMT -4. The time now is 09:41.