<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Fast Fourier transform - Page 6 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=fast_Fourier_transform&amp;p=5">1.Previous</a><br />
<a accesskey="3" href="page.php?w=fast_Fourier_transform&amp;p=7">3.Next</a>
</p>
<p>in engineering, music, science, and mathematics. The basic ideas were popularized in 1965, but some algorithms had been derived as early as 1805. In 1994, <a href="page.php?w=Gilbert_Strang">Gilbert Strang</a> described the FFT as "the most important <a href="page.php?w=numerical_algorithm">numerical algorithm</a> of our lifetime", and it was included in Top 10 Algorithms of 20th Century by the <a href="page.php?w=IEEE">IEEE</a> magazine Computing in Science & Engineering.</p>

<p><big>History</big></p>
<p>The development of fast algorithms for DFT was</p><p>
<a accesskey="1" href="page.php?w=fast_Fourier_transform&amp;p=5">1.Previous</a><br />
<a accesskey="3" href="page.php?w=fast_Fourier_transform&amp;p=7">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
