Re: sparse polynomial arithmetic
- From: rjf <fateman@xxxxxxxxx>
- Date: Thu, 10 Apr 2008 15:47:46 -0700 (PDT)
I checked the benchmark
at
http://www.cecm.sfu.ca/~rpearcea/sdmp/2008_04_01/benchmarks.txt
and ran it in Maxima, straight out of the box.
Example 1: Fateman's benchmark (dense)
# 46376 x 46376 = 635376 terms
# coefficients of f and g are 61 bits
# coefficients of p are 128 bits
f := (1+x+y+z+t)^30;
g := f+1;
multiply p := f*g;
divide q := p/f;
lex order x > y > z > t
# stan.cecm.sfu.ca p := f*g q := p/f
sdmp Apr 2008 monomial=1 word 54.720 68.160
sdmp Apr 2008 monomial=4 words 131.730 126.320
Trip v0.99 double precision 43.664 -
Trip v0.99 rational numbers 108.224 -
Pari 2.3.3 (w/ GMP) 512.184 283.445
Magma V2.14-7 679.070 610.620
Singular 3-0-4 1482.360 364.490
Maxima 5.13.0 in GCL 2.6.8 on a 3GHz PentiumD f:rat(`1+x+y+z)^30$ g:f
+1, f*g (without GMP)
1771.69
Maple 11 15986.169 13039.248
.
- Follow-Ups:
- Re: sparse polynomial arithmetic
- From: Roman Pearce
- Re: sparse polynomial arithmetic
- References:
- sparse polynomial arithmetic
- From: Roman Pearce
- Re: sparse polynomial arithmetic
- From: mabshoff
- Re: sparse polynomial arithmetic
- From: Roman Pearce
- Re: sparse polynomial arithmetic
- From: parisse
- Re: sparse polynomial arithmetic
- From: Roman Pearce
- Re: sparse polynomial arithmetic
- From: parisse
- Re: sparse polynomial arithmetic
- From: bluescarni
- Re: sparse polynomial arithmetic
- From: Roman Pearce
- Re: sparse polynomial arithmetic
- From: bluescarni
- Re: sparse polynomial arithmetic
- From: rjf
- Re: sparse polynomial arithmetic
- From: bluescarni
- Re: sparse polynomial arithmetic
- From: Roman Pearce
- Re: sparse polynomial arithmetic
- From: bluescarni
- sparse polynomial arithmetic
- Prev by Date: Moses
- Next by Date: My new Math
- Previous by thread: Re: sparse polynomial arithmetic
- Next by thread: Re: sparse polynomial arithmetic
- Index(es):
Relevant Pages
|