#13915: wrapper for determinant, minpoly, etc. from linbox for sparse matrices
------------------------------+---------------------------------------------
Reporter: Bouillaguet | Owner: jason, was
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.6
Component: linear algebra | Keywords: linbox
Work issues: | Report Upstream: N/A
Reviewers: | Authors:
Merged in: | Dependencies:
Stopgaps: |
------------------------------+---------------------------------------------
Currently, computing the determinant, minimum polynomial, characteristic
polynomial, etc of sparse matrices over the integers and finite fields
switch them to a dense representation, then runs the dense algorithm.
This works, but is quite suboptimal. Linbox packs a few algorithms
tailored for sparse matrices, e.g. iterative methods for the determinant,
minpoly, etc. These methods have the advantage that they only read the
matrix, and are memory efficient.
The aim of this ticket is to make these algorithms available in Sage.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13915>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
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.
