How To Solve A System Of Equations Using Matrices

How to Solve a System of Equations Using Matrices

When you encounter a set of linear equations, the matrix method offers a powerful, systematic way to find the solution set. Instead of juggling multiple equations on paper, you can organize the coefficients, variables, and constants into matrices and apply well‑defined operations to isolate the unknowns. This approach not only streamlines the solving process but also provides a clear visual representation of the problem, making it easier to spot inconsistencies or infinite solutions.

Introduction

A linear system typically looks like this:

a₁x + b₁y + c₁z = d₁
a₂x + b₂y + c₂z = d₂
a₃x + b₃y + c₃z = d₃

The coefficients (a₁, b₁, c₁, …) can be placed into a coefficient matrix, while the variables (x, y, z) and constants (d₁, d₂, d₃) form an augmented matrix. By performing row operations—essentially the same steps used in Gaussian elimination—you transform the augmented matrix into a simpler form, from which the solution becomes evident. The three most common matrix techniques are:

No fluff here — just what actually works That's the whole idea..

1. Gaussian elimination (row‑reduction to row‑echelon form)
2. Gauss‑Jordan elimination (reduction to reduced row‑echelon form)
3. Using the matrix inverse (when the coefficient matrix is square and invertible)

Each method follows a logical sequence of steps that can be mastered with practice.

Steps to Solve Using Gaussian Elimination

1. Write the augmented matrix
   For the system above, the augmented matrix looks like:

   [ a₁  b₁  c₁ | d₁ ]
   [ a₂  b₂  c₂ | d₂ ]
   [ a₃  b₃  c₃ | d₃ ]
   

2. Create zeros below the leading entry (pivot) in the first column

   • Use elementary row operations: multiply a row by a non‑zero scalar, add a multiple of one row to another, or swap rows.
   • Example: If a₂ ≠ 0, replace Row₂ with Row₂ - (a₂/a₁)·Row₁. This eliminates the x‑term from the second equation.

3. Move to the next column and repeat

   • After the first column is cleared, focus on the sub‑matrix starting at row 2, column 2.
   • Eliminate the y‑term from the third equation using Row₃ → Row₃ - (b₃/b₂)·Row₂ (assuming b₂ ≠ 0).

4. Continue until you reach row‑echelon form

   • The matrix should have leading 1’s (or any non‑zero numbers) that form a staircase pattern.
   • Each leading entry is the only non‑zero entry in its column below it.

5. Back‑substitute (or continue to reduced row‑echelon form)

   • Starting from the bottom row, solve for the variable associated with the pivot.
   • Substitute that value upward to find the remaining variables.

Example
Solve:

2x + 3y - z = 1
4x - y + 2z = 2
-3x + 2y + z = 3

Augmented matrix:

[ 2  3 -1 | 1 ]
[ 4 -1  2 | 2 ]
[-3  2  1 | 3 ]

Row operations:

• R2 → R2 - 2·R1 → [0 -7 4 | 0]
• R3 → R3 + (3/2)·R1 → [0 13/2 1/2 | 9/2]

Now eliminate the y‑term in the third row:

• R3 → R3 - (13/7)·R2 → [0 0 27/7 | 27/7]

Resulting matrix:

[ 2  3 -1 | 1 ]
[ 0 -7  4 | 0 ]
[ 0  0  1 | 1 ]

Back‑substitution:

• From row 3: z = 1
• From row 2: -7y + 4(1) = 0 → y = 4/7
• From row 1: 2x + 3(4/7) - 1 = 1 → x = 5/7

Thus, (x, y, z) = (5/7, 4/7, 1) It's one of those things that adds up. Surprisingly effective..

Gauss‑Jordan Elimination (Reduced Row‑Echelon Form)

Gauss‑Jordan takes the process one step further, turning the matrix directly into reduced row‑echelon form where each pivot column contains only a single 1 and zeros elsewhere.

1. Continue row operations until the matrix looks like:

   [ 1 0 0 | x* ]
   [ 0 1 0 | y* ]
   [ 0 0 1 | z* ]
   

2. Read the solution directly from the rightmost column—no back‑substitution needed.

This method is especially handy when you need the solution for multiple related systems or when you plan to compute the matrix inverse later Small thing, real impact. Nothing fancy..

Using the Matrix Inverse

If the coefficient matrix A is square (same number of equations as unknowns) and invertible (its determinant ≠ 0), you can solve the system A·X = B by multiplying both sides by A⁻¹:

X = A⁻¹·B

Steps:

1. Form matrix A from the coefficients and matrix B from the constants.
2. Calculate the determinant of A. If det(A) = 0, the matrix is singular and the inverse does not exist; you must resort to elimination methods.
3. Find the adjugate matrix (transpose of the cofactor matrix) and divide each entry by the determinant to obtain A⁻¹.
4. Multiply A⁻¹ by B to get the solution vector X.

Example (same system as before):

A = [ 2  3 -1 ]
    [ 4 -1  2 ]
    [-3  2  1 ]

B = [ 1 ]
    [ 2 ]
    [ 3 ]

Compute det(A) = 2·((-1)·1 - 2·2) - 3·(4·1 - 2·(-3)) + (-1)·(4·2 - (-1)·(-3)) = -27 ≠ 0, so A is invertible.

Using the adjugate method (or a calculator) yields:

A⁻¹ = (1/ -27) * [ -5  -5   3 ]
                [ -8   7  -7 ]
                [  5  -5   5 ]

X = A⁻¹·B = [ 5/7 ]
            [ 4/7 ]
            [ 1   ]

Again, (x, y, z) = (5/7, 4/7, 1).

Cramer's Rule (Optional Alternative)

Cramer's rule provides a formula‑based approach using determinants. For a 2×2 system:

a₁x + b₁