We discussed what a Null Space is,
but how to find a Null space for an arbitrary large matrix, We can't do that by hands.
So what are the steps (Algorithm) to find the Null space.
To find Null Space first we convert our matrix (say A) in echelon form using Elimination technique.
For example say our matrix is,
A=⎣⎡1232462682810⎦⎤
From now on we refer to ith Row as ri and jth column as cj
box represent pivot element.
Step 1: of elimination method, here we make all element 0 in c1 below the 1st element. r2←r2−2r1
A=⎣⎡1032062282410⎦⎤
r3←r3−3r1
A=⎣⎡100200222244⎦⎤
Step 2: of elimination method, here we make all element 0 in c2 below the 2nd element.
A=⎣⎡100200222244⎦⎤
Here 2nd element itself is 0, and all element below it also 0, so move forward.
Step 3: of elimination method, here we make all element 0 in c3 below the 2nd element.
A=⎣⎡100200222244⎦⎤
r3←r3−r2
A=⎣⎡100200220240⎦⎤
We end here because 3rd element of c4 is itself 0
So we got total 2 pivots, this is also the rank of this matrix.
info
Rank(A) = # of pivots
Our matrix has 4 columns, 2 of them are pivot columns and other we call free columns