wrapper for determinant, minpoly, etc. from linbox for sparse matrices
Superseeded by #23214.
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.
Change History (13)
Milestone: 
sage5.11 →
sage5.12

Milestone: 
sage6.1 →
sage6.2

Milestone: 
sage6.2 →
sage6.3

Milestone: 
sage6.3 →
sage6.4

Keywords: 
sd75 added

Milestone: 
sage6.4 →
sage7.4

Milestone: 
sage7.4 →
sage8.2

Description: 
modified (diff)

Milestone: 
sage8.2 →
sageduplicate/invalid/wontfix

Reviewers: 
→ Travis Scrimshaw

Status: 
new →
needs_review

Status: 
needs_review →
positive_review

Resolution: 
→ wontfix

Status: 
positive_review →
closed

Examples of things that are presently bad (where a sparse matrix is converted to a dense representation) :