Deriving transformation matrix from clues

GooseMunch
Messages
1
Reaction score
0
I have PTV=R where P and T are square matrices (4x4) and V and R are non-square (4x3).
P and V are known, T is unknown, and R is partially known (3 unknown elements).
Seems impossible, but T is a transformation matrix (ie upperleft 3x3 is a rotation matrix) which gives me additional clues.

I'm trying to find T, but I can't figure out how to approach this problem. It's been almost 10 years since I took linear algebra course and I feel very lost.
Seems like I can just rearrange it like so:
T = P'RV' where P' and V' are inverses of P and V respectively but V is non-square so I can only get left-inverse. I don't think pseudoinverse of V is the answer because I'm afraid I'll end up with overdetermined system and the whole thing becomes unsolvable.

Can anyone nudge me in the right direction? Thanks.
 
Physics news on Phys.org
I would write out the entire system of linear equations, and see what can be said about kernel and rank of its coefficient matrix.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top