We use the idea of projection to determine the best approximate solution to A→x=→b. The beautiful story is that we find the part of →b that lives in Column Space, →p, and trim off the Left Nullspace part, →e. We find out that every A→x=→b problem can be turned into a solvable, square symmetric system: ATA→x=AT→b.
Best consumed by 2016/10/12