Gonzalo Tornaria on Tue, 20 May 2003 13:48:59 -0500


[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: Sparse matrix multiplication // charpoly 

On Tue, May 20, 2003 at 11:21:26AM -0500, Gonzalo Tornaria wrote:
> ----------------------------------
> 1000x1000
> ---------
[...]
> PARI: CP(SPARSE1)     :????.?? sec
> GP:   CP(SPARSE1)     :2021.34 sec
> ----------------------------------

At last! The PARI computation for the charpoly of a 1000x1000 sparse
matrix with only 1's has finished after 13326.42 sec, that's about 6.5x
improvement for the GP program :-)

Gonzalo
-- 
GM/CS/S d? a-- C++(+++)  UL+++(++++)  P++>+++  L+++>++++ E---
W-(+) N+(++) w--- O M-(--) V-(--) PGP(--) b++(+++) G++ e>++++

... A mathematician is a machine for converting coffee into theorems.