Orthogonal Procrustes Problem
Versandkostenfrei!
Versandfertig in 6-10 Tagen
22,99 €
inkl. MwSt.
PAYBACK Punkte
11 °P sammeln!
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The orthogonal Procrustes problem is a matrix approximation problem in linear algebra. In its classical form, one is given two matrices A and B and asked to find an orthogonal matrix R which most closely maps A to B. Specifically, R = argmin_Omega AOmega-B _F quadmathrm{subject to}quad Omega^T Omega=I, where cdot _F denotes the Frobenius norm. There are a number of related problems to the classical orthogonal Procrustes problem. One might generalize it by seeking the ...
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The orthogonal Procrustes problem is a matrix approximation problem in linear algebra. In its classical form, one is given two matrices A and B and asked to find an orthogonal matrix R which most closely maps A to B. Specifically, R = argmin_Omega AOmega-B _F quadmathrm{subject to}quad Omega^T Omega=I, where cdot _F denotes the Frobenius norm. 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 with determinant 1 (special orthogonal matrices) In this case, one can write (using the above decomposition M = U V )
