0
$\begingroup$

Let's say I have

$an_1+bn_2+cn_3=n_T$

$ap_1+bp_2+cp_3=p_T$

$ak_1+bk_2+ck_3=k_T$

where $a,b,c \geqslant 0$

What's the best way to find solutions for a, b and c so that the results of the sums are as close as possible to the terms on the right-hand side? My method has been a brute-force search but maybe there's a better way. I tagged this with 'matrices' because I didn't know what else to tag it with.

I've also thought about trying to find the variance of the variances to determine a best fit.

  • 0
    So the $n_i$, $p_i$ and $k_i$ are given? What do you mean by "the results of the sums are as close as possible to the terms on the right-hand sides"?2012-03-09

1 Answers 1