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 » Software » comp.soft-sys.math.mathematica

Topic: PolynomialQuotient slow
Replies: 3   Last Post: Jan 7, 2013 12:35 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Roman Pearce

Posts: 120
Registered: 1/25/05
Re: PolynomialQuotient slow
Posted: Jan 5, 2013 2:17 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Thanks Daniel, the internal routine seems to be what I want, as its time is comparable to Expand. And it is parallelized? This is very nice work. Can I ask if it is recursive or distributed? I'd appreciate any references where I can read about it.

Two things we noticed were that ExactQuotient sometimes uses more threads and gets better speedup than Expand, so it may be possible to improve Expand, and Factor doesn't seem to use the parallel algorithms which is something to consider if you haven't already.

f = Expand[ (1+x+y+z+t)^30+1 ]; g = f+1;
AbsoluteTiming[ p = Algebra`IPExpand[ f g ]; ]
AbsoluteTiming[ q = Algebra`IPExactQuotient[ p, f ]; ]

We were also excited to see some of the other core algorithm improvements in Mathematica 9. I think you have a very strong release here. All the best in the new year :)



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.