Orthogonal Procrustes Problem - Generalized/constrained Procrustes Problems

Generalized/constrained Procrustes Problems

There are a number of related problems to the classical orthogonal Procrustes problem. One might generalize it by seeking the closest matrix in which the columns are orthogonal, but not necessarily orthonormal.

Alternately, one might constrain it by only allowing rotation matrices (i.e. orthogonal matrices with determinant 1, also known as special orthogonal matrices). In this case, one can write (using the above decomposition )

where is a modified, with the smallest singular value replaced by (+1 or -1), and the other singular values replaced by 1, so that the determinant of R is guaranteed to be positive. For more information, see the Kabsch algorithm.

Read more about this topic:  Orthogonal Procrustes Problem

Famous quotes containing the words generalized, constrained and/or problems:

    One is conscious of no brave and noble earnestness in it, of no generalized passion for intellectual and spiritual adventure, of no organized determination to think things out. What is there is a highly self-conscious and insipid correctness, a bloodless respectability submergence of matter in manner—in brief, what is there is the feeble, uninspiring quality of German painting and English music.
    —H.L. (Henry Lewis)

    An expansive life, one not constrained by four walls, requires as well an expansive pocket.
    Anton Pavlovich Chekhov (1860–1904)

    The truth of the thoughts that are here set forth seems to me unassailable and definitive. I therefore believe myself to have found, on all essential points, the final solution of the problems. And if I am not mistaken in this belief, then the second thing in which the value of this work consists is that it shows how little is achieved when these problems are solved.
    Ludwig Wittgenstein (1889–1951)