The Math Forum

Search All of the Math Forum:

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

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

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: New 64 bit versions of Fermat with fast polynomial multiplication
Replies: 0  

Advanced Search

Back to Topic List Back to Topic List  
Robert Lewis

Posts: 52
Registered: 7/17/08
New 64 bit versions of Fermat with fast polynomial multiplication
Posted: Oct 31, 2013 2:07 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

New 64 bit versions, Fermat 5.0, have been posted that implement a fast multivariate polynomial multiplication algorithm.

Though this way of multiplying polynomials actually has a long history, I am indebted to Michael Monagan of Simon Fraser University for bringing it to my attention at the 2013 ECCAD conference in Maryland. He has described the idea in a preprint

Basically, the idea is to store each term, or monomial, of a multivariate polynomial in a single node instead of storing the polynomial as a recursive structure of nodes at one level pointing to nodes at lower levels. Remarkable speedups are possible, 30% - 84% in real problems involving 6 - 18 polynomial variables.

More details are here:

The 64 bit versions for Mac and Linux are available here:

The general web site is:

Robert H. Lewis
Fordham University

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

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.