The Procrustes Problem for Orthogonal Stiefel Matrices

From MaRDI portal





Two \(m\)-dimensional vectors \(B\) and \(B'\) define an ellipse \(E(t)= B\cos t+ B'\sin t\). Its distance from a point \(A\) is given by the vector \(A-E(t')\) of minimal length. The Procrustes problem is to find the ``angle \(t'\). One can generalize of course, taking \(p < m\) different vectors \(B\) and replacing the two-dimensional vector \((\cos t,\sin t)\) of unit length by \(k < p\) columns of a \(p\times p\) orthogonal matrix (the latter \(k\)-plets form a set \(OSt(p,k)\) of the so called orthogonal Stiefel matrices). The authors propose a class of relaxation methods for generating sequences of approximations to the \(k(p-(k+1)/2)\)-parameteric Stiefel-matrix minimizer. A numerical illustration and geometric interpretation of these methods is offered.











This page was built for publication: The Procrustes Problem for Orthogonal Stiefel Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4509772)