Length scale

From formulasearchengine
Revision as of 21:25, 12 December 2013 by en>ChrisGualtieri (Remove stub tag(s). Page is start class or higher + General Fixes + Checkwiki fixes using AWB)
Jump to navigation Jump to search

This category is for fast Fourier transform (FFT) algorithms, i.e. algorithms to compute the discrete Fourier transform (DFT) in O(N log N) time (or better, for approximate algorithms), where is the number of discrete points.