query: How do you solve a linear equation of matrices?
positive_passages.docid: 24004
positive_passages.text: General form of a linear transformation
negative_passages.docid: 156565
negative_passages.text: Find a matrix that simultaneously diagonalizes to matrices
negative_passages.docid: 108885
negative_passages.text: Systems of equations with a single number
negative_passages.docid: 946
negative_passages.text: How to find solutions of linear Diophantine ax + by = c?
negative_passages.docid: 68552
negative_passages.text: Find the representing matrix with the respect to the standard basis
negative_passages.docid: 58491
negative_passages.text: Proving the inverse of a matrix as a polynomial of matrices
negative_passages.docid: 60006
negative_passages.text: Matrix equation: $A−A(A + B)^{−1}A = B−B(A + B)^{−1}B$
negative_passages.docid: 96822
negative_passages.text: Array of Matrices in MATLAB
negative_passages.docid: 18510
negative_passages.text: How to solve the following equation numerically?
negative_passages.docid: 87387
negative_passages.text: Linear equations given by $Ax = b$ have a solution if and only if $\operatorname{rank}(A|b) = \operatorname{rank}(A)$
negative_passages.docid: 145552
negative_passages.text: How do you concatenate matrices? And how do you make block matrices?
negative_passages.docid: 17421
negative_passages.text: Linear Algebra: Find a matrix A such that T(x) is Ax for each x
negative_passages.docid: 29540
negative_passages.text: Method to eliminate $x$ between the equation $x^2 + ax + b = 0$ and $xy+ l(x + y) + m = 0$
negative_passages.docid: 71203
negative_passages.text: Proving that two systems of linear equations are equivalent if they have the same solutions
negative_passages.docid: 130498
negative_passages.text: Linear algebra proof regarding matrices
negative_passages.docid: 136142
negative_passages.text: Is division of matrices possible?
negative_passages.docid: 100749
negative_passages.text: How to find bases for a subspace defined by an equation