Re: sparse polynomial arithmetic

On Apr 1, 5:57 am, Roman Pearce <rpear...@xxxxxxxxx> wrote:
A new library for high performance sparse polynomial arithmetic has
been under development at Simon Fraser University in Vancouver. The
program is faster than existing systems such as Pari, Magma, and
Singular, and it now rivals Trip (which uses double precision
coefficients). You can download a preliminary version of this
software fromhttp://www.cecm.sfu.ca/~rpearcea

I'll update the benchmarks later today, but so far April's build is
30% faster than February's on dense problems. That means the first
benchmark should take about 54 seconds. Benchmarks here:http://www.cecm.sfu.ca/~rpearcea/sdmp/2008_04_01/benchmarks.txt

Also, for one day only we are releasing this under the GPL:http://www.cecm.sfu.ca/~rpearcea/sdmp/2008_04_01/sdmp_source.tgz

What is your motivation for making a closed-source library?

--Mike
.