I am studying computational applied mathematics and this video is insanely useful, pretty amazing to see why in order to find these parameters we transpose all these matrices. Great job!
Great explanation, but it would be more clear to show the derivation of the Least Squares Method over the actual minimization of squares of the residuals. That's why it's called least squared.
If I'm understanding this correctly, this method solves 1 x column to a y column. In the polynomial case you can have n coefficients Cn, but still fitting that same x column to f(x). But what if you are trying to solve a polynomial for many independent variables xn?
Is there a simple/intuitive explanation on why multiplying left with A transpose, even results in a system of equations who's solution is optimal? On a the surface, it only looks like a "trick" to make the over defined system of equations solvable
I am studying computational applied mathematics and this video is insanely useful, pretty amazing to see why in order to find these parameters we transpose all these matrices. Great job!
"Have fun programming this up", it's funny because that's exactly what I'm trying to do haha. Thanks Professor, your explanation really helped me!
Nicely explained professor, Respect from India :)
I bet there's a lot more people out there that could use this than have found it. Tis very well done.
what a great explanation!!!!! thank you sir!
Great explanation, but it would be more clear to show the derivation of the Least Squares Method over the actual minimization of squares of the residuals. That's why it's called least squared.
I agree, but good explanation nonetheless. Better than what I got in class
@@TheTranq agree
thank u so much for the brilliant explanation！！！
Great video sir. Thank you!
Great explanation , loved it ;)
Thank u sir..You helped me a lot
Thank you for your help!
If I'm understanding this correctly, this method solves 1 x column to a y column. In the polynomial case you can have n coefficients Cn, but still fitting that same x column to f(x). But what if you are trying to solve a polynomial for many independent variables xn?
Is there a simple/intuitive explanation on why multiplying left with A transpose, even results in a system of equations who's solution is optimal? On a the surface, it only looks like a "trick" to make the over defined system of equations solvable
probably would be more clean not to reuse 'm' to confuse people
Fair.