Drexel dragonThe Math ForumDonate to the Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math.symbolic.independent

Topic: a faster "sparse" FFT
Replies: 2   Last Post: Apr 1, 2012 6:00 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Richard Fateman

Posts: 1,424
Registered: 12/7/04
a faster "sparse" FFT
Posted: Mar 14, 2012 9:32 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply


This might be especially nice for dealing with sparse polynomial
arithmetic via FFT. I haven't studied it yet, but has anyone
in the sci.math.symbolic readership looked?


Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum 1994-2015. All Rights Reserved.