If $A$ has full column rank, the least-squares solution is $\hat x=(A^*A)^{-1}A^*b$, obtained from the normal equations. This is a mathematical formula, not usually the preferred numerical algorithm: forming $A^*A$ squares the 2-norm condition number. QR or SVD avoids that loss of conditioning.
Parents
Like how this is organised?
Build your own knowledge tree on knowen.md: notes, decisions and tasks in one connected markdown graph, shared with your team and your AI agents.