Solution of Non-Homogenous Systems

Consider the system: An×nXn×1=Bn×1A_{n\times n}X_{n\times 1}=B_{n\times 1}.

  • ∣A∣≠0  ⟺  Rank A=Rank (A∣B)=n  ⟺  unique solution exists|A| \neq 0 \iff \text{Rank }A = \text{Rank }(A|B)=n \iff \text{unique solution exists}
  • ∣A∣=0  ⟹  no solution∨infinitely many solutions|A|=0 \implies \text{no solution} \lor \text{infinitely many solutions}
  • Rank A<Rank (A∣B)  ⟹  no solutions\text{Rank }A <\text{Rank }(A|B) \implies \text{no solutions}
  • Rank A=Rank (A∣B)<n  ⟹  infinitely many solutions\text{Rank }A =\text{Rank }(A|B) <n \implies \text{infinitely many solutions}

Methods

Method 1: Direct Approach

Used when coefficient matrix AA is invertible. It means the system has a unique set of solutions.

AX=B  ⟹  X=A−1BAX=B \implies X=A^{-1}B

Method 2: Cramer’s Rule

Let AX=BAX=B, where AA is the coefficient matrix and X=(xi)n×1X=(x_i)_{n\times 1}.

xi=∣Ai∣∣A∣x_i=\frac{\lvert{A_i}\rvert}{\lvert{A}\rvert}

Where AiA_i is the matrix obtained by replacing iith column in matrix AA by BB.

Method 3: Reducing to Echelon Form

Start with (A∣B)(A|B). Convert the LHS\text{LHS} to echelon form. The solution can be found easily. If a contradiction is encountered while solving the equation, then the system has no solutions.

Written by September 29, 2026 1 min read
Was this helpful?