According to Strang, the FFT is “most important numeric algorithm in our lifetime”
It would be nice if it was faster:
IEEE Spectrum, March 2012
“A Faster Fast Fourier Transform”
New algorithm crunches sparse data with speed
Advertisements
-
Archives
- May 2018
- February 2018
- October 2017
- September 2017
- August 2017
- May 2017
- March 2017
- January 2017
- November 2016
- October 2016
- September 2016
- August 2016
- July 2016
- June 2016
- May 2016
- April 2016
- March 2016
- February 2016
- January 2016
- December 2015
- September 2015
- July 2015
- June 2015
- May 2015
- January 2015
- May 2014
- January 2014
- December 2013
- November 2013
- October 2013
- August 2013
- July 2013
- June 2013
- May 2013
- March 2013
- February 2013
- January 2013
- December 2012
- November 2012
- October 2012
- September 2012
- August 2012
- July 2012
- June 2012
- May 2012
- April 2012
- March 2012
- February 2012
- January 2012
- December 2011
- November 2011
- October 2011
- September 2011
- August 2011
- July 2011
- June 2011
- May 2011
- April 2011
- March 2011
- February 2011
- January 2011
- December 2010
- November 2010
- October 2010
- September 2010
- August 2010
- July 2010
- June 2010
- May 2010
- April 2010
- March 2010
- February 2010
- December 2009
- November 2009
- October 2009
- September 2009
-
Meta
Advertisements
