http://glfwtfwhlsm2u5pw3b7crist7bt7fwepj2wgv3n3b64unj22v5435tyd.onion/blog/2019/10/29/the-magic-that-is-least-squares.html
Lets assume we want to tweak the parameters of our function above in a way that it passes though the points: P 1 = ( − 1 , 1 ) T P_1 = (-1, 1)^T P 1 = ( − 1 , 1 ) T , P 1 = ( 0 , 0 ) T P_1 = (0, 0)^T P 1 = ( 0 , 0 ) T , P 1 = ( 1 , 1 ) T P_1 = (1, 1)^T P 1 = ( 1 , 1 ) T .
For every point P n P_n P n we can calculate a corresponding X ^ n \hat{X}_n X ^ n and simply vertically stack those together...