Describing the process of solving a linear system using the adjacent matrix is best done while performing an example. Suppose we have a system where is the coefficient matrix of our system, is the column vector containing our variables, and is the solution column vector. We are asked to solve for the column vector made up of variables , , and .

Typically, we would divide by to solve for , however there is no method for performing division between matrices. By taking advantage of the inverse matrix property , we can simply the formula to solve for the column vector . The commutative property does not apply in matrix multiplication so . *Therefore we have have to be aware of the ‘order’ in which we multiply*:

simplifies to

Notice that since we multiplied by ‘first’ on the left side of the equation, we also multiply ‘first’ on the right side. Now, multiplying the inverse of matrix by matrix will yield a column vector matching our , , and . Below, I have used the equation and plugged the values for into the equation. The product between and is shown on the far right. Note: This article assumes you know how to find the inverse of a matrix. This process is described in my article Finding The Inverse of a Matrix.

Therefore, , , and . Simple systems (i.e. this 3×3 system) are much easier to solve with algebra instead of finding the inverse of the coefficient matrix and performing matrix multiplication. This application is more practical for larger systems or while working on Matrix Theory homework.

**Please leave comments by signing in and then clicking on the “sticky note” located in the top right corner of this post to show your appreciation to the author!**