It looks like you're new here. If you want to get involved, click one of these buttons!
I've just been trying to unpick the algorithm in this paper. I had to skip this equation on the first page due to lack of maths fu.
R e = e lambda -- (4)
where R is a symmetric, orthogonal matrix and e is a (presumably column) vector.
I only know right and left eigenvectors:
R e = lambda e -- right
e R = lambda e -- left
so I don't know what (4) represents.
Will somebody please give me a clue? I might add that my ignorance extends to only ever having used right eigenvalues which are apparently convenient for most applications (including all those I've come across). When would I use a left eigenvector?