Least square error optimum problem

Hi all ;) That's the problem to solve: i have this set of equations...

                 c = verti_dot(1);
             c + a = verti_dot(2);
            c + 2a = verti_dot(3);
                     ...
     c + k(2a + b) = verti_dot(1 + 3k);
 c + a + k(2a + b) = verti_dot(2 + 3k);
c + 2a + k(2a + b) = verti_dot(3 + 3k).

where verti_dot(i) is a known value.

...and this is what i have to do: "...there is an overcomplete set of equations (with only three unknowns). Solving the equations using standard normal equations yields the least square error optimum a, b and c ..."

How can i do that ?!? Please someone help me. Thanks ;)

[Sean de Wolski]

what is k?

Answer 1

[Walter Roberson]

Does k(2a + b) represent k*(2*a + b) or does it represent k subscripted at (2*a + b) ?

Anyhow, sounds like a use for the \ operator.

Answer 2

[giuseppe]

Hi. k(2a + b) represent k*(2*a + b). Can you please show me the way? Thanks so much ;)