A faster FFT

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

This entry was posted in Uncategorized. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s