#4753: [with patch, needs work] make sparse * sparse = dense mod p like 50
frickin' times faster.
----------------------------+-----------------------------------------------
Reporter: was | Owner: was
Type: defect | Status: new
Priority: major | Milestone: sage-3.2.2
Component: linear algebra | Resolution:
Keywords: |
----------------------------+-----------------------------------------------
Comment (by was):
> Is it because you have a faster, more specialized underlying data
structure?
> Wouldn't it make more sense to add an optimized _mul_ method to
> matrix_modn_sparse and then have it do a normal (naive) conversion?
Definitely *not*. Much of the time would likely be spent with setting and
inserting entries in the sparse output, which is an insanely expensive
datastructure compared to the super-fast dense data structure.
That said, obviously a fast sparse*sparse = sparse should also be
implemented, which would just be an easy cut and paste from
Matrix_rational_sparse.
-- william
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/4753#comment:7>
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
-~----------~----~----~----~------~----~------~--~---
