hi,
i m not sure if i got ur question correctly. u have two (n+1) dim vectors
and u want a (n+1) by (n+1) matrix which transforms one vector to another.
if this is the case then the problem is underspecified and has infinitely
many solutions. one of the solutions is -
M = transpose(P)*Q / norm(P), where norm(P)=P*transpose(P).
please clarify if this is not what u wanted.
best wishes,
Rajeev
On Wed, Mar 3, 2010 at 6:20 AM, yaoyansi <yaoyan...@yahoo.com.cn> wrote:
> hi, all
> I am new to GSL, and I have a question, but I don't know how to solve this
> problem by GSL.
> My question is:
> Given two point sets P={p0,...,pn} and Q={q0,...,qn}, I want to get a
> matrix M to transform P to Q'={q0',...,qn'}, that is:
> Q'=P*M
> The constraint condition is let the SUM has the minimum value:
> SUM=|q0-q0'|^2 + |q1-q1'|^2 + ... + |qn-qn'|^2;
>
> Thank you.
>
> Best regards
> yaoyansi
>
>
>
> _______________________________________________
> Help-gsl mailing list
> Help-gsl@gnu.org
> http://lists.gnu.org/mailman/listinfo/help-gsl
>
_______________________________________________
Help-gsl mailing list
Help-gsl@gnu.org
http://lists.gnu.org/mailman/listinfo/help-gsl
