**Fast Fourier transforms**(FFTs) have been described as "the most important numerical algorithms of our lifetime". A

**Fourier transform**converts time (or space) to frequency and vice versa, and an

**FFT**is a computer algorithm used to rapidly compute such transformations. As a result,

**fast Fourier transforms**are widely used for many applications in engineering, science, and mathematics. The basic ideas were popularized in 1965, but some

**FFTs**had been previously known as early as 1805. Wikipedia, Fast Fourier Transform

See Also

**Finite Element Analysis**

**Frequency**

**Modal Analysis**

**Space**

**Time**