#5142: [with patch, needs review] speed up elementary_divisors for sparse
integer
matrices?
----------------------------+-----------------------------------------------
Reporter: jhpalmieri | Owner: was
Type: defect | Status: new
Priority: minor | Milestone: sage-3.3
Component: linear algebra | Keywords: sparse, elementary_divisors
----------------------------+-----------------------------------------------
It seems to me that if mat is a sparse integer matrix, then
{{{
mat.dense_matrix().elementary_divisors()
}}}
is much faster than
{{{
mat.elementary_divisors()
}}}
Is this correct? I've checked this on certain families of matrices, but
probably not extensively enough.
If so, we should change how elementary divisors for sparse integer
matrices are computed. I've patched this, pretty naively, by sticking a
new method in matrix_integer_sparse.pyx which just contains the above
code. I would appreciate any comments or corrections.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5142>
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
-~----------~----~----~----~------~----~------~--~---
