dirk_mec1
- 755
- 13
Homework Statement
In the least squares method the vector x* that is the best approximation to b statisfies the Least squares equation:
A^T A x^*= A^T b
Prove that there's always a solution to this equation.
Homework Equations
-
The Attempt at a Solution
I distinct 2 situations A^T A is invertible and it isn't invertible. If it's invertible then there's no problem x^*= (A^T A)^{-1} A^T b
But how I prove that it works in the non-invertible case?