#4753: [with patch, needs review] make sparse * sparse = dense mod p like 50
frickin' times faster.
----------------------------+-----------------------------------------------
Reporter: was | Owner: was
Type: defect | Status: new
Priority: major | Milestone: sage-3.4
Component: linear algebra | Resolution:
Keywords: |
----------------------------+-----------------------------------------------
Comment (by craigcitro):
As Michael pointed out, it wouldn't hurt to have some comparison code.
BEFORE:
{{{
sage: m = random_matrix(GF(10007), 100, 100, sparse=True)
sage: %time m*m
CPU times: user 3.36 s, sys: 0.03 s, total: 3.39 s
Wall time: 3.42 s
100 x 100 sparse matrix over Finite Field of size 10007
}}}
AFTER:
{{{
sage: m = random_matrix(GF(10007), 100, 100, sparse=True)
sage: %time m*m
CPU times: user 0.09 s, sys: 0.00 s, total: 0.09 s
Wall time: 0.09 s
100 x 100 sparse matrix over Finite Field of size 10007
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/4753#comment:9>
Sage <http://sagemath.org/>
Sage - Open Source Mathematical Software: Building the Car Instead of
Reinventing the Wheel
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en
-~----------~----~----~----~------~----~------~--~---
