Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Given $X_i, Y_i \in SO_3, i=1..n, n>2$, find $A,B$ that satisfies $AX_iB=Y_i$.

For $n=1$, there are an infinite number of solutions, a trivial one is:

For $n=2$, there should be exactly one solution. One could do the following:
Compute $A$ from the equation where $i=1$: $A=Y_1B^{-1}X_1^{-1}$,
Substituting this into equation where $i=2$: $Y_1B^{-1}X_1^{-1}X_2B=Y_2$,
Now, let $C=X_1^{-1}X_2$ and $D=Y_1^{-1}Y_2$,
We get: $B^{-1}CB=D$,
Which can be rewritten as: $CB=BD$
I'm already lost at this point. How do I solve for $B$, given $D,C$?

And now for $n>2$, how can I find a solution that minimizes the least squares error? Is it possible to rearrange the $n$ equations into a linear system at all? Or do I need to look into using some kind of iterative approach or linear programming instead?

share|cite|improve this question

$\mathbf{C}\mathbf{B}-\mathbf{B}\mathbf{D}=\mathbf{0}$ is a Sylvester equation, for which algorithms like Bartels-Stewart or Hessenberg-Schur apply.

I haven't seen your more general problem in my notes, but I'll update this answer when I find something.

share|cite|improve this answer
Thanks for the info regarding that equation, it was very helpful! It made me realize that finding the solution for the generic case is much more difficult, than I initially had thought. So I ended up using a simple iterative approach to find a solution, and that works well even for the generic case. – Andras Oct 1 '10 at 8:58

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.