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,397
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

http://arxiv.org/abs/1201.2501v1

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?

RJF



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

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.