query: Matrices: Using the row echelon
positive_passages.docid: 149737
positive_passages.text: For which values does the Matrix system have a unique solution, infinitely many solutions and no solution?
negative_passages.docid: 81227
negative_passages.text: Matrix equation (esp. row vectors)
negative_passages.docid: 146351
negative_passages.text: Effect of elementary row operations on determinant?
negative_passages.docid: 108545
negative_passages.text: Why does a translation matrix need extra row?
negative_passages.docid: 120937
negative_passages.text: Matrices that commute with all matrices
negative_passages.docid: 68608
negative_passages.text: Why do row equivalent matrices have the same row space?
negative_passages.docid: 8627
negative_passages.text: Number of equivalence classes of $w \times h$ matrices under switching rows and columns
negative_passages.docid: 132346
negative_passages.text: a linear algebra multiple choice problem
negative_passages.docid: 11397
negative_passages.text: How do I write this matrix as a product of elementary row matrices.
negative_passages.docid: 32064
negative_passages.text: Zero-dimensional matrices
negative_passages.docid: 72578
negative_passages.text: Determinant value of a square matrix whose each entry is the g.c.d. of row and column position
negative_passages.docid: 32767
negative_passages.text: Similar Matrices and Linear Transformations
negative_passages.docid: 60231
negative_passages.text: Number of equivalence classes of matrices under switching rows and columns
negative_passages.docid: 58274
negative_passages.text: creating a diagonal matrix with a variable amount of parameters
negative_passages.docid: 85581
negative_passages.text: Matrices commute if and only if they share a common basis of eigenvectors?
negative_passages.docid: 11475
negative_passages.text: How to create automatically some matrices for symbolic manipulation?
negative_passages.docid: 1024
negative_passages.text: Extract four (von Neumann) neighbors of a matrix entry