Least squares (see comments)
Given the system of equations Av = b, where \[A = \left[\begin{matrix}0 & 2 \\ 1 & 2\\ -1 & 1 \\ 1 &2\end{matrix}\right], b=\left[\begin{matrix}2 \\ 2 \\1\\1\end{matrix}\right]\]find the optimal solution, in the least squares sense.
So I sorta understand what to do, but not really >.< i might not be too much help on this one. The idea is, the system: \[Ax=b\]might not have a solution. infact just by eyeballing it, it looks like there isnt a solution. So what you do is project b onto the column space. Its like saying, "i know b doesnt work, so whats the closest vector that does?"
Now if i could only remember the projection matrix....i think its something like: \[A^TA\]....something something....i need to grab my books, one sec lol
I believe this is the Projection matrix, its really long, get ready o.O: \[A(A^TA)^{-1}A^T\]We actually need to compute that monster >.>
Yeah, thats what I'm looking at, at the moment, too...\[(A^TA)^{-1}A^Tb = x\]
is what I have..
i see that in my book too. doing a little reading to make sure i know what im doing lolol
Is \[A^T = \left[\begin{matrix}0 & 1 &-1&1 \\ 2&2&1 & 2\end{matrix}\right]\] correct??
yes that is correct
ok, what it looks like is the best fit answer, which i'll call "x hat" is: \[\hat x=(A^TA)^{-1}A^Tb\]
which is what you have up there.
Great :)
I think that was all I needed - as long as I got the A^T correct, then I'm fine :) thanks, as always, joemath!
no prob, sry i wasnt more help >.<
Join our real-time social learning platform and learn together with your friends!