1 | initial version |
Check out this Sage Quick Reference: Linear Algebra
For example, for "Maximal lin. indep. set of columns for each matrix" you can use
A.pivot_rows()
indices of rows spanning row space
just transpose the matrix below applying it: A.T.pivot_rows()
2 | No.2 Revision |
Check out this Sage Quick Reference: Linear Algebra
For example, for "Maximal lin. indep. set of columns for each matrix" you can use
A.pivot_rows()
indices of rows spanning row space
just transpose the matrix below applying it: A.T.pivot_rows()
The same methord can be done for "maximal lin. indep. subset of 𝑆" - just flatten each given matrix and consider them as row-vectors.
3 | No.3 Revision |
Check out this Sage Quick Reference: Linear Algebra
For example, for "Maximal lin. indep. set of columns for each matrix" you can use
A.pivot_rows()
indices of rows spanning row space
just transpose the matrix below applying it: A.T.pivot_rows()
The same methord method can be done used for "maximal lin. indep. subset of 𝑆" - just flatten each given matrix and consider them as row-vectors.
4 | No.4 Revision |
Check out this Sage Quick Reference: Linear Algebra
For example, for "Maximal lin. indep. set of columns for each matrix" you can use
A.pivot_rows()
indices of rows spanning row space
just transpose the matrix below applying it: A.T.pivot_rows()
The same method can be used for "maximal lin. indep. subset of 𝑆" 𝑆" - just flatten each given matrix and consider them as row-vectors.