Menu

Solving Systems of Linear Equations

Solving Linear Systems

When we have multiple linear equations, we look for a solution that satisfies all of them simultaneously.

The Three Possibilities

For any system of linear equations, there are only three possible outcomes:

  1. Unique Solution (Intersects at one point)
  2. Infinitely Many Solutions (Lines overlap)
  3. No Solution (Parallel lines)

Solving Techniques

1. Cramer’s Rule

Uses determinants to solve systems where the coefficient matrix is invertible. It’s elegant but computationally expensive for large systems.

2. Inverse Matrix Method

If AX=BAX = B and AA is invertible, then X=A1BX = A^{-1}B .

3. Gauss Elimination

The most robust method. It involves transforming the system’s augmented matrix into:

  • Row Echelon Form (REF)
  • Reduced Row Echelon Form (RREF)
💡

Homogeneous vs Non-Homogeneous

  • Homogeneous: AX=0AX = 0. Always has at least the trivial solution (X=0X=0).
  • Non-Homogeneous: AX=BAX = B (where B0B \neq 0).

Key Concept: Calculating the solution involves identifying

Free Variables
Independent vs Dependent variables.