Explanation:
There are several methods to solve equations of the type AX = XB. These type of equations occur in domains like robotics, for which solutions have been proposed like the Tsai and Lenz method [IEEE 1987], for example. 1) I feel solving the equation XA = XB is not the same as solving the known form AX = XB. Am I right? 2) Neither can it be solved like the Sylvester equation, because even that requires AX+XB=CAX+XB=C form. What i have is XA=XBXA=XB, a redundant set of equations. That is,
A1.XA2.XAn.X=X.B1=X.B2⋮=X.BnA1.X=X.B1A2.X=X.B2⋮An.X=X.Bn
If i am correct, these could be rewritten into another form like AX=BXAX=BX. Should i rewrite the equation and try to solve this problem using any other existing methods?