I have a matrix whose rows are linearly dependent. Showing that with sage is straightforward. Is there a reasonably fast algorithm to find the smallest set of rows that form such a linear dependence and would it be simple to implement in sage?
Revision history [back]
 | 1 | initial version |
Finding minimal linearly dependent vectors
| | 2 | None |
Finding minimal linearly dependent vectors
I have a matrix whose rows are linearly dependent. Showing that with sage is straightforward. Is there a reasonably fast algorithm to find the a smallest set of rows that form such a linear dependence and would it be simple to implement in sage?
