[GiNaC-devel] Univarite GCD timing correction
Jens Vollinga
jensv at nikhef.nl
Mon Feb 16 16:00:30 CET 2009
Hi Alexei,
Alexei Sheplyakov schrieb:
> 2) timing of different implementations of the same method. The purpose
> is to find out how (in)efficient GiNaC::ex is as a representation
> of (univariate) polynomials (as a side note, the result is a bit
> depressing -- using coefficient vector instead of GiNaC:ex makes
> GCD calculation 50x -- 1000x faster).
is this the difference between GiNaC::ex and non-GiNaC::ex access or
between GiNaC::{mul,add} and std::vector representation?
And is this difference for a dense or non-dense representation in a vector?
Just curious. Maybe if automatic conversion between mul/add and a
dedicated polynomial class is restricted to happen only for gcd
calculations it is very beneficial.
Regards,
Jens
More information about the GiNaC-devel
mailing list