Toom-8 testing (mpz level)

[Alberto Zanoni]

I'll try to see what I'm able to do, thank you for pointing out the new code.

Alberto

Alle 12:49, mercoledì 7 ottobre 2009, Paul Zimmermann ha scritto:
>        Dear Alberto,
>
> > From: Alberto Zanoni <zanoni at volterra.uniroma2.it>
> > Date: Wed, 7 Oct 2009 12:44:15 +0200
> >
> > Dear developers,
> >                             I implemented a mpz version of Toom-8
> > algorithm for multiplication. On my architecture I obtained someway
> > interesting results. You can find two graphics, for multiplication and
> > squaring, at
> >
> > http://bodrato.it/papers/zanoni.html#CIVV2009b
> >
> > (under "Toom-8 way for long integers multiplication" - thanks Marco !)
> >
> > As I'm waiting for the publication of the proceedings of the SYNASC 2009
> > conference, where the related paper was presented, currently I cannot put
> > the paper itself, with all the details, on the web, but actually Marco is
> > working quite ahead of it, and will surely produce something better at
> > mpn level, with many new ideas, so I think that the paper is actually
> > already obsolete.
> >
> > Just to point out that Toom-Cook-k methods with k as high as 8 (may be
> > even more ?) can be effective and worth implementing.
> >
> > Alberto
>
> please could you update your graphics with the new FFT code at
> http://www.loria.fr/~kruppaal/mul_fft-4.3.1.1.tgz?
>
> Paul